Purely-logarithmic-time- and constant-space-overhead fault-tolerant quantum computation

arXiv:2609.28461 · quant-ph · Submitted 2026-09-23 · Read on arXiv

quant-ph

Submitted: 2026-09-23

Updated: 2026-09-24

Terminology

• Trace — 27× in this paper · explained in 2 episodes
• Distillation — 11× in this paper · explained in 2 episodes
• Core — 7× in this paper · explained in 2 episodes
• Entanglement — 5× in this paper · explained in 4 episodes
• Verification — 3× in this paper · explained in 2 episodes
• CSS Codes — 2× in this paper · explained in 2 episodes
• Decode — 2× in this paper · explained in 2 episodes
• Embeddings — 2× in this paper · explained in 2 episodes
• Robustness — 2× in this paper · explained in 5 episodes
• Stabilizer States — 2× in this paper · explained in 2 episodes
• Accuracy — 1× in this paper · explained in 1 episode
• Consistency — 1× in this paper · explained in 3 episodes
• Generative AI — 1× in this paper · explained in 2 episodes
• Sparsity — 1× in this paper · explained in 4 episodes

Sources

• Parallelizable and addressable transversal non-Clifford gates on good quantum LDPC codes

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity