Fault tolerance with constant space and constant time overhead
50No. 665 in all physics · No. 32 in Quantum Information and Foundations
This text mentions work from 2024 on. Those parts were partly written without a live literature search and have not been checked by an editor yet.
Theorists can now run a quantum computation reliably with only a constant factor more qubits, but at the price of a slowdown that grows slowly with problem size. Whether both the qubit cost and the slowdown can be constant at once is unknown.
Status in the literature
Unverified note: it names recent work and was partly written without a live literature search; it awaits a check by an editor.
2024 constructions reduced the time overhead to about log N at constant space overhead.
No solutions, ideas or subproblems yet.
See also
- Related Low-overhead universal logical gates on constant-rate qLDPC codes
- Related Provable qLDPC decoders whose proven thresholds match observed ones
Details, signature and history
- Kind
- Well-posed question
- Answer
- Yes no
- Posed
- 2013
- Topic review
- N. P. Breuckmann and J. N. Eberhardt, Quantum Low-Density Parity-Check Codes, PRX Quantum, 2021. Link
- Record
- Revision 2 · notation repaired by the platform · compiled by AI, not yet reviewed by an editor
- Batch approval
- Approved for the batch by Victor Galitski (ORCID 0000-0001-5532-1096) · approval record · bundle This approves the batch, not each problem (what it means).
- AI systems
- AI systems used to prepare this seed revision, as listed in its record: ai:gpt-5.5 (how the seed revision was made)
- Earlier revisions
- revision 1 bundle
Proof
- Fingerprint
- a54a341fc4bc…
- Public log
- Entry 2,024, 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.