Low-overhead universal logical gates on constant-rate qLDPC codes
78No. 47 in all physics · No. 5 in Quantum Information and Foundations
For a constant-rate qLDPC family with distance d, give a fault-tolerant implementation of a universal logical gate set (all logical Clifford gates plus one non-Clifford gate on any chosen logical qubits) that uses O(n) ancilla qubits, has space-time cost per logical gate O(d polylog d), and has a threshold under circuit-level noise. Candidate ingredients include code surgery, code automorphisms and codes with transversal CCZ.
What would settle it
An explicit gate scheme with stated overhead and a threshold proof or convincing circuit-level simulation at relevant sizes.
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.
Several 2024-2026 schemes cover parts of the gate set at moderate overhead.
No solutions, ideas or subproblems yet.
See also
Details, signature and history
- Kind
- Well-posed question
- Answer
- Identification
- Topic review
- N. P. Breuckmann and J. N. Eberhardt, Quantum Low-Density Parity-Check Codes, PRX Quantum, 2021. Link
- Record
- Revision 1 · imported from the seed collection · compiled by AI, not yet reviewed by an editor
Proof
- Fingerprint
- 03bf09b32657…
- Public log
- Entry 2,025, 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.