Quantum accuracy threshold for concatenated distance-3 codes
| dc.creator | Aliferis, Panos | |
| dc.creator | Gottesman, Daniel | |
| dc.creator | Preskill, John | |
| dc.date | 2005-04-28 | |
| dc.date | 2005-10-21 | |
| dc.date.accessioned | 2026-07-07T06:40:57Z | |
| dc.date.available | 2026-07-07T06:40:57Z | |
| dc.description | We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold epsilon_0. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criteria for assessing the accuracy of fault-tolerant circuits, which are particularly conducive to the inductive analysis of recursive simulations. Our lower bound on the threshold, epsilon_0 > 2.73 \times 10^{-5} for an adversarial independent stochastic noise model, is derived from a computer-assisted combinatorial analysis; it is the best lower bound that has been rigorously proven so far. | |
| dc.description | 58 pages, 15 figures, uses qic.sty. (v2): New proof of the main lemma; generalized analysis of local non-Markovian noise. (v3): minor revisions | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0504218 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0504218 | |
| dc.identifier | Quant. Inf. Comput. 6 (2006) 97-165 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/101542 | |
| dc.subject | Quantum Physics | |
| dc.title | Quantum accuracy threshold for concatenated distance-3 codes | |
| dc.type | text |