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

Local-dimension-invariant low-density parity-check stabilizer codes

Md. Shahinul Islam, Aaryan Reza, Lane G. Gunderman

quant-phSubmitted Oct 11, 2026• Announced Oct 13, 2026• 0 citations
arXivHTMLPDF

Abstract

The protection of quantum information in systems leveraging more than two basis states (qudits) is an ongoing challenge. A tool for transforming the plethora of qubit stabilizer codes into qudit stabilizer codes is the local-dimension-invariant (LDI) extension to the stabilizer formalism. A drawback of the LDI method is that generally in order to ensure the distance of the resultant code is at least preserved the newly selected local-dimension will need to be any prime bigger than a large cutoff value. In this work we consider the repercussions of this large cutoff value, then by focusing on quantum low-density parity-check (qLDPC) codes we are able to bring down this cutoff value. Notably, we are able to reduce it in some cases to the initial local-dimension and for arbitrary CSS qubit-derived codes to singly exponential in $d$ with no dependence on the number of logicals $k$. This reduces the size of the caveat in LDI forms in their distance preservation condition.

AI Summary

Local-dimension-invariant (LDI) stabilizer representations use integer check matrices whose symplectic products vanish exactly, allowing their reduction to commuting checks in any local dimension. The question addressed is how large a new prime dimension must be to guarantee preservation of the source code’s distance, particularly for sparse CSS codes. The paper develops sign-assignment constructions and bounds on check entries, weights and degrees, then relates distance preservation to bounds on determinants of check-matrix minors. For an LDI CSS code of distance $d$, maximum absolute entry $B$, and $\mathcal W$ equal to the smaller of maximum check weight and maximum register degree, the stated sufficient cutoffs include $p^*=B^{d-1}2^{(d-1)(\mathcal W-1)/3}$ for constant sparsity and $p^*\leq(B\mathcal W)^{d-1}$ when $\mathcal W<d$. These use sparse determinant inequalities and row/column-sum bounds. A CSS lifting construction gives $B\leq\lfloor q/2\rfloor^2\min(w_X,w_Z)$. Combined with qubit weight reduction, the paper states a cutoff no larger than $15^{d-1}$, independent of the logical count. Additional constructions concern hypergraph products, sign-only lifts with $B=1$, and Euclidean and hyperbolic surface codes. A Gaussian nearest-boundary model connects increasing GKP dimension to an additional squeezing requirement of $10\log_{10}(p/p_0)$ dB at fixed crossing probability. The guarantees generally remain exponential in distance and sufficient rather than necessary. Sign-assignment conditions are restrictive; the broader cycle condition requires enumeration. The paper also notes Gaussian-elimination fill-in, the lack of a general LDI weight-reduction procedure, and the need for separate distance verification below the cutoff.

Little sign of AI-generated textPossible errorOverclaimsIncrementalUnclear writing

Central claim may not hold: The sparsity lemmas assume bounded fill-in under systematicization, although sparse Gaussian elimination can produce column degrees growing with the code length, leaving the arbitrary-CSS cutoff argument unsupported. The first two cutoff formulas apply binary determinant bounds to signed integer LDI matrices, for which those bounds are false even when the maximum entry magnitude is one. The classical systematic lifting prescription can reduce distance from 5 over F_2 to at most 4 over F_3, invalidating the supplied argument for distance preservation in the hypergraph-product construction. The main distance-preservation proof does not control the stabilizer-intersection dimensions, and an integer-commuting CSS lift can turn a source-field low-weight stabilizer into a logical operator over every larger prime.

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

Comments
14 pages, 1 figure

Related papers

Degenerate local-dimension-invariant stabilizer codes and an alternative bound for the distance preservation condition

Lane G. Gunderman

One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and, in particular, that degenerate stabilizer codes can have their distance also promised upon sufficiently large local dimension as well as an alternative bound on the local dimension required to preserve the distance of local-dimension-invariant codes, which is a result which could prove to be useful for error-corrected qudit quantum computers.

arXiv:2110.15274•Physical Review A•Apr 14, 2022•5 citations

Check-weight-constrained quantum codes: Bounds and examples

Lily Wang, Andy Zeyi Liu, Ray Li +2 more

Quantum low-density parity-check (qLDPC) codes can be implemented by measuring only low-weight checks, making them compatible with noisy quantum hardware and central to the quest to build noise-resilient quantum computers. A fundamental open question is how constraints on check weight limit the achievable parameters of qLDPC codes. Here, we study stabilizer and subsystem codes with constrained check weight, combining analytical arguments with numerical optimization to establish strong upper bounds on their parameters. We show that stabilizer codes with checks of weight at most three cannot have nontrivial distance. We also prove tight tradeoffs between rate and distance for broad families of CSS stabilizer and subsystem codes with checks of weight at most four and two, respectively. Notably, our bounds are applicable to general qLDPC codes, as they rely only on check-weight constraints without assuming geometric locality or special graph connectivity. In the finite-size regime, we derive numerical upper bounds using linear programming techniques and identify explicit code constructions that approach these limits, delineating the landscape of practically relevant qLDPC codes with tens or hundreds of physical qubits.

quant-pharXiv:2601.15446•Jan 23, 2026•14 citations

Mixed-register Stabilizer Codes: A Coding-theoretic Perspective

Himanshu Dongre, Lane G. Gunderman

Protecting information in systems that have more than two basis states (qudits) not only offers a promising route for reducing the number of individual quantum locations that must be protected, while more accurately reflecting the structure of realistic quantum hardware, but also has some possibly enticing foundational strengths. While work in the past has largely focused on protecting information in quantum devices with locations that are some consistent local structure, this work considers coding-theoretic constraints on devices constructed from locations which may vary in their local structures -- these are mixed-register quantum devices. In this work we provide some general results for mixed-register Pauli operators, then identify some stabilizer encoded information forms that are forbidden. Building on these insights, we construct coding-theoretically optimal mixed-register stabilizer codes from sets of codes defined on coprime local-dimensions. The construction of such codes results in codes with logical subspaces that do not directly correspond to any of the constituent local-dimensions.

quant-pharXiv:2603.28459•Mar 31, 2026•0 citations

Local-dimension-invariant qudit stabilizer codes

Lane G. Gunderman

Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. These systems will require codes which utilize the full computational space. Many prior qudit codes are very restrictive on relations between the parameters of number of qudits, number of logical qudits, distance of the code, and number of bases. In this paper we show that codes for these systems can be derived from already known codes, often relaxing the constraints somewhat, a result which could prove to be very useful for fault-tolerant qudit quantum computers.

arXiv:1910.08122•Physical Review A•May 28, 2020•14 citations

Stability of Quantum LDPC States under Local Pauli Noise

Tai-Hsuan Yang, Andrew D. Kim, Akash Vijay +1 more

Quantum low-density parity-check (qLDPC) codes have a canonical mixed state---the normalized projector onto the code space---that lies at the intersection of quantum error correction and quantum many-body physics, yet the stability of its information-theoretic structure under local noise remains poorly understood. Recent progress on mixed-state phases of matter has identified the spatial decay of conditional mutual information (CMI) $I(A:C|B)$ as a key diagnostic of such stability, analogous to the role of the spectral gap for quantum ground states. We prove that, for the normalized code-projector state of a $\mathbb{Z}_d$ qLDPC stabilizer code under local Pauli noise, the CMI across a buffer $B$ separating $A$ from $C$ decays exponentially with the width of $B$ in two complementary noise regimes independent of system size. At weak noise, this holds for full-system tripartitions, where correlations between the two sides require an error cluster to cross the buffer, an exponentially unlikely event. At strong noise, exponential decay holds whenever the buffer supports no logical operator, since correlations can persist only along rare chains of buffer qudits that remain informative. Under an additional space-uniformity assumption, we establish the robustness of Levin--Wen topological entropy. On finite-dimensional lattices of size $n$, the weak-noise bound further implies a constant-layer quasi-local Petz recovery channel of range $O(\poly(\log n)/\varepsilon)$ that recovers the noiseless state within trace-distance error $\varepsilon$. Both CMI bounds apply to general qLDPC interaction graphs, including geometries where such constant-depth quasi-local recovery need not exist. Thus, the exponential decay of the noise-induced CMI provides a general criterion for mixed-state phase stability.

quant-pharXiv:2610.22357•Oct 16, 2026•1 citation

Quasi-cyclic low-density parity-check stabilizer codes

Feng Shi, Zhiyuan Yan

Quantum error correction codes are needed to protect quantum systems from interference. An important family of quantum error correction codes are stabilizer codes. Many stabilizer codes in the literature belong to a subclass of stabilizer codes, referred to as CSS codes since they are based on the so-called CSS formalism. CSS codes have received significant attention because the dual-containing condition for the CSS formalism is relatively straightforward to satisfy and also because it is easy to produce CSS codes from classical error correction codes. However, some stabilizer codes in the literature show superior error correction performance than existing CSS codes, and are based on binary low-density parity-check (LDPC) codes. Since it has been shown that CSS codes based on nonbinary LDPC codes have good performance over quantum qubit channels, in this paper we investigate stabilizer codes based on nonbinary LDPC codes. In particular, we propose constructions of stabilizer codes based on nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes for qubit channels. The simulation results show that our QC-LDPC stabilizer codes decoded by a nonbinary sum-product algorithm have better performance than their binary counterparts.

IEEE Military Communications Conference (MILCOM)•Oct 1, 2012•0 citations
The protection of quantum information in systems leveraging more than two basis states (qudits) is an ongoing challenge. A tool for transforming the plethora of qubit stabilizer codes into qudit stabilizer codes is the local-dimension-invariant (LDI) extension to the stabilizer formalism. A drawback of the LDI method is that generally in order to ensure the distance of the resultant code is at least preserved the newly selected local-dimension will need to be any prime bigger than a large cutoff value. In this work we consider the repercussions of this large cutoff value, then by focusing on quantum low-density parity-check (qLDPC) codes we are able to bring down this cutoff value. Notably, we are able to reduce it in some cases to the initial local-dimension and for arbitrary CSS qubit-derived codes to singly exponential in ddd with no dependence on the number of logicals kkk. This reduces the size of the caveat in LDI forms in their distance preservation condition.
Local-dimension-invariant (LDI) stabilizer representations use integer check matrices whose symplectic products vanish exactly, allowing their reduction to commuting checks in any local dimension. The question addressed is how large a new prime dimension must be to guarantee preservation of the source code’s distance, particularly for sparse CSS codes.
The paper develops sign-assignment constructions and bounds on check entries, weights and degrees, then relates distance preservation to bounds on determinants of check-matrix minors. For an LDI CSS code of distance ddd, maximum absolute entry BBB, and W\mathcal WW equal to the smaller of maximum check weight and maximum register degree, the stated sufficient cutoffs include p∗=Bd−12(d−1)(W−1)/3p^*=B^{d-1}2^{(d-1)(\mathcal W-1)/3}p∗=Bd−12(d−1)(W−1)/3 for constant sparsity and p∗≤(BW)d−1p^*\leq(B\mathcal W)^{d-1}p∗≤(BW)d−1 when W<d\mathcal W<dW<d. These use sparse determinant inequalities and row/column-sum bounds. A CSS lifting construction gives B≤⌊q/2⌋2min⁡(wX,wZ)B\leq\lfloor q/2\rfloor^2\min(w_X,w_Z)B≤⌊q/2⌋2min(wX​,wZ​). Combined with qubit weight reduction, the paper states a cutoff no larger than 15d−115^{d-1}15d−1, independent of the logical count.
Additional constructions concern hypergraph products, sign-only lifts with B=1B=1B=1, and Euclidean and hyperbolic surface codes. A Gaussian nearest-boundary model connects increasing GKP dimension to an additional squeezing requirement of 10log⁡10(p/p0)10\log_{10}(p/p_0)10log10​(p/p0​) dB at fixed crossing probability.
The guarantees generally remain exponential in distance and sufficient rather than necessary. Sign-assignment conditions are restrictive; the broader cycle condition requires enumeration. The paper also notes Gaussian-elimination fill-in, the lack of a general LDI weight-reduction procedure, and the need for separate distance verification below the cutoff.
One hurdle to performing reliable quantum computations is overcoming noise. One possibility is to reduce the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. In this paper we show that codes for these systems can be derived from already known codes, and, in particular, that degenerate stabilizer codes can have their distance also promised upon sufficiently large local dimension as well as an alternative bound on the local dimension required to preserve the distance of local-dimension-invariant codes, which is a result which could prove to be useful for error-corrected qudit quantum computers.
Quantum low-density parity-check (qLDPC) codes can be implemented by measuring only low-weight checks, making them compatible with noisy quantum hardware and central to the quest to build noise-resilient quantum computers. A fundamental open question is how constraints on check weight limit the achievable parameters of qLDPC codes. Here, we study stabilizer and subsystem codes with constrained check weight, combining analytical arguments with numerical optimization to establish strong upper bounds on their parameters. We show that stabilizer codes with checks of weight at most three cannot have nontrivial distance. We also prove tight tradeoffs between rate and distance for broad families of CSS stabilizer and subsystem codes with checks of weight at most four and two, respectively. Notably, our bounds are applicable to general qLDPC codes, as they rely only on check-weight constraints without assuming geometric locality or special graph connectivity. In the finite-size regime, we derive numerical upper bounds using linear programming techniques and identify explicit code constructions that approach these limits, delineating the landscape of practically relevant qLDPC codes with tens or hundreds of physical qubits.
Protecting information in systems that have more than two basis states (qudits) not only offers a promising route for reducing the number of individual quantum locations that must be protected, while more accurately reflecting the structure of realistic quantum hardware, but also has some possibly enticing foundational strengths. While work in the past has largely focused on protecting information in quantum devices with locations that are some consistent local structure, this work considers coding-theoretic constraints on devices constructed from locations which may vary in their local structures -- these are mixed-register quantum devices. In this work we provide some general results for mixed-register Pauli operators, then identify some stabilizer encoded information forms that are forbidden. Building on these insights, we construct coding-theoretically optimal mixed-register stabilizer codes from sets of codes defined on coprime local-dimensions. The construction of such codes results in codes with logical subspaces that do not directly correspond to any of the constituent local-dimensions.
Protection of quantum information from noise is a massive challenge. One avenue people have begun to explore is reducing the number of particles needing to be protected from noise and instead use systems with more states, so-called qudit quantum computers. These systems will require codes which utilize the full computational space. Many prior qudit codes are very restrictive on relations between the parameters of number of qudits, number of logical qudits, distance of the code, and number of bases. In this paper we show that codes for these systems can be derived from already known codes, often relaxing the constraints somewhat, a result which could prove to be very useful for fault-tolerant qudit quantum computers.
Quantum low-density parity-check (qLDPC) codes have a canonical mixed state---the normalized projector onto the code space---that lies at the intersection of quantum error correction and quantum many-body physics, yet the stability of its information-theoretic structure under local noise remains poorly understood. Recent progress on mixed-state phases of matter has identified the spatial decay of conditional mutual information (CMI) I(A:C∣B)I(A:C|B)I(A:C∣B) as a key diagnostic of such stability, analogous to the role of the spectral gap for quantum ground states. We prove that, for the normalized code-projector state of a Zd\mathbb{Z}_dZd​ qLDPC stabilizer code under local Pauli noise, the CMI across a buffer BBB separating AAA from CCC decays exponentially with the width of BBB in two complementary noise regimes independent of system size. At weak noise, this holds for full-system tripartitions, where correlations between the two sides require an error cluster to cross the buffer, an exponentially unlikely event. At strong noise, exponential decay holds whenever the buffer supports no logical operator, since correlations can persist only along rare chains of buffer qudits that remain informative. Under an additional space-uniformity assumption, we establish the robustness of Levin--Wen topological entropy. On finite-dimensional lattices of size nnn, the weak-noise bound further implies a constant-layer quasi-local Petz recovery channel of range $O(\poly(\log n)/\varepsilon)$ that recovers the noiseless state within trace-distance error ε\varepsilonε. Both CMI bounds apply to general qLDPC interaction graphs, including geometries where such constant-depth quasi-local recovery need not exist. Thus, the exponential decay of the noise-induced CMI provides a general criterion for mixed-state phase stability.
Quantum error correction codes are needed to protect quantum systems from interference. An important family of quantum error correction codes are stabilizer codes. Many stabilizer codes in the literature belong to a subclass of stabilizer codes, referred to as CSS codes since they are based on the so-called CSS formalism. CSS codes have received significant attention because the dual-containing condition for the CSS formalism is relatively straightforward to satisfy and also because it is easy to produce CSS codes from classical error correction codes. However, some stabilizer codes in the literature show superior error correction performance than existing CSS codes, and are based on binary low-density parity-check (LDPC) codes. Since it has been shown that CSS codes based on nonbinary LDPC codes have good performance over quantum qubit channels, in this paper we investigate stabilizer codes based on nonbinary LDPC codes. In particular, we propose constructions of stabilizer codes based on nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes for qubit channels. The simulation results show that our QC-LDPC stabilizer codes decoded by a nonbinary sum-product algorithm have better performance than their binary counterparts.