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:2611.02963

Full-Rank Constructions of Explicit Lossless Expanders and Good Small-Set qLTCs

Yali Aharon-Holzman, Michael Ilan, Assaf Reiner, Amnon Ta-Shma

quant-phcs.CCcs.DSmath.COmath.GRSubmitted Nov 2, 2026• Announced Nov 3, 2026• 0 citations
arXivHTMLPDF

Abstract

We construct explicit two-sided lossless expanders whose binary adjacency matrices have full rank, and use them to obtain explicit asymptotically good quantum LDPC codes whose specified X- and Z-check matrices have full row rank and satisfy small-set soundness, or confinement, on a linear range. Our lossless expanders are a variant of those of Hsieh, Lubotzky, Mohanty, Reiner, and Zhang, with a free action of a finite 2-group. Under such an action, injectivity and surjectivity of the adjacency matrix are detected on a fixed-size matrix indexed by vertex orbits. Adding a sparse factor to the gadget at the middle vertices of a single type then enforces full rank, with a controlled loss in expansion. To obtain the 2-group action, we observe that reducing the generators of the Lubotzky-Phillips-Sarnak Ramanujan graphs modulo powers of 2, instead of modulo an odd prime, gives Ramanujan Cayley graphs on finite 2-groups. This construction may be of independent interest. Plugging two such expanders into the balanced product of Lin and Hsieh gives the quantum codes, since full rank of the input graphs is inherited by the check matrices. Our construction supplies the code family sought by Hong, Guo, and Lucas. Applying their analysis, within their framework and under their dynamical assumptions, gives quantum memories whose free-energy density is analytic at every positive temperature and whose guaranteed lifetime is $exp(Ω(N))$ at sufficiently low fixed positive temperature, where N is the blocklength. This improves the previously guaranteed stretched-exponential timescale.

AI Summary

The paper addresses whether asymptotically good quantum LDPC codes can simultaneously have independent specified sparse checks and small-set confinement on a linear range. These properties support long-lived quantum memories with analytic positive-temperature free-energy density; previously studied examples had only $O(\sqrt N)$ distance and confinement range. It constructs explicit binary CSS code families with full-row-rank $H_X,H_Z$, bounded row and column weights, and distance greater than $\alpha N$. For any integers $t_1,t_2\ge2$, the rate is exactly $K/N=(t_1-1)(t_2-1)/(t_1t_2+1)$, approaching one as both parameters grow. For any prescribed constant $\gamma_0>0$, syndrome weight is at least $\gamma_0$ times error weight reduced modulo stabilizers whenever that reduced weight is at most $\alpha N$. Sparsity bounds and $\alpha>0$ depend on the chosen parameters. The construction first produces explicit two-sided lossless expanders with full-rank binary adjacency matrices and free finite $2$-group actions. Equivariant injectivity and surjectivity reduce to a fixed-size matrix indexed by vertex orbits. A sparse gadget modification enforces rank while controlling expansion loss. The required symmetry comes from reducing LPS quaternion generators modulo powers of two, yielding Ramanujan Cayley graphs on $2$-groups. The Lin–Hsieh balanced product transfers expansion and rank to the quantum checks. Applying the Hong–Guo–Lucas analysis, within its framework and dynamical assumptions, gives guaranteed lifetime $\exp(\Omega(N))$ at sufficiently low fixed positive temperature while retaining thermodynamic analyticity. The result asserts small-set, not full-range, quantum local testability. Local check enumeration is polylogarithmic in $N$ after parameter-dependent finite precomputation.

Likely largely AI-generatedAI use disclosed
Both tools were used to examine proofs for gaps, to derive soundness estimates and parameter choices, for exploratory computations, and to draft and revise the manuscript.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
32 pages, 1 figure

Related papers

Good Quantum Locally Testable Codes from Lossless Cubical Complexes

Itay Cohen, Itai Leigh, Assaf Reiner +2 more

Sipser and Spielman constructed LDPC codes from either bipartite \emph{spectral} expanders or one-sided \emph{lossless} expanders. In higher dimensions, \emph{spectral} expansion similarly played a central role in the constructions of asymptotically good classical LTCs and qLDPC codes by Dinur, Evra, Livne, Lubotzky, and Mozes and by Panteleev and Kalachev. Alternatively, Lin and Hsieh constructed classical LTCs and qLDPC codes from two-dimensional \emph{lossless} cubical complexes. In this work we develop the higher-dimensional \emph{lossless} approach. We do not construct the required high-dimensional lossless cubical complexes; rather, we investigate what their existence would imply. We associate with a high-dimensional cubical complex a \emph{level chain complex}, whose chain groups are supported on the level sets of the Boolean cube rather than on its cells. Our main technical contribution is a clean local-to-global theorem for this structure: suitable one-dimensional lossless expansion in the directional graphs implies small-set coboundary expansion of the global level complex. As a consequence, sufficiently imbalanced, two-sided lossless four-dimensional cubical complexes give rise to asymptotically good quantum locally testable codes. We expect the local-to-global principle developed here to have further applications.

quant-pharXiv:2610.00525•Oct 2, 2026•1 citation

Good quantum LDPC codes with linear time decoder from lossless expanders

Ting-Chun Lin, Min-Hsiu Hsieh

Quantum low-density parity-check (qLDPC) codes are quantum stabilizer codes where each stabilizer acts on a constant number of qubits and each qubit is acted on by a constant number of stabilizers. We study qLDPC codes constructed from balanced products and lossless expanders. We found that assuming the existence of 2-sided lossless expander graphs with free group action, the resulting qLDPC codes have constant rate, linear distance, and linear time decoders.

arXiv:2203.03581•Mar 7, 2022•69 citations

Explicit Abelian Lifts and Quantum LDPC Codes

Fernando Granha Jeronimo, Tushant Mittal, Ryan O’Donnell +2 more

For an abelian group H acting on the set [𝓁], an (H,𝓁)-lift of a graph G₀ is a graph obtained by replacing each vertex by 𝓁 copies, and each edge by a matching corresponding to the action of an element of H. Expanding graphs obtained via abelian lifts, form a key ingredient in the recent breakthrough constructions of quantum LDPC codes, (implicitly) in the fiber bundle codes by Hastings, Haah and O'Donnell [STOC 2021] achieving distance Ω̃(N^{3/5}), and in those by Panteleev and Kalachev [IEEE Trans. Inf. Theory 2021] of distance Ω(N/log(N)). However, both these constructions are non-explicit. In particular, the latter relies on a randomized construction of expander graphs via abelian lifts by Agarwal et al. [SIAM J. Discrete Math 2019]. In this work, we show the following explicit constructions of expanders obtained via abelian lifts. For every (transitive) abelian group H ⩽ Sym(𝓁), constant degree d ≥ 3 and ε > 0, we construct explicit d-regular expander graphs G obtained from an (H,𝓁)-lift of a (suitable) base n-vertex expander G₀ with the following parameters: ii) λ(G) ≤ 2√{d-1} + ε, for any lift size 𝓁 ≤ 2^{n^{δ}} where δ = δ(d,ε), iii) λ(G) ≤ ε ⋅ d, for any lift size 𝓁 ≤ 2^{n^{δ₀}} for a fixed δ₀ > 0, when d ≥ d₀(ε), or iv) λ(G) ≤ Õ(√d), for lift size "exactly" 𝓁 = 2^{Θ(n)}. As corollaries, we obtain explicit quantum lifted product codes of Panteleev and Kalachev of almost linear distance (and also in a wide range of parameters) and explicit classical quasi-cyclic LDPC codes with wide range of circulant sizes. Items (i) and (ii) above are obtained by extending the techniques of Mohanty, O'Donnell and Paredes [STOC 2020] for 2-lifts to much larger abelian lift sizes (as a byproduct simplifying their construction). This is done by providing a new encoding of special walks arising in the trace power method, carefully "compressing" depth-first search traversals. Result (iii) is via a simpler proof of Agarwal et al. [SIAM J. Discrete Math 2019] at the expense of polylog factors in the expansion.

arXiv:2112.01647•Leibniz international proceedings in informatics•Dec 2, 2021•14 citations

Good Quantum LDPC Codes with Linear Time Decoders

Irit Dinur, Min-Hsiu Hsieh, Ting-Chun Lin +1 more

We construct a new explicit family of good quantum low-density parity-check codes which additionally have linear time decoders. Our codes are based on a three-term chain (2m× m)V →δ0 (2m)E →δ1 2F where V (X-checks) are the vertices, E (qubits) are the edges, and F (Z-checks) are the squares of a left-right Cayley complex, and where the maps are defined based on a pair of constant-size random codes CA,CB:2m→2Δ where Δ is the regularity of the underlying Cayley graphs.

arXiv:2206.07750•ACM Symposium on Theory of Computing (STOC)•May 16, 2023•169 citations

Designing Group-Valued Codes with Full Regular Low-Weight Bases

Jong Yeon Lee

Efficient fault-tolerant quantum computing architectures benefit from low-weight logical operators. However, reported canonical bases for high-rate, high-distance codes can be several times heavier than the code distance, and fundamental obstructions can prevent minimum-weight logical operators from forming a complete canonical basis. To address this issue, we develop design principles for group-valued quantum error-correcting codes with low-weight full regular canonical logical bases, generated by translating a set of seed operators. We introduce frame width $f$, the smallest weight cutoff that permits a complete canonical logical basis, as an additional code parameter alongside distance $d$ and check weight $w$. Cataloguing these parameters together with explicit logical bases can inform resource estimates and the compilation of fault-tolerant logical operations. First, we identify a structural obstruction: for fully populated binary monomial CSS checks over a group of odd order, full regularity forces distance two, while for groups of power-of-two order, full row rank of both check matrices after replacing every group element by $1$ guarantees full regularity. Second, we demonstrate our principles through explicit high-rate lifted-product (LP) and pair-partition (PP) codes: an $[[1088,128,22]]$ LP code with $f=22$ and an $[[1024,256,24]]$ PP code with $f \leq 27$, both at $w=10$. At $w=11$, our PP constructions attain either $d=25$ with $f \leq 27$ or $d=24$ with the proved optimum $f=25$, demonstrating both a tradeoff among these parameters and a strict separation between distance and frame width. Finally, we propose a method combining symmetry reduction and stabilizer-based pruning for exhaustive distance certification, and use it to efficiently establish exact distances for LP examples with more than a thousand qubits.

quant-pharXiv:2610.06820•Oct 6, 2026•1 citation

Quantum Tanner Codes at Moderate Blocklength

Feroz Ahmed Mian, Vaishnavi L. Addala, Arman Meraj +2 more

We present explicit constructions of quantum Tanner (QT) codes with good rate and distance, obtained through two complementary approaches: the left-right Cayley complex (LRCC) description and the "lifting" perspective, in which a seed Calderbank-Shor-Steane (CSS) code is lifted by commuting left-right regular actions of a finite group $\mathcal{G}$. Through an extensive search over non-abelian groups from GAP's SmallGrp library, we investigate the moderate-blocklength regime ($n \in [500,1000]$) and identify several new code instances with distance upper bounds exceeding $20$. These include $[[480,8,(\leq 21,\leq 21)]]$, $[[504,4,(\leq 36,\leq 27)]]$, $[[672,4,(\leq 48,\leq 28)]]$, $[[720,6,(\leq 30,\leq 30)]]$, and $[[864,8,(\leq 39,\leq 31)]]$, with these bounds obtained using up to $350$ million trials of sQetch, a randomized distance estimator. The code instances presented have check weights ranging from $9$ to $20$. Using the Tesseract decoder, we estimate pseudo-thresholds of $3.6\%$-$4.6\%$ under phenomenological noise and $0.14\%$-$0.27\%$ under circuit-level noise, comparable to prior results at shorter code lengths. We also provide QuantumExpanders$.$jl, an open-source Julia library for constructing QT codes and explicit constructions of Ramanujan graphs.

quant-pharXiv:2608.12509•Aug 14, 2026•0 citations
We construct explicit two-sided lossless expanders whose binary adjacency matrices have full rank, and use them to obtain explicit asymptotically good quantum LDPC codes whose specified X- and Z-check matrices have full row rank and satisfy small-set soundness, or confinement, on a linear range.
Our lossless expanders are a variant of those of Hsieh, Lubotzky, Mohanty, Reiner, and Zhang, with a free action of a finite 2-group. Under such an action, injectivity and surjectivity of the adjacency matrix are detected on a fixed-size matrix indexed by vertex orbits. Adding a sparse factor to the gadget at the middle vertices of a single type then enforces full rank, with a controlled loss in expansion. To obtain the 2-group action, we observe that reducing the generators of the Lubotzky-Phillips-Sarnak Ramanujan graphs modulo powers of 2, instead of modulo an odd prime, gives Ramanujan Cayley graphs on finite 2-groups. This construction may be of independent interest.
Plugging two such expanders into the balanced product of Lin and Hsieh gives the quantum codes, since full rank of the input graphs is inherited by the check matrices.
Our construction supplies the code family sought by Hong, Guo, and Lucas. Applying their analysis, within their framework and under their dynamical assumptions, gives quantum memories whose free-energy density is analytic at every positive temperature and whose guaranteed lifetime is exp(Ω(N))exp(Ω(N))exp(Ω(N)) at sufficiently low fixed positive temperature, where N is the blocklength. This improves the previously guaranteed stretched-exponential timescale.
The paper addresses whether asymptotically good quantum LDPC codes can simultaneously have independent specified sparse checks and small-set confinement on a linear range. These properties support long-lived quantum memories with analytic positive-temperature free-energy density; previously studied examples had only O(N)O(\sqrt N)O(N​) distance and confinement range.
It constructs explicit binary CSS code families with full-row-rank HX,HZH_X,H_ZHX​,HZ​, bounded row and column weights, and distance greater than αN\alpha NαN. For any integers t1,t2≥2t_1,t_2\ge2t1​,t2​≥2, the rate is exactly K/N=(t1−1)(t2−1)/(t1t2+1)K/N=(t_1-1)(t_2-1)/(t_1t_2+1)K/N=(t1​−1)(t2​−1)/(t1​t2​+1), approaching one as both parameters grow. For any prescribed constant γ0>0\gamma_0>0γ0​>0, syndrome weight is at least γ0\gamma_0γ0​ times error weight reduced modulo stabilizers whenever that reduced weight is at most αN\alpha NαN. Sparsity bounds and α>0\alpha>0α>0 depend on the chosen parameters.
The construction first produces explicit two-sided lossless expanders with full-rank binary adjacency matrices and free finite 222-group actions. Equivariant injectivity and surjectivity reduce to a fixed-size matrix indexed by vertex orbits. A sparse gadget modification enforces rank while controlling expansion loss. The required symmetry comes from reducing LPS quaternion generators modulo powers of two, yielding Ramanujan Cayley graphs on 222-groups. The Lin–Hsieh balanced product transfers expansion and rank to the quantum checks.
Applying the Hong–Guo–Lucas analysis, within its framework and dynamical assumptions, gives guaranteed lifetime exp⁡(Ω(N))\exp(\Omega(N))exp(Ω(N)) at sufficiently low fixed positive temperature while retaining thermodynamic analyticity. The result asserts small-set, not full-range, quantum local testability. Local check enumeration is polylogarithmic in NNN after parameter-dependent finite precomputation.
Sipser and Spielman constructed LDPC codes from either bipartite \emph{spectral} expanders or one-sided \emph{lossless} expanders. In higher dimensions, \emph{spectral} expansion similarly played a central role in the constructions of asymptotically good classical LTCs and qLDPC codes by Dinur, Evra, Livne, Lubotzky, and Mozes and by Panteleev and Kalachev. Alternatively, Lin and Hsieh constructed classical LTCs and qLDPC codes from two-dimensional \emph{lossless} cubical complexes. In this work we develop the higher-dimensional \emph{lossless} approach. We do not construct the required high-dimensional lossless cubical complexes; rather, we investigate what their existence would imply. We associate with a high-dimensional cubical complex a \emph{level chain complex}, whose chain groups are supported on the level sets of the Boolean cube rather than on its cells. Our main technical contribution is a clean local-to-global theorem for this structure: suitable one-dimensional lossless expansion in the directional graphs implies small-set coboundary expansion of the global level complex. As a consequence, sufficiently imbalanced, two-sided lossless four-dimensional cubical complexes give rise to asymptotically good quantum locally testable codes. We expect the local-to-global principle developed here to have further applications.
For an abelian group H acting on the set [𝓁], an (H,𝓁)-lift of a graph G₀ is a graph obtained by replacing each vertex by 𝓁 copies, and each edge by a matching corresponding to the action of an element of H. Expanding graphs obtained via abelian lifts, form a key ingredient in the recent breakthrough constructions of quantum LDPC codes, (implicitly) in the fiber bundle codes by Hastings, Haah and O'Donnell [STOC 2021] achieving distance Ω̃(N^{3/5}), and in those by Panteleev and Kalachev [IEEE Trans. Inf. Theory 2021] of distance Ω(N/log(N)). However, both these constructions are non-explicit. In particular, the latter relies on a randomized construction of expander graphs via abelian lifts by Agarwal et al. [SIAM J. Discrete Math 2019]. In this work, we show the following explicit constructions of expanders obtained via abelian lifts. For every (transitive) abelian group H ⩽ Sym(𝓁), constant degree d ≥ 3 and ε > 0, we construct explicit d-regular expander graphs G obtained from an (H,𝓁)-lift of a (suitable) base n-vertex expander G₀ with the following parameters: ii) λ(G) ≤ 2√{d-1} + ε, for any lift size 𝓁 ≤ 2^{n^{δ}} where δ = δ(d,ε), iii) λ(G) ≤ ε ⋅ d, for any lift size 𝓁 ≤ 2^{n^{δ₀}} for a fixed δ₀ > 0, when d ≥ d₀(ε), or iv) λ(G) ≤ Õ(√d), for lift size "exactly" 𝓁 = 2^{Θ(n)}. As corollaries, we obtain explicit quantum lifted product codes of Panteleev and Kalachev of almost linear distance (and also in a wide range of parameters) and explicit classical quasi-cyclic LDPC codes with wide range of circulant sizes. Items (i) and (ii) above are obtained by extending the techniques of Mohanty, O'Donnell and Paredes [STOC 2020] for 2-lifts to much larger abelian lift sizes (as a byproduct simplifying their construction). This is done by providing a new encoding of special walks arising in the trace power method, carefully "compressing" depth-first search traversals. Result (iii) is via a simpler proof of Agarwal et al. [SIAM J. Discrete Math 2019] at the expense of polylog factors in the expansion.
Efficient fault-tolerant quantum computing architectures benefit from low-weight logical operators. However, reported canonical bases for high-rate, high-distance codes can be several times heavier than the code distance, and fundamental obstructions can prevent minimum-weight logical operators from forming a complete canonical basis. To address this issue, we develop design principles for group-valued quantum error-correcting codes with low-weight full regular canonical logical bases, generated by translating a set of seed operators. We introduce frame width fff, the smallest weight cutoff that permits a complete canonical logical basis, as an additional code parameter alongside distance ddd and check weight www. Cataloguing these parameters together with explicit logical bases can inform resource estimates and the compilation of fault-tolerant logical operations. First, we identify a structural obstruction: for fully populated binary monomial CSS checks over a group of odd order, full regularity forces distance two, while for groups of power-of-two order, full row rank of both check matrices after replacing every group element by 111 guarantees full regularity. Second, we demonstrate our principles through explicit high-rate lifted-product (LP) and pair-partition (PP) codes: an [[1088,128,22]][[1088,128,22]][[1088,128,22]] LP code with f=22f=22f=22 and an [[1024,256,24]][[1024,256,24]][[1024,256,24]] PP code with f≤27f \leq 27f≤27, both at w=10w=10w=10. At w=11w=11w=11, our PP constructions attain either d=25d=25d=25 with f≤27f \leq 27f≤27 or d=24d=24d=24 with the proved optimum f=25f=25f=25, demonstrating both a tradeoff among these parameters and a strict separation between distance and frame width. Finally, we propose a method combining symmetry reduction and stabilizer-based pruning for exhaustive distance certification, and use it to efficiently establish exact distances for LP examples with more than a thousand qubits.
We present explicit constructions of quantum Tanner (QT) codes with good rate and distance, obtained through two complementary approaches: the left-right Cayley complex (LRCC) description and the "lifting" perspective, in which a seed Calderbank-Shor-Steane (CSS) code is lifted by commuting left-right regular actions of a finite group G\mathcal{G}G. Through an extensive search over non-abelian groups from GAP's SmallGrp library, we investigate the moderate-blocklength regime (n∈[500,1000]n \in [500,1000]n∈[500,1000]) and identify several new code instances with distance upper bounds exceeding 202020. These include [[480,8,(≤21,≤21)]][[480,8,(\leq 21,\leq 21)]][[480,8,(≤21,≤21)]], [[504,4,(≤36,≤27)]][[504,4,(\leq 36,\leq 27)]][[504,4,(≤36,≤27)]], [[672,4,(≤48,≤28)]][[672,4,(\leq 48,\leq 28)]][[672,4,(≤48,≤28)]], [[720,6,(≤30,≤30)]][[720,6,(\leq 30,\leq 30)]][[720,6,(≤30,≤30)]], and [[864,8,(≤39,≤31)]][[864,8,(\leq 39,\leq 31)]][[864,8,(≤39,≤31)]], with these bounds obtained using up to 350350350 million trials of sQetch, a randomized distance estimator. The code instances presented have check weights ranging from 999 to 202020. Using the Tesseract decoder, we estimate pseudo-thresholds of 3.6%3.6\%3.6%-4.6%4.6\%4.6% under phenomenological noise and 0.14%0.14\%0.14%-0.27%0.27\%0.27% under circuit-level noise, comparable to prior results at shorter code lengths. We also provide QuantumExpanders...jl, an open-source Julia library for constructing QT codes and explicit constructions of Ramanujan graphs.