An upper bound on quantum fault tolerant thresholds
arXiv:0801.2608
Abstract
In this paper we calculate upper bounds on fault tolerance, without restrictions on the overhead involved. Optimally adaptive recovery operators are used, and the Shannon entropy is used to estimate the thresholds. By allowing for unrealistically high levels of overhead, we find a quantum fault tolerant threshold of 6.88% for the depolarizing noise used by Knill, which compares well to "above 3%" evidenced by Knill. We conjecture that the optimal threshold is 6.90%, based upon the hashing rate. We also perform threshold calculations for types of noise other than that discussed by Knill.
16 pages, REVTex4, 8 QCircuit figures, 1 other figure, minor revisions
References in corpus (12)
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Quantum Computing with Very Noisy Devices
- A Theory of Fault-Tolerant Quantum Computation
- Quantum Channel Capacity of Very Noisy Channels
- Degenerate Quantum Codes for Pauli Channels
- Fault-Tolerant Postselected Quantum Computation: Schemes
- New lower bounds on the non-zero capacity of Pauli Channels
- Quantum Error-Correcting Codes Need Not Completely Reveal the Error Syndrome
- Exact Performance of Concatenated Quantum Codes
- Error-detection-based quantum fault tolerance against discrete Pauli noise
- Correctable noise of Quantum Error Correcting Codes under adaptive concatenation
- Bounding Fault-Tolerant Thresholds for Purification and Quantum Computation