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

Nature Communications

Almost optimal geometrically local quantum LDPC codes in any dimension

Xingjian Li, Ting-Chun Lin, Adam Wills, Min-Hsiu Hsieh

Published Feb 5, 2026• 2 citations
Publisher

Abstract

with local check operators, have been a subject of significant interest. A key challenge is identifying the optimal code construction that maximizes both code dimension and distance under the geometric constraints. In this work, we introduce a construction that can transform any good quantum LDPC code into an almost optimal geometrically local quantum code. Our approach hinges on a novel yet simple procedure that extracts a two-dimensional structure from an arbitrary three-term chain complex, building a connection between geometric operations and code constructions. We expect that this procedure will find broader applications in areas such as weight reduction and the geometric realization of chain complexes.

DOI
10.1038/s41467-026-69031-w

Related papers

Transform Arbitrary Good Quantum LDPC Codes into Good Geometrically Local Codes in Any Dimension

Xingjian Li, Ting-Chun Lin, Min-Hsiu Hsieh

Geometrically local quantum codes, comprised of qubits and checks embedded in $\mathbb{R}^D$ with local check operators, have been a subject of significant interest. A key challenge is identifying the optimal code construction that maximizes both dimension and distance. Recent advancements have produced several constructions, but these either depend on specific good quantum low-density parity-check (qLDPC) codes or are limited to three dimensions. In this work, we introduce a construction that can transform any good qLDPC code into an optimal geometrically local quantum code. Our approach hinges on a novel procedure that extracts a two-dimensional structure from an arbitrary three-term chain complex. We expect that this procedure will find broader applications in areas such as weight reduction and the geometric realization of chain complexes.

arXiv:2408.01769•Aug 3, 2024•13 citations

Geometrically Local Quantum and Classical Codes from Subdivision

Ting-Chun Lin, Adam Wills, Min-Hsiu Hsieh

A geometrically local quantum code is an error correcting code situated within $\mathbb{R}^D$, where the checks only act on qubits within a fixed spatial distance. The main question is: What is the optimal dimension and distance for a geometrically local code? Recently, Portnoy made a significant breakthrough with codes achieving optimal dimension and distance up to polylogs. However, the construction invokes a somewhat advanced mathematical result that involves lifting a chain complex to a manifold. This paper bypasses this step and streamlines the construction by noticing that a family of good quantum low-density parity-check codes, balanced product codes, naturally carries a two-dimensional structure. Together with a new embedding result that will be shown elsewhere, this quantum code achieves the optimal dimension and distance in all dimensions. In addition, we show that the code has an optimal energy barrier. We also discuss similar results for classical codes.

arXiv:2309.16104•Sep 28, 2023•23 citations

Almost linear decoder for optimal geometrically local quantum codes

Quinten Eggerickx, Adam Wills, Ting-Chun Lin +2 more

Geometrically local quantum codes, which are error-correction codes embedded in R D with checks acting only on qubits within a fixed spatial distance, have garnered significant interest. Recently, it has been demonstrated how to achieve geometrically local codes that maximize both the dimension and the distance, as well as the energy barrier of the code. In this work, we focus on the constructions involving subdivision, and we show that they have an almost linear time decoder, obtained by combining the decoder of the outer good qLDPC code and a generalized version of the Union-Find decoder. This provides the first decoder for an optimal geometrically local three-dimensional code. We demonstrate the existence of a finite threshold error rate under the code capacity noise model using a minimum weight perfect matching decoder. Furthermore, we argue that this threshold is also applicable to the decoder based on the generalized Union-Find algorithm.

arXiv:2411.02928•Physical Review Research•May 12, 2025•2 citations

Simplified Quantum Weight Reduction with Optimal Bounds

Min-Hsiu Hsieh, Xingjian Li, Ting-Chun Lin

Quantum weight reduction is the task of transforming a quantum code with large check weight into one with small check weight. This problem is important in practice, since low-weight measurements are necessary for reliable implementations of quantum error correction on physical hardware. It is also important theoretically, as it can be used to construct constant-locality versions of quantum locally testable codes, which may be relevant to the quantum PCP conjecture. We give a streamlined geometric procedure for quantum weight reduction based entirely on coning and treating X and Z checks symmetrically, which simplifies Hastings' previous approach. In particular, given an arbitrary $[[n,k,d]]$ quantum code with weight $w$, our method produces a code with parameters $[[O(n w^2 \log w), k, Ω(d w)]]$, check weight $5$, and qubit weight $6$; these bounds are optimal or close to optimal within the current geometric framework. Applied to random dense CSS codes, our procedure yields explicit quantum codes surpassing the square-root distance barrier, with parameters $[[n, \tilde Ω(n^{1/3}), \tilde Ω(n^{2/3})]]$. These codes also admit a three-dimensional embedding that saturates the Bravyi-Poulin-Terhal (BPT) bound, recovering the layer-code result. Our weight reduction technique also improves fault-tolerant logical-operator measurements by reducing the required number of ancilla qubits.

arXiv:2510.09601•Oct 10, 2025•12 citations

Breaking the Orthogonality Barrier in Quantum LDPC Codes

Kenta Kasai

Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth of the Tanner graph while maintaining regular degree distributions leads simultaneously to good belief-propagation (BP) decoding performance and large minimum distance. In the quantum setting, however, this principle does not directly apply because quantum LDPC codes must satisfy additional orthogonality constraints between their parity-check matrices. When one enforces both orthogonality and regularity in a straightforward manner, the girth is typically reduced and the minimum distance becomes structurally upper bounded. In this work, we overcome this limitation by using permutation matrices with controlled commutativity and by restricting the orthogonality constraints to only the active part of the construction, while preserving regular check-matrix structures. This design circumvents conventional structural distance limitations induced by parent-matrix orthogonality, and enables the construction of quantum LDPC codes with large girth while avoiding latent low-weight logical operators. As a concrete demonstration, we construct a girth-8, (3,12)-regular $[[9216,4612, \leq 48]]$ quantum LDPC code and show that, under BP decoding combined with a low-complexity post-processing algorithm, it achieves a frame error rate as low as $10^{-8}$ on the depolarizing channel with error probability $4 \%$.

quant-pharXiv:2601.08824•Quantum•Jan 14, 2026•31 citations

Quantum LDPC Codes With Almost Linear Minimum Distance

Pavel Panteleev, Gleb Vyacheslavovich Kalachev

We give a construction of quantum LDPC codes of dimension$\Theta (\log N)$and distance$\Theta (N/\log N)$as the code length$N\to \infty $. Using a product of chain complexes this construction also provides a family of quantum LDPC codes of distance$\Omega (N^{1-\alpha /2}/\log N)$and dimension$\Omega (N^\alpha \log N)$, where$0 \le \alpha < 1$. We also introduce and study a new operation called lifted product, which naturally generalizes the product operations for quantum codes and chain complexes. Moreover, as a simple byproduct of our results on quantum codes, we obtain a new result on classical codes. We show that for any fixed$R < 1$there exists an asymptotically good family of classical quasi-cyclic LDPC codes of rate at least$R$with, in some sense, optimal circulant size$\Omega (N/\log N)$as the code length$N\to \infty $.

arXiv:2012.04068•IEEE Transactions on Information Theory•Oct 11, 2021•231 citations
with local check operators, have been a subject of significant interest. A key challenge is identifying the optimal code construction that maximizes both code dimension and distance under the geometric constraints. In this work, we introduce a construction that can transform any good quantum LDPC code into an almost optimal geometrically local quantum code. Our approach hinges on a novel yet simple procedure that extracts a two-dimensional structure from an arbitrary three-term chain complex, building a connection between geometric operations and code constructions. We expect that this procedure will find broader applications in areas such as weight reduction and the geometric realization of chain complexes.
Geometrically local quantum codes, comprised of qubits and checks embedded in RD\mathbb{R}^DRD with local check operators, have been a subject of significant interest. A key challenge is identifying the optimal code construction that maximizes both dimension and distance. Recent advancements have produced several constructions, but these either depend on specific good quantum low-density parity-check (qLDPC) codes or are limited to three dimensions. In this work, we introduce a construction that can transform any good qLDPC code into an optimal geometrically local quantum code. Our approach hinges on a novel procedure that extracts a two-dimensional structure from an arbitrary three-term chain complex. We expect that this procedure will find broader applications in areas such as weight reduction and the geometric realization of chain complexes.
A geometrically local quantum code is an error correcting code situated within RD\mathbb{R}^DRD, where the checks only act on qubits within a fixed spatial distance. The main question is: What is the optimal dimension and distance for a geometrically local code? Recently, Portnoy made a significant breakthrough with codes achieving optimal dimension and distance up to polylogs. However, the construction invokes a somewhat advanced mathematical result that involves lifting a chain complex to a manifold. This paper bypasses this step and streamlines the construction by noticing that a family of good quantum low-density parity-check codes, balanced product codes, naturally carries a two-dimensional structure. Together with a new embedding result that will be shown elsewhere, this quantum code achieves the optimal dimension and distance in all dimensions. In addition, we show that the code has an optimal energy barrier. We also discuss similar results for classical codes.
Geometrically local quantum codes, which are error-correction codes embedded in R D with checks acting only on qubits within a fixed spatial distance, have garnered significant interest. Recently, it has been demonstrated how to achieve geometrically local codes that maximize both the dimension and the distance, as well as the energy barrier of the code. In this work, we focus on the constructions involving subdivision, and we show that they have an almost linear time decoder, obtained by combining the decoder of the outer good qLDPC code and a generalized version of the Union-Find decoder. This provides the first decoder for an optimal geometrically local three-dimensional code. We demonstrate the existence of a finite threshold error rate under the code capacity noise model using a minimum weight perfect matching decoder. Furthermore, we argue that this threshold is also applicable to the decoder based on the generalized Union-Find algorithm.
Quantum weight reduction is the task of transforming a quantum code with large check weight into one with small check weight. This problem is important in practice, since low-weight measurements are necessary for reliable implementations of quantum error correction on physical hardware. It is also important theoretically, as it can be used to construct constant-locality versions of quantum locally testable codes, which may be relevant to the quantum PCP conjecture. We give a streamlined geometric procedure for quantum weight reduction based entirely on coning and treating X and Z checks symmetrically, which simplifies Hastings' previous approach. In particular, given an arbitrary [[n,k,d]][[n,k,d]][[n,k,d]] quantum code with weight www, our method produces a code with parameters [[O(nw2log⁡w),k,Ω(dw)]][[O(n w^2 \log w), k, Ω(d w)]][[O(nw2logw),k,Ω(dw)]], check weight 555, and qubit weight 666; these bounds are optimal or close to optimal within the current geometric framework. Applied to random dense CSS codes, our procedure yields explicit quantum codes surpassing the square-root distance barrier, with parameters [[n,Ω~(n1/3),Ω~(n2/3)]][[n, \tilde Ω(n^{1/3}), \tilde Ω(n^{2/3})]][[n,Ω~(n1/3),Ω~(n2/3)]]. These codes also admit a three-dimensional embedding that saturates the Bravyi-Poulin-Terhal (BPT) bound, recovering the layer-code result. Our weight reduction technique also improves fault-tolerant logical-operator measurements by reducing the required number of ancilla qubits.
Classical low-density parity-check (LDPC) codes are a widely deployed and well-established technology, forming the backbone of modern communication and storage systems. It is well known that, in this classical setting, increasing the girth of the Tanner graph while maintaining regular degree distributions leads simultaneously to good belief-propagation (BP) decoding performance and large minimum distance. In the quantum setting, however, this principle does not directly apply because quantum LDPC codes must satisfy additional orthogonality constraints between their parity-check matrices. When one enforces both orthogonality and regularity in a straightforward manner, the girth is typically reduced and the minimum distance becomes structurally upper bounded. In this work, we overcome this limitation by using permutation matrices with controlled commutativity and by restricting the orthogonality constraints to only the active part of the construction, while preserving regular check-matrix structures. This design circumvents conventional structural distance limitations induced by parent-matrix orthogonality, and enables the construction of quantum LDPC codes with large girth while avoiding latent low-weight logical operators. As a concrete demonstration, we construct a girth-8, (3,12)-regular [[9216,4612,≤48]][[9216,4612, \leq 48]][[9216,4612,≤48]] quantum LDPC code and show that, under BP decoding combined with a low-complexity post-processing algorithm, it achieves a frame error rate as low as 10−810^{-8}10−8 on the depolarizing channel with error probability 4%4 \%4%.
We give a construction of quantum LDPC codes of dimensionΘ(log⁡N)\Theta (\log N)Θ(logN)and distanceΘ(N/log⁡N)\Theta (N/\log N)Θ(N/logN)as the code length$N\to \infty .UsingaproductofchaincomplexesthisconstructionalsoprovidesafamilyofquantumLDPCcodesofdistance. Using a product of chain complexes this construction also provides a family of quantum LDPC codes of distance.UsingaproductofchaincomplexesthisconstructionalsoprovidesafamilyofquantumLDPCcodesofdistance\Omega (N^{1-\alpha /2}/\log N)anddimensionand dimensionanddimension\Omega (N^\alpha \log N)$, where0≤α<10 \le \alpha < 10≤α<1. We also introduce and study a new operation called lifted product, which naturally generalizes the product operations for quantum codes and chain complexes. Moreover, as a simple byproduct of our results on quantum codes, we obtain a new result on classical codes. We show that for any fixedR<1R < 1R<1there exists an asymptotically good family of classical quasi-cyclic LDPC codes of rate at leastRRRwith, in some sense, optimal circulant sizeΩ(N/log⁡N)\Omega (N/\log N)Ω(N/logN)as the code length$N\to \infty $.