Phys. Rev. A 79, 012332 (2009) [18 pages]Fibonacci scheme for fault-tolerant quantum computation
See accompanying Physics Synopsis 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 0.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. © 2009 The American Physical Society URL:
http://link.aps.org/doi/10.1103/PhysRevA.79.012332
DOI:
10.1103/PhysRevA.79.012332
PACS:
03.67.Lx, 03.67.Pp
|
|
About | Terms and Conditions | Subscriptions | Search | Help
Use of the American Physical Society websites and journals implies that the user has read and agrees to our Terms and Conditions and any applicable Subscription Agreement. Physical Review®, Physical Review Letters®, Reviews of Modern Physics®, and Physical Review Special Topics® are trademarks of the American Physical Society.