The Fibonacci Scheme for Fault-tolerant Quantum Computation

We rigorously analyze Knill’s Fibonacci scheme for fault-tolerant quantum computation, which is based on the recursive preparation of Bell states protected by a concatenated error-detecting code. We prove lower bounds on the threshold fault rate of .67×10−3 for adversarial local stochastic noise, and 1.25 × 10−3 for independent depolarizing noise. In contrast to other schemes with comparable proved accuracy thresholds, the Fibonacci scheme has a significantly reduced overhead cost because it uses postselection far more sparingly.

By: Panos Aliferis; John Preskill

Published in: Physical Review. A. General Physics, volume 79, (no 1), pages Art No. 012332 in 2009

Please obtain a copy of this paper from your local library. IBM cannot distribute this paper externally.

Questions about this service can be mailed to .