Largest noise rate allowing fault-tolerant universal quantum computation
46No. 831 in all physics · No. 42 in Quantum Information and Foundations
Consider circuits of unitary two-qubit gates whose input wires each suffer depolarizing noise of strength $p$, with noise-free one-qubit unitaries and fresh ancilla qubits, as in Kempe, Regev, Unger and de Wolf (arXiv:0802.1464, 2008), who prove that above $p=35.7\%$ ($29.3\%$ if the only two-qubit gate is CNOT) the output of any deep enough circuit is independent of its input. Find $p_{\mathrm{th}}$, the supremum of $p$ at which arbitrarily long computations remain reliable with polylogarithmic overhead. Constructive schemes reach of order $1\%$ in simulation and rigorous lower bounds are of order $10^{-5}$ to $10^{-4}$ (approximate).
What would settle it
Matching or near-matching upper and lower bounds on $p_{\mathrm{th}}$ for the stated noise model.
No solutions, ideas or subproblems yet.
See also
- Related Threshold theorem for noise with slowly decaying spatial correlations
- Related Does the optimal toric-code depolarizing threshold equal the hashing bound?
Details, signature and history
- Kind
- Well-posed question
- Answer
- Value
- Posed
- 2008
- Topic review
- B. M. Terhal, Quantum error correction for quantum memories, Reviews of Modern Physics, 2015. Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- 8f81e7318b2e…
- Public log
- Entry 1,996, in checkpoint 2,123
- In the log by
- Block 969,698, 2026-10-03
This text was in the PubPhys log by that date. The date says nothing about when the problem was first posed.
Comments (0)
Comments are not records: they are not signed, stamped or logged. How comments work
No comments yet.
Sign in to comment.