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

Bulletin of the American Physical Society

Topological quantum error correction in fractal dimensions I: code construction and logical gates

Guanyu Zhu, Arpit Dua, Tomas Jochym-O’Connor

Published Mar 15, 2021• 0 citations
OpenAlex

Related papers

Intrinsic locality dimension of quantum codes

Yimin Lu, Esther Xiaozhen Fu, Zi-Wen Liu

Quantum error-correcting codes are a cornerstone of quantum computing, with broad and profound connections to physics and mathematics. In this work, we introduce the notion of intrinsic locality dimension of stabilizer codes, which is independent of the underlying geometry of quantum codes and naturally extends to non-integer values. Drawing on mathematical tools from fractal geometry and geometric measure theory, the intrinsic locality dimension accommodates flexible architectures and provides a quantitative measure of code connectivity, encompassing both topological codes and algebraic constructions such as bivariate-bicycle-type codes. We show how the intrinsic dimension serves as a fundamental organizing parameter that unifies code properties. In particular, we prove general limitations on code parameters and compatible fault-tolerant logical gates induced by the intrinsic dimension, generalizing the Bravyi--Poulin--Terhal and Bravyi--König bounds for regular topological codes, respectively. Furthermore, we consider implications on thermal properties: toward fully characterizing the geometry requirement for self-correcting quantum memories (SCQMs), we present a conditional no-go result for SCQMs in dimension $3-ε$ and take stock of existing results on low-dimensional SCQMs. Our theory provides a unifying mathematical framework for understanding the fundamental capabilities and geometric implementations of quantum error correction and fault tolerance.

quant-pharXiv:2605.31441•Jun 1, 2026•3 citations

Topological quantum error correction in fractal dimensions II: decoding and threshold estimation

Arpit Dua, Guanyu Zhu, Tomas Jochym-O’Connor

Bulletin of the American Physical Society•Mar 15, 2021•0 citations

Random Local Stabilizer Codes in Three Dimensions without String or Self-Similar Fractal Logical Operators

Han Yan

Quantum error-correcting codes (QECs) are essential components of quantum computation and have deep connections to quantum phases of matter. A key obstruction to passive self-correcting QECs is the presence of string logical operators, which can generate logical errors through constant-energy-barrier processes. Haah's Codes (fracton codes) showed that three-dimensional stabilizer codes can forbid such string logical operators, but their translation-invariant structure supports self-similar fractal logical operators with a logarithmic energy barrier. We introduce the qutrit random cubic codes, a family of local qutrit Calderbank-Shor-Steane stabilizer Hamiltonians with similar cube-check structure as Haah's Code 1 but built from spatially varying stabilizers. We prove that these models retain the no-string property and numerically observe that they have properties distinct from translation-invariant fracton codes: the smallest ground-state degeneracy exponent is $k=2$ for odd $L$ and $k=4$ for even $L$; noncontractible plane-logical operators span the entire logical space; and charge-push diagnostics show that the self-similar fractal operators are absent. These results demonstrate that constrained randomness can fundamentally change the nature of stabilizer codes and improve their self-correction properties. They further point to broader families of quantum error-correcting codes and quantum phases beyond canonical topological and fracton orders.

quant-pharXiv:2606.19873•Jun 19, 2026•0 citations

Quantum error correction with fractal topological codes

Arpit Dua, Tomas Jochym-O’Connor, Guanyu Zhu

Recently, a class of fractal surface codes (FSCs), has been constructed on fractal lattices with Hausdorff dimension 2+ϵ , which admits a fault-tolerant non-Clifford CCZ gate \cite{zhu2021topological}. We investigate the performance of such FSCs as fault-tolerant quantum memories. We prove that there exist decoding strategies with non-zero thresholds for bit-flip and phase-flip errors in the FSCs with Hausdorff dimension 2+ϵ . For the bit-flip errors, we adapt the sweep decoder, developed for string-like syndromes in the regular 3D surface code, to the FSCs by designing suitable modifications on the boundaries of the holes in the fractal lattice. Our adaptation of the sweep decoder for the FSCs maintains its self-correcting and single-shot nature. For the phase-flip errors, we employ the minimum-weight-perfect-matching (MWPM) decoder for the point-like syndromes. We report a sustainable fault-tolerant threshold ( ∼1.7% ) under phenomenological noise for the sweep decoder and the code capacity threshold (lower bounded by 2.95% ) for the MWPM decoder for a particular FSC with Hausdorff dimension DH≈2.966 . The latter can be mapped to a lower bound of the critical point of a confinement-Higgs transition on the fractal lattice, which is tunable via the Hausdorff dimension.

arXiv:2201.03568•Quantum•Sep 26, 2023•14 citations

Quantum Computation with Topological Codes: From Qubit to Topological Fault-Tolerance

Keisuke Fujii

arXiv:1504.01444•SpringerBriefs in mathematical physics•Jan 1, 2015•83 citations

Note on Logical Gates by Gauge Field Formalism of Quantum Error Correction

Junichi Haruna

The gauge field formalism, or operator-valued cochain formalism, has recently emerged as a powerful framework for describing quantum Calderbank-Shor-Steane (CSS) codes. In this work, we extend this framework to construct a broad class of logical gates for general CSS codes, including the S, Hadamard, T, and (multi)controlled-Z gates, under the condition where fault-tolerance or circuit-depth optimality is not necessarily imposed. We show that these logical gates can be expressed as exponentials of polynomial functions of the electric and magnetic gauge fields, which allows us to derive explicit decompositions into physical gates. We further prove that their logical action depends only on the (co)homology classes of the corresponding logical qubits, establishing consistency as logical operations. Our results provide a systematic method for formulating logical gates for general CSS codes, offering new insights into the interplay between quantum error correction, algebraic topology, and quantum field theory.

hep-thCross-listedarXiv:2511.15224•Progress of Theoretical and Experimental Physics•Nov 20, 2025•4 citations
Quantum error-correcting codes are a cornerstone of quantum computing, with broad and profound connections to physics and mathematics. In this work, we introduce the notion of intrinsic locality dimension of stabilizer codes, which is independent of the underlying geometry of quantum codes and naturally extends to non-integer values. Drawing on mathematical tools from fractal geometry and geometric measure theory, the intrinsic locality dimension accommodates flexible architectures and provides a quantitative measure of code connectivity, encompassing both topological codes and algebraic constructions such as bivariate-bicycle-type codes. We show how the intrinsic dimension serves as a fundamental organizing parameter that unifies code properties. In particular, we prove general limitations on code parameters and compatible fault-tolerant logical gates induced by the intrinsic dimension, generalizing the Bravyi--Poulin--Terhal and Bravyi--König bounds for regular topological codes, respectively. Furthermore, we consider implications on thermal properties: toward fully characterizing the geometry requirement for self-correcting quantum memories (SCQMs), we present a conditional no-go result for SCQMs in dimension 3−ε3-ε3−ε and take stock of existing results on low-dimensional SCQMs. Our theory provides a unifying mathematical framework for understanding the fundamental capabilities and geometric implementations of quantum error correction and fault tolerance.
Quantum error-correcting codes (QECs) are essential components of quantum computation and have deep connections to quantum phases of matter. A key obstruction to passive self-correcting QECs is the presence of string logical operators, which can generate logical errors through constant-energy-barrier processes. Haah's Codes (fracton codes) showed that three-dimensional stabilizer codes can forbid such string logical operators, but their translation-invariant structure supports self-similar fractal logical operators with a logarithmic energy barrier. We introduce the qutrit random cubic codes, a family of local qutrit Calderbank-Shor-Steane stabilizer Hamiltonians with similar cube-check structure as Haah's Code 1 but built from spatially varying stabilizers. We prove that these models retain the no-string property and numerically observe that they have properties distinct from translation-invariant fracton codes: the smallest ground-state degeneracy exponent is k=2k=2k=2 for odd LLL and k=4k=4k=4 for even LLL; noncontractible plane-logical operators span the entire logical space; and charge-push diagnostics show that the self-similar fractal operators are absent. These results demonstrate that constrained randomness can fundamentally change the nature of stabilizer codes and improve their self-correction properties. They further point to broader families of quantum error-correcting codes and quantum phases beyond canonical topological and fracton orders.
Recently, a class of fractal surface codes (FSCs), has been constructed on fractal lattices with Hausdorff dimension 2+ϵ , which admits a fault-tolerant non-Clifford CCZ gate \cite{zhu2021topological}. We investigate the performance of such FSCs as fault-tolerant quantum memories. We prove that there exist decoding strategies with non-zero thresholds for bit-flip and phase-flip errors in the FSCs with Hausdorff dimension 2+ϵ . For the bit-flip errors, we adapt the sweep decoder, developed for string-like syndromes in the regular 3D surface code, to the FSCs by designing suitable modifications on the boundaries of the holes in the fractal lattice. Our adaptation of the sweep decoder for the FSCs maintains its self-correcting and single-shot nature. For the phase-flip errors, we employ the minimum-weight-perfect-matching (MWPM) decoder for the point-like syndromes. We report a sustainable fault-tolerant threshold ( ∼1.7% ) under phenomenological noise for the sweep decoder and the code capacity threshold (lower bounded by 2.95% ) for the MWPM decoder for a particular FSC with Hausdorff dimension DH≈2.966 . The latter can be mapped to a lower bound of the critical point of a confinement-Higgs transition on the fractal lattice, which is tunable via the Hausdorff dimension.
The gauge field formalism, or operator-valued cochain formalism, has recently emerged as a powerful framework for describing quantum Calderbank-Shor-Steane (CSS) codes. In this work, we extend this framework to construct a broad class of logical gates for general CSS codes, including the S, Hadamard, T, and (multi)controlled-Z gates, under the condition where fault-tolerance or circuit-depth optimality is not necessarily imposed. We show that these logical gates can be expressed as exponentials of polynomial functions of the electric and magnetic gauge fields, which allows us to derive explicit decompositions into physical gates. We further prove that their logical action depends only on the (co)homology classes of the corresponding logical qubits, establishing consistency as logical operations. Our results provide a systematic method for formulating logical gates for general CSS codes, offering new insights into the interplay between quantum error correction, algebraic topology, and quantum field theory.