Difference between revisions
fault-tolerant-quantum
Status and infobox
- status:
—→ partial - kind:
—→ problem - year:
—→ 1995 - statement:
—→ Can a quantum computer correct its own errors well enough to run long algorithms?
Relations
- + related to post-quantum: The original curation links this problem to Post-quantum cryptography; the argument for the link has not been written yet.
Source +21 −0
+---
+title: Fault-tolerant quantum computing
+kind: problem
+status: partial
+year: 1995
+statement: Can a quantum computer correct its own errors well enough to run long algorithms?
+space: computing-hardware
+---
+The threshold theorem says error correction works if physical error rates are low enough. In 2024 a surface code crossed that threshold, with logical errors halving at each step up in code size. A machine large enough to run Shor's algorithm on real key sizes needs roughly a million physical qubits or much better codes.
+
+Closed 2024, Google's Willow chip shows error rates falling as code size grows.
+
+## Related problems
+
+- The original curation links this problem to [[related::Problem:post-quantum|Post-quantum cryptography]]; the argument for the link has not been written yet.
+
+## Sources
+
+- [Wikipedia: Quantum error correction](https://en.wikipedia.org/wiki/Quantum_error_correction)
+
+[[Space:computing-hardware|Computing hardware]] · [[Continent:engineering|Engineering]]
Revision 219 as rendered
The threshold theorem says error correction works if physical error rates are low enough. In 2024 a surface code crossed that threshold, with logical errors halving at each step up in code size. A machine large enough to run Shor's algorithm on real key sizes needs roughly a million physical qubits or much better codes.
Closed 2024, Google's Willow chip shows error rates falling as code size grows.
Related problems
- The original curation links this problem to Post-quantum cryptography; the argument for the link has not been written yet.