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

arXiv:2605.31441

Intrinsic locality dimension of quantum codes

Yimin Lu, Esther Xiaozhen Fu, Zi-Wen Liu

quant-phSubmitted May 29, 2026• Announced Jun 1, 2026• 3 citations• Revised Aug 16, 2026 (v2)
v1 · May 29, 2026v2 · Aug 16, 2026
arXivHTMLPDF

Abstract

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.

Comments
40 pages, 7 figures

Related papers

Fault-tolerant logical gates in quantum error-correcting codes

Fernando Pastawski, Beni Yoshida

Recently, S. Bravyi and R. K\"onig [Phys. Rev. Lett. 110, 170503 (2013)] have shown that there is a trade-off between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a constant-depth geometrically local circuit and are thus fault tolerant by construction. In particular, they show that, for local stabilizer codes in $D$ spatial dimensions, locality-preserving gates are restricted to a set of unitary gates known as the $D\mathrm{th}$ level of the Clifford hierarchy. In this paper, we explore this idea further by providing several extensions and applications of their characterization to qubit stabilizer and subsystem codes. First, we present a no-go theorem for self-correcting quantum memory. Namely, we prove that a three-dimensional stabilizer Hamiltonian with a locality-preserving implementation of a non-Clifford gate cannot have a macroscopic energy barrier. This result implies that non-Clifford gates do not admit such implementations in Haah's cubic code and Michnicki's welded code. Second, we prove that the code distance of a $D$-dimensional local stabilizer code with a nontrivial locality-preserving $m\mathrm{th}$-level Clifford logical gate is upper bounded by $O({L}^{D+1\ensuremath{-}m})$. For codes with non-Clifford gates ($m>2$), this improves the previous best bound by S. Bravyi and B. Terhal [New. J. Phys. 11, 043029 (2009)]. Topological color codes, introduced by H. Bombin and M. A. Martin-Delgado [Phys. Rev. Lett. 97, 180501 (2006); Phys. Rev. Lett. 98, 160502 (2007); Phys. Rev. B 75, 075103 (2007)], saturate the bound for $m=D$. Third, we prove that the qubit erasure threshold for codes with a nontrivial transversal $m\mathrm{th}$-level Clifford logical gate is upper bounded by $1/m$. This implies that no family of fault-tolerant codes with transversal gates in increasing level of the Clifford hierarchy may exist. This result applies to arbitrary stabilizer and subsystem codes and is not restricted to geometrically local codes. Fourth, we extend the result of Bravyi and K\"onig to subsystem codes. Unlike stabilizer codes, the so-called union lemma does not apply to subsystem codes. This problem is avoided by assuming the presence of an error threshold in a subsystem code, and a conclusion analogous to that of Bravyi and K\"onig is recovered.

arXiv:1408.1720•Physical Review A•Jan 8, 2015•110 citations

A Topologically Fault-Tolerant Quantum Computer with Four Dimensional Geometric Codes

David Aasen, Matthew B. Hastings, Vadym Kliuchnikov +8 more

Topological quantum codes are intrinsically fault-tolerant to local noise, and underlie the theory of topological phases of matter. We explore geometry to enhance the performance of topological quantum codes by rotating the four dimensional self-correcting quantum memory, and present codes targeted to both near-term and utility-scale quantum computers. We identify a full set of logical Clifford operations and with it design a universal fault-tolerant quantum architecture. Our design achieves single-shot error correction, significant reductions in required qubits, and low-depth logical operations. In turn, our proposed architecture relaxes the requirements for achieving fault tolerance and offers an efficient path for realization in several near-term quantum hardware implementations. Our [[96,6,8]] 4D Hadamard lattice code has low weight-6 stabilizers and depth-8 syndrome extraction circuits, a high pseudo-threshold of $\sim 0.01$, and a logical error rate of $\sim 10^{-6}$ per logical qubit per round of error correction at $10^{-3}$ physical error rate under a standard circuit-level noise model. A Clifford-complete logical gate set is presented, including a constructive and efficient method for Clifford gate synthesis.

arXiv:2506.15130•Jun 18, 2025•12 citations

Locality vs Quantum Codes

Samuel Dai, Ray Li

This paper proves optimal tradeoffs between the locality and parameters of quantum error-correcting codes. Quantum codes give a promising avenue towards quantum fault tolerance, but the practical constraint of locality limits their quality. The seminal Bravyi-Poulin-Terhal (BPT) bound says that a $[[n,k,d]]$ quantum stabilizer code with 2D-locality must satisfy $kd^2\le O(n)$. We answer the natural question: for better code parameters, how much "non-locality" is needed? In particular, (i) how long must the long-range interactions be, and (ii) how many long-range interactions must there be? We give a complete answer to both questions for all $n,k,d$: above the BPT bound, any 2D-embedding must have at least $Ω(\#^*)$ interactions of length $Ω(\ell^*)$, where $\#^*= \max(k,d)$ and $\ell^*=\max\big(\frac{d}{\sqrt{n}}, \big( \frac{kd^2}{n} \big)^{1/4} \big)$. Conversely, we exhibit quantum codes that show, in strong ways, that our interaction length $\ell^*$ and interaction count $\#^*$ are asymptotically optimal for all $n,k,d$. Our results generalize or improve all prior works on this question, including the BPT bound and the results of Baspin and Krishna. One takeaway of our work is that, for any desired distance $d$ and dimension $k$, the number of long-range interactions is asymptotically minimized by a good qLDPC code of length $Θ(\max(k,d))$. Following Baspin and Krishna, we also apply our results to the codes implemented in the stacked architecture and obtain better bounds. In particular, we rule out any implementation of hypergraph product codes in the stacked architecture.

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

Error Correction in Dynamical Codes

Esther Xiaozhen Fu, Daniel Gottesman

We ask what is the general framework for a quantum error correcting code that is defined by a sequence of measurements. Recently, there has been much interest in Floquet codes and space-time codes. In this work, we define and study the distance of a dynamical code. This is a subtle concept and difficult to determine: At any given time, the system will be in a subspace which forms a quantum error-correcting code with a given distance, but the full error correction capability of that code may not be available due to the schedule of measurements associated with the code. We address this challenge by developing an algorithm that tracks information we have learned about the error syndromes through the protocol and put that together to determine the distance of a dynamical code, in a non-fault-tolerant context. We use the tools developed for the algorithm to analyze the initialization and masking properties of a generic Floquet code. Further, we look at properties of dynamical codes under the constraint of geometric locality with a view to understand whether the fundamental limitations on logical gates and code parameters imposed by geometric locality for traditional codes can be surpassed in the dynamical paradigm. We find that codes with a limited number of long range connectivity will not allow non-Clifford gates to be implemented with finite depth circuits in the 2D setting.

arXiv:2403.04163•Quantum•Oct 20, 2025•29 citations

Topological approach toward quantum codes with realistic physical constraints

Beni Yoshida

The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum error-correcting codes with geometrically local generators, (b) the feasibility of a self-correcting quantum memory. To investigate these problems, we study stabilizer codes supported by local interaction terms with translation and scale symmetries on a $D$-dimensional lattice. Our analysis uses the notion of topology emerging in geometric shapes of logical operators, which sheds a surprising new light on theory of quantum codes with physical constraints.

arXiv:1010.3282•Oct 15, 2010•1 citation

Performance of topological codes for quantum error correction

Fern H. E. Watson

In this thesis we present three main contributions to the field of topological quantum error correcting codes. We focus on some of the properties of such codes required for fault-tolerant quantum computation. Prior work has concentrated on determining error rate thresholds of particular models, but increasingly other parameters are gaining prominence. One of these is the overhead -- the quantity of a named resource required to achieve a desired level of performance from the code. We characterise the qubit overhead of the toric code in a fault-tolerant setting. These results provide a general framework for determining the overhead for other code constructions with more complicated noise models. Next we introduce a decoding algorithm, applicable to topological codes in a qudit architecture, specifically those where fault-tolerance is achieved through repeated syndrome measurements. It is computationally light and capable of decoding qudits of arbitrarily high dimension with negligible increase in its run time. The threshold of the decoder is limited by the percolation of the syndromes. Using local matching techniques we are able to overcome this limitation, increasing the threshold by almost a factor of two for high qudit dimensions. Finally, we turn our attention to a second family of topological quantum codes: the colour codes. In three and higher spatial dimensions such codes can support transversal non-Clifford gates. We show, using a technique that we call a star-bipartition of the vertices of the lattice, that any existing qubit colour code lattice can be used to define a qudit colour code. By generalising the notion of triorthogonal matrices we derive analogous transversality properties in the qudit codes.

•Jul 1, 2015•3 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.
Recently, S. Bravyi and R. K\"onig [Phys. Rev. Lett. 110, 170503 (2013)] have shown that there is a trade-off between fault-tolerantly implementable logical gates and geometric locality of stabilizer codes. They consider locality-preserving operations which are implemented by a constant-depth geometrically local circuit and are thus fault tolerant by construction. In particular, they show that, for local stabilizer codes in DDD spatial dimensions, locality-preserving gates are restricted to a set of unitary gates known as the DthD\mathrm{th}Dth level of the Clifford hierarchy. In this paper, we explore this idea further by providing several extensions and applications of their characterization to qubit stabilizer and subsystem codes. First, we present a no-go theorem for self-correcting quantum memory. Namely, we prove that a three-dimensional stabilizer Hamiltonian with a locality-preserving implementation of a non-Clifford gate cannot have a macroscopic energy barrier. This result implies that non-Clifford gates do not admit such implementations in Haah's cubic code and Michnicki's welded code. Second, we prove that the code distance of a DDD-dimensional local stabilizer code with a nontrivial locality-preserving mthm\mathrm{th}mth-level Clifford logical gate is upper bounded by $O({L}^{D+1\ensuremath{-}m})$. For codes with non-Clifford gates (m>2m>2m>2), this improves the previous best bound by S. Bravyi and B. Terhal [New. J. Phys. 11, 043029 (2009)]. Topological color codes, introduced by H. Bombin and M. A. Martin-Delgado [Phys. Rev. Lett. 97, 180501 (2006); Phys. Rev. Lett. 98, 160502 (2007); Phys. Rev. B 75, 075103 (2007)], saturate the bound for m=Dm=Dm=D. Third, we prove that the qubit erasure threshold for codes with a nontrivial transversal mthm\mathrm{th}mth-level Clifford logical gate is upper bounded by 1/m1/m1/m. This implies that no family of fault-tolerant codes with transversal gates in increasing level of the Clifford hierarchy may exist. This result applies to arbitrary stabilizer and subsystem codes and is not restricted to geometrically local codes. Fourth, we extend the result of Bravyi and K\"onig to subsystem codes. Unlike stabilizer codes, the so-called union lemma does not apply to subsystem codes. This problem is avoided by assuming the presence of an error threshold in a subsystem code, and a conclusion analogous to that of Bravyi and K\"onig is recovered.
Topological quantum codes are intrinsically fault-tolerant to local noise, and underlie the theory of topological phases of matter. We explore geometry to enhance the performance of topological quantum codes by rotating the four dimensional self-correcting quantum memory, and present codes targeted to both near-term and utility-scale quantum computers. We identify a full set of logical Clifford operations and with it design a universal fault-tolerant quantum architecture. Our design achieves single-shot error correction, significant reductions in required qubits, and low-depth logical operations. In turn, our proposed architecture relaxes the requirements for achieving fault tolerance and offers an efficient path for realization in several near-term quantum hardware implementations. Our [[96,6,8]] 4D Hadamard lattice code has low weight-6 stabilizers and depth-8 syndrome extraction circuits, a high pseudo-threshold of ∼0.01\sim 0.01∼0.01, and a logical error rate of ∼10−6\sim 10^{-6}∼10−6 per logical qubit per round of error correction at 10−310^{-3}10−3 physical error rate under a standard circuit-level noise model. A Clifford-complete logical gate set is presented, including a constructive and efficient method for Clifford gate synthesis.
This paper proves optimal tradeoffs between the locality and parameters of quantum error-correcting codes. Quantum codes give a promising avenue towards quantum fault tolerance, but the practical constraint of locality limits their quality. The seminal Bravyi-Poulin-Terhal (BPT) bound says that a [[n,k,d]][[n,k,d]][[n,k,d]] quantum stabilizer code with 2D-locality must satisfy kd2≤O(n)kd^2\le O(n)kd2≤O(n). We answer the natural question: for better code parameters, how much "non-locality" is needed? In particular, (i) how long must the long-range interactions be, and (ii) how many long-range interactions must there be? We give a complete answer to both questions for all n,k,dn,k,dn,k,d: above the BPT bound, any 2D-embedding must have at least Ω(#∗)Ω(\#^*)Ω(#∗) interactions of length Ω(ℓ∗)Ω(\ell^*)Ω(ℓ∗), where #∗=max⁡(k,d)\#^*= \max(k,d)#∗=max(k,d) and ℓ∗=max⁡(dn,(kd2n)1/4)\ell^*=\max\big(\frac{d}{\sqrt{n}}, \big( \frac{kd^2}{n} \big)^{1/4} \big)ℓ∗=max(n​d​,(nkd2​)1/4). Conversely, we exhibit quantum codes that show, in strong ways, that our interaction length ℓ∗\ell^*ℓ∗ and interaction count #∗\#^*#∗ are asymptotically optimal for all n,k,dn,k,dn,k,d. Our results generalize or improve all prior works on this question, including the BPT bound and the results of Baspin and Krishna. One takeaway of our work is that, for any desired distance ddd and dimension kkk, the number of long-range interactions is asymptotically minimized by a good qLDPC code of length Θ(max⁡(k,d))Θ(\max(k,d))Θ(max(k,d)). Following Baspin and Krishna, we also apply our results to the codes implemented in the stacked architecture and obtain better bounds. In particular, we rule out any implementation of hypergraph product codes in the stacked architecture.
We ask what is the general framework for a quantum error correcting code that is defined by a sequence of measurements. Recently, there has been much interest in Floquet codes and space-time codes. In this work, we define and study the distance of a dynamical code. This is a subtle concept and difficult to determine: At any given time, the system will be in a subspace which forms a quantum error-correcting code with a given distance, but the full error correction capability of that code may not be available due to the schedule of measurements associated with the code. We address this challenge by developing an algorithm that tracks information we have learned about the error syndromes through the protocol and put that together to determine the distance of a dynamical code, in a non-fault-tolerant context. We use the tools developed for the algorithm to analyze the initialization and masking properties of a generic Floquet code. Further, we look at properties of dynamical codes under the constraint of geometric locality with a view to understand whether the fundamental limitations on logical gates and code parameters imposed by geometric locality for traditional codes can be surpassed in the dynamical paradigm. We find that codes with a limited number of long range connectivity will not allow non-Clifford gates to be implemented with finite depth circuits in the 2D setting.
The following open problems, which concern a fundamental limit on coding properties of quantum codes with realistic physical constraints, are analyzed and partially answered here: (a) the upper bound on code distances of quantum error-correcting codes with geometrically local generators, (b) the feasibility of a self-correcting quantum memory. To investigate these problems, we study stabilizer codes supported by local interaction terms with translation and scale symmetries on a DDD-dimensional lattice. Our analysis uses the notion of topology emerging in geometric shapes of logical operators, which sheds a surprising new light on theory of quantum codes with physical constraints.
In this thesis we present three main contributions to the field of topological quantum error correcting codes. We focus on some of the properties of such codes required for fault-tolerant quantum computation. Prior work has concentrated on determining error rate thresholds of particular models, but increasingly other parameters are gaining prominence. One of these is the overhead -- the quantity of a named resource required to achieve a desired level of performance from the code. We characterise the qubit overhead of the toric code in a fault-tolerant setting. These results provide a general framework for determining the overhead for other code constructions with more complicated noise models. Next we introduce a decoding algorithm, applicable to topological codes in a qudit architecture, specifically those where fault-tolerance is achieved through repeated syndrome measurements. It is computationally light and capable of decoding qudits of arbitrarily high dimension with negligible increase in its run time. The threshold of the decoder is limited by the percolation of the syndromes. Using local matching techniques we are able to overcome this limitation, increasing the threshold by almost a factor of two for high qudit dimensions. Finally, we turn our attention to a second family of topological quantum codes: the colour codes. In three and higher spatial dimensions such codes can support transversal non-Clifford gates. We show, using a technique that we call a star-bipartition of the vertices of the lattice, that any existing qubit colour code lattice can be used to define a qudit colour code. By generalising the notion of triorthogonal matrices we derive analogous transversality properties in the qudit codes.