Postselection threshold against biased noise
arXiv:quant-ph/0608018 · doi:10.1109/FOCS.2006.64
Abstract
The highest current estimates for the amount of noise a quantum computer can tolerate are based on fault-tolerance schemes relying heavily on postselecting on no detected errors. However, there has been no proof that these schemes give even a positive tolerable noise threshold. A technique to prove a positive threshold, for probabilistic noise models, is presented. The main idea is to maintain strong control over the distribution of errors in the quantum state at all times. This distribution has correlations which conceivably could grow out of control with postselection. But in fact, the error distribution can be written as a mixture of nearby distributions each satisfying strong independence properties, so there are no correlations for postselection to amplify.
13 pages, FOCS 2006; conference version
References in corpus (11)
- Improved Simulation of Stabilizer Circuits
- Quantum Computing with Very Noisy Devices
- Fault-tolerant quantum computation with long-range correlated noise
- Improved magic states distillation for quantum universality
- Local Fault-tolerant Quantum Computation
- Quantum accuracy threshold for concatenated distance-3 codes
- Fault-Tolerant Postselected Quantum Computation: Schemes
- Fault-Tolerant Postselected Quantum Computation: Threshold Analysis
- Improved ancilla preparation scheme increases fault-tolerant threshold
- Scalable Quantum Computation in the Presence of Large Detected-Error Rates
- Fault-Tolerant Quantum Computation for Local Leakage Faults