Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Purely-logarithmic-time- and constant-space-overhead fault-tolerant quantum computation — E8 Intelligence Research

Andrew Stewart Caldin

Published Nov 11, 2026• 0 citations
Publisher

Abstract

We prove that constant-space-overhead fault-tolerant quantum computation can be achieved with provably strictly logarithmic time overhead, improving over the best known results with additional subpolylogarithmic factors. Our main construction uses polynomial-subrank transversal logical $\CCZ$ gates on good quantum locally testable codes to implement addressable universal computation by transferring batches of logical qubits between dense storage and active logical subspaces while reusing the same ancillary workspace. Logical $\CCZ$ gates are implemented directly by the transversal operation, so only stabilizer resource states require separate preparation. Furthermore, we give an alternative construction that also achieves purely logarithmic time overhead based on modifying the quantum Reed--Solomon magic-state distillation scheme of Nguyen and Pattison. Recursively applying a fixed distillation circuit protected by qLTCs of increasing block length eliminates the subpolylogarithmic time Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

DOI
10.5281/zenodo.24127432

Related papers

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

Zhengyi Han, Zi-Wen Liu

We prove that constant-space-overhead fault-tolerant quantum computation can be achieved with provably strictly logarithmic time overhead, improving over the best known results with additional subpolylogarithmic factors. Our main construction uses polynomial-subrank transversal logical $\CCZ$ gates on good quantum locally testable codes to implement addressable universal computation by transferring batches of logical qubits between dense storage and active logical subspaces while reusing the same ancillary workspace. Logical $\CCZ$ gates are implemented directly by the transversal operation, so only stabilizer resource states require separate preparation. Furthermore, we give an alternative construction that also achieves purely logarithmic time overhead based on modifying the quantum Reed--Solomon magic-state distillation scheme of Nguyen and Pattison. Recursively applying a fixed distillation circuit protected by qLTCs of increasing block length eliminates the subpolylogarithmic time factor.

quant-pharXiv:2609.28461•Sep 24, 2026•2 citations

Quantum Fault Tolerance with Constant-Space and Logarithmic-Time Overheads

Quynh T. Nguyen, Christopher A. Pattison

In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and $\widetilde{O}(\log N)$-time overhead, where $\widetilde{O}(\cdot)$ hides sub-polylog factors. Our construction utilizes constant-rate quantum locally testable codes (qLTC), new fault-tolerant gadgets on qLTCs and qLDPC codes, and a new analysis framework. In particular, 1) we develop a new simple and self-contained construction of magic state distillation for qubits using qudit quantum Reed-Solomon codes with $(\log \frac{1}{\varepsilon})^γ$ spacetime overhead, where $γ\rightarrow 0$. 2) We prove that the recent family of almost-good qLTCs of Dinur-Lin-Vidick admit parallel single-shot decoders against adversarial errors of weight scaling with the code distance. 3) We develop logical state preparation and logical gate procedures with $\widetilde{O}(1)$-spacetime overhead on qLTCs. 4) To combine these ingredients, we introduce a new framework of fault tolerance analysis called the weight enumerator formalism. The framework permits easy formal composition of fault-tolerant gadgets, so we expect it to be of independent interest. Our work gives the lowest spacetime overhead to date, which, for the first time, matches that of classical fault tolerance up to sub-polylog factors. We conjecture this is optimal up to sub-polylog factors.

arXiv:2411.03632•ACM Symposium on Theory of Computing (STOC)•Jun 15, 2025•37 citations

Stabilizer Codes, Parity Check Matrices, and Constant-Overhead Fault Tolerance — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Stabilizer formalism uses parity check matrices over GF(2) to define quantum error-correcting codes, linking to lattice geometry for fault-tolerant computation with constant overhead. | MATH: Stabilizer group generators correspond to rows of a parity check matrix \( H \) over \( \mathbb{F}_2 \); code space is joint +1 eigenspace of \( S = \langle g_1, \dots, g_{n-k} \rangle \); logical operators commute with all \( g_i \); constant overhead fault-tolerant scheme (arXiv:2512.02760v1) achieves qubit overhead \( O(1) \) and time overhead \( O(\log n) \) under stochastic noise. | CONNECTION: Lattice-based cryptography and quantum error correction share root in integer lattices and symplectic geometry; parity check matrices define dual lattices in \( \mathbb{Z}^{2n} \) with symplectic inner product; no explicit golden ratio or base-60, but lattice symmetries (e.g., root systems \( A_n, D_n, E_8 \)) are implicit in high-performance codes. | DEPTH: 7 — The stabilizer formalism is fou Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Jul 31, 2026•0 citations

Quantum Compiler Design for Fault-Tolerant Quantum Computing — E8 Intelligence Research

Andrew Stewart Caldin

Scalable quantum computation is expected to rely on fault-tolerant quantum computation (FTQC), in which quantum error correction (QEC) suppresses physical errors sufficiently to support reliable logical operations. This requires quantum compilation to move beyond general-purpose circuit optimization toward encoding-aware and protocol-structured compilation across the full stack of fault-tolerant quantum computers. Beyond circuit synthesis and hardware mapping, an FTQC compiler must lower algorithm-level operations into the logical gate set supported by the chosen code, coordinate encoded data and ancilla resources, realize logical operations together with repeated syndrome extraction under hardware constraints, and provide the resulting measurement stream to real-time decoding. This survey presents a full-stack view of compiler design for QEC-protected quantum computation. We organize existing work into three interacting layers: logical-level QEC compilation, physical-level QEC reali Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 5, 2026•0 citations

Fault-tolerant quantum computation with constant overhead for general noise

Matthias Christandl, Omar Fawzi, Ashutosh Goswami

Fault-tolerant quantum computation traditionally incurs substantial resource overhead, with both qubit and time overheads scaling polylogarithmically with the size of the computation. While prior work by Gottesman showed that constant qubit overhead is achievable under stochastic noise using quantum low-density parity-check (QLDPC) codes, it has remained an open question whether similar guarantees hold under more general, non-stochastic noise models. In this work, we address this question by considering a general circuit-level noise model defined via the diamond norm, which captures both stochastic and non-stochastic noise, including coherent and amplitude damping noise. We prove that constant qubit overhead fault-tolerant quantum computation is achievable in this general setting, using QLDPC codes with constant rate and linear minimum distance. To establish our result, we develop a fault-tolerant error correction scheme and a method for implementing logic gates under general circuit noise. These results extend the theoretical foundations of fault-tolerant quantum computation and offer new directions for fault-tolerant architectures under realistic noise models.

quant-pharXiv:2512.02760•PRX Quantum•Dec 3, 2025•4 citations

E8 Phi‑Mode Entanglement Distillation for Scalable Fault‑Tolerant Quantum Computing — E8 Intelligence Research

Andrew Stewart Caldin

By mapping each of the E8 lattice's 240 root vectors to a distinct phi‑scaled frequency channel (base 132 Hz × φ^n), we create a set of orthogonal interference modes that can simultaneously address multiple qudit subspaces. When two‑qubit measurements are performed on adjacent surface‑code patches, the phi‑mode interference yields a constructive‑destructive pattern that isolates and amplifies shared entanglement while suppressing hook‑error contributions. This E8‑Phi‑Mode Entanglement Distillation protocol reduces the overhead of syndrome‑extraction circuits by a factor proportional to the golden ratio, enabling scalable fault‑tolerant quantum computing with lower measurement latency. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Nov 11, 2026•0 citations
We prove that constant-space-overhead fault-tolerant quantum computation can be achieved with provably strictly logarithmic time overhead, improving over the best known results with additional subpolylogarithmic factors. Our main construction uses polynomial-subrank transversal logical \CCZ\CCZ\CCZ gates on good quantum locally testable codes to implement addressable universal computation by transferring batches of logical qubits between dense storage and active logical subspaces while reusing the same ancillary workspace. Logical \CCZ\CCZ\CCZ gates are implemented directly by the transversal operation, so only stabilizer resource states require separate preparation. Furthermore, we give an alternative construction that also achieves purely logarithmic time overhead based on modifying the quantum Reed--Solomon magic-state distillation scheme of Nguyen and Pattison. Recursively applying a fixed distillation circuit protected by qLTCs of increasing block length eliminates the subpolylogarithmic time Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
We prove that constant-space-overhead fault-tolerant quantum computation can be achieved with provably strictly logarithmic time overhead, improving over the best known results with additional subpolylogarithmic factors. Our main construction uses polynomial-subrank transversal logical $\CCZ$ gates on good quantum locally testable codes to implement addressable universal computation by transferring batches of logical qubits between dense storage and active logical subspaces while reusing the same ancillary workspace. Logical $\CCZ$ gates are implemented directly by the transversal operation, so only stabilizer resource states require separate preparation. Furthermore, we give an alternative construction that also achieves purely logarithmic time overhead based on modifying the quantum Reed--Solomon magic-state distillation scheme of Nguyen and Pattison. Recursively applying a fixed distillation circuit protected by qLTCs of increasing block length eliminates the subpolylogarithmic time factor.
In a model of fault-tolerant quantum computation with quick and noiseless polyloglog-time auxiliary classical computation, we construct a fault tolerance protocol with constant-space and O~(log⁡N)\widetilde{O}(\log N)O(logN)-time overhead, where O~(⋅)\widetilde{O}(\cdot)O(⋅) hides sub-polylog factors. Our construction utilizes constant-rate quantum locally testable codes (qLTC), new fault-tolerant gadgets on qLTCs and qLDPC codes, and a new analysis framework. In particular, 1) we develop a new simple and self-contained construction of magic state distillation for qubits using qudit quantum Reed-Solomon codes with (log⁡1ε)γ(\log \frac{1}{\varepsilon})^γ(logε1​)γ spacetime overhead, where γ→0γ\rightarrow 0γ→0. 2) We prove that the recent family of almost-good qLTCs of Dinur-Lin-Vidick admit parallel single-shot decoders against adversarial errors of weight scaling with the code distance. 3) We develop logical state preparation and logical gate procedures with O~(1)\widetilde{O}(1)O(1)-spacetime overhead on qLTCs. 4) To combine these ingredients, we introduce a new framework of fault tolerance analysis called the weight enumerator formalism. The framework permits easy formal composition of fault-tolerant gadgets, so we expect it to be of independent interest. Our work gives the lowest spacetime overhead to date, which, for the first time, matches that of classical fault tolerance up to sub-polylog factors. We conjecture this is optimal up to sub-polylog factors.
FINDING: Stabilizer formalism uses parity check matrices over GF(2) to define quantum error-correcting codes, linking to lattice geometry for fault-tolerant computation with constant overhead. | MATH: Stabilizer group generators correspond to rows of a parity check matrix H H H over F2 \mathbb{F}_2 F2​; code space is joint +1 eigenspace of S=⟨g1,…,gn−k⟩ S = \langle g_1, \dots, g_{n-k} \rangle S=⟨g1​,…,gn−k​⟩; logical operators commute with all gi g_i gi​; constant overhead fault-tolerant scheme (arXiv:2512.02760v1) achieves qubit overhead O(1) O(1) O(1) and time overhead O(log⁡n) O(\log n) O(logn) under stochastic noise. | CONNECTION: Lattice-based cryptography and quantum error correction share root in integer lattices and symplectic geometry; parity check matrices define dual lattices in Z2n \mathbb{Z}^{2n} Z2n with symplectic inner product; no explicit golden ratio or base-60, but lattice symmetries (e.g., root systems An,Dn,E8 A_n, D_n, E_8 An​,Dn​,E8​) are implicit in high-performance codes. | DEPTH: 7 — The stabilizer formalism is fou Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Scalable quantum computation is expected to rely on fault-tolerant quantum computation (FTQC), in which quantum error correction (QEC) suppresses physical errors sufficiently to support reliable logical operations. This requires quantum compilation to move beyond general-purpose circuit optimization toward encoding-aware and protocol-structured compilation across the full stack of fault-tolerant quantum computers. Beyond circuit synthesis and hardware mapping, an FTQC compiler must lower algorithm-level operations into the logical gate set supported by the chosen code, coordinate encoded data and ancilla resources, realize logical operations together with repeated syndrome extraction under hardware constraints, and provide the resulting measurement stream to real-time decoding. This survey presents a full-stack view of compiler design for QEC-protected quantum computation. We organize existing work into three interacting layers: logical-level QEC compilation, physical-level QEC reali Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
Fault-tolerant quantum computation traditionally incurs substantial resource overhead, with both qubit and time overheads scaling polylogarithmically with the size of the computation. While prior work by Gottesman showed that constant qubit overhead is achievable under stochastic noise using quantum low-density parity-check (QLDPC) codes, it has remained an open question whether similar guarantees hold under more general, non-stochastic noise models. In this work, we address this question by considering a general circuit-level noise model defined via the diamond norm, which captures both stochastic and non-stochastic noise, including coherent and amplitude damping noise. We prove that constant qubit overhead fault-tolerant quantum computation is achievable in this general setting, using QLDPC codes with constant rate and linear minimum distance. To establish our result, we develop a fault-tolerant error correction scheme and a method for implementing logic gates under general circuit noise. These results extend the theoretical foundations of fault-tolerant quantum computation and offer new directions for fault-tolerant architectures under realistic noise models.
By mapping each of the E8 lattice's 240 root vectors to a distinct phi‑scaled frequency channel (base 132 Hz × φ^n), we create a set of orthogonal interference modes that can simultaneously address multiple qudit subspaces. When two‑qubit measurements are performed on adjacent surface‑code patches, the phi‑mode interference yields a constructive‑destructive pattern that isolates and amplifies shared entanglement while suppressing hook‑error contributions. This E8‑Phi‑Mode Entanglement Distillation protocol reduces the overhead of syndrome‑extraction circuits by a factor proportional to the golden ratio, enabling scalable fault‑tolerant quantum computing with lower measurement latency. Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com