2008/09/30 by Panos Aliferis, John Preskill
Physics and Astronomy · #quant-ph
paper · pdf · doi:10.1103/physreva.79.012332
published as Phys. Rev. A 79, 012332 (2009) · 24 pages, 10 figures; supersedes arXiv:0709.3603. (v2): Additional discussion about the overhead cost
arxiv created 2008/12/17 · arxiv updated 2009/12/01
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.