Accuracy threshold for postselected quantum computation
arXiv:quant-ph/0703264
Abstract
We prove an accuracy threshold theorem for fault-tolerant quantum computation based on error detection and postselection. Our proof provides a rigorous foundation for the scheme suggested by Knill, in which preparation circuits for ancilla states are protected by a concatenated error-detecting code and the preparation is aborted if an error is detected. The proof applies to independent stochastic noise but (in contrast to proofs of the quantum accuracy threshold theorem based on concatenated error-correcting codes) not to strongly-correlated adversarial noise. Our rigorously established lower bound on the accuracy threshold, 1.04 \times 10^{-3}, is well below Knill's numerical estimates.
54 pages, 26 figures, uses qic.sty. (v2): minor revisions
References in corpus (13)
- Mixed State Entanglement and Quantum Error Correction
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Computing with Very Noisy Devices
- Operator Quantum Error Correcting Subsystems for Self-Correcting Quantum Memories
- Stabilizer Formalism for Operator Quantum Error Correction
- Active stabilisation, quantum computation and quantum state synthesis
- Fault-tolerant quantum computation with long-range correlated noise
- Subsystem fault tolerance with the Bacon-Shor code
- Fault-Tolerant Quantum Computation For Local Non-Markovian Noise
- Fault-Tolerant Postselected Quantum Computation: Schemes
- Concatenated Quantum Codes
- Error-detection-based quantum fault tolerance against discrete Pauli noise
- Postselection threshold against biased noise