The Fibonacci scheme for fault-tolerant quantum computation
| dc.creator | Aliferis, Panos | |
| dc.creator | Preskill, John | |
| dc.date | 2008-09-30 | |
| dc.date | 2008-12-17 | |
| dc.date.accessioned | 2026-07-07T12:35:25Z | |
| dc.date.available | 2026-07-07T12:35:25Z | |
| dc.description | 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\times 10^{-3} for adversarial local stochastic noise, and 1.25\times 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. | |
| dc.description | 24 pages, 10 figures; supersedes arXiv:0709.3603. (v2): Additional discussion about the overhead cost | |
| dc.identifier | https://arxiv.org/abs/0809.5063 | |
| dc.identifier | http://arxiv.org/abs/0809.5063 | |
| dc.identifier | Phys. Rev. A 79, 012332 (2009) | |
| dc.identifier | doi:10.1103/PhysRevA.79.012332 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/217761 | |
| dc.subject | Quantum Physics | |
| dc.title | The Fibonacci scheme for fault-tolerant quantum computation | |
| dc.type | text |