Check-weight-constrained quantum codes: Bounds and examples

• URL: http://arxiv.org/abs/2601.15446v1
• Date: Wed, 21 Jan 2026 20:24:51 GMT
• Title: Check-weight-constrained quantum codes: Bounds and examples
• Authors: Lily Wang, Andy Zeyi Liu, Ray Li, Aleksander Kubica, Shouzhen Gu,
• Abstract summary: Quantum low-density parity-check (qLDPC) codes can be implemented by measuring only low-weight checks.<n>Here, we study stabilizer and subsystem codes with constrained check weight.<n>We show that stabilizer codes with checks of weight at most three cannot have nontrivial distance.
• Score: 41.528148407718604
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Theory of low-weight quantum codes [1.9757087157232078]
  Low check weight is practically crucial code property for fault-tolerant quantum computing.<n>Here, we explore the theory of weight-constrained stabilizer codes in both theoretical and practical settings.<n>Our study brings the weight as a crucial parameter into coding theory and provide guidance for code design and utility in practical scenarios.
  arXiv  Detail & Related papers  (2026-01-27T17:54:18Z)
• Directional Codes: a new family of quantum LDPC codes on hexagonal- and square-grid connectivity hardware [0.0]
  Utility-scale quantum computing requires quantum error correction (QEC) to protect quantum information against noise.<n>Currently, superconducting hardware is a promising candidate for achieving fault tolerance due to its fast gate times and feasible scalability.<n>We construct a new family of qLDPC codes, which outperforms the rotated planar code (RPC)<n>We numerically evaluate the performance of directional codes, encoding four, six and twelve logical qubits.
  arXiv  Detail & Related papers  (2025-07-25T16:57:21Z)
• List Decodable Quantum LDPC Codes [49.2205789216734]
  We give a construction of Quantum Low-Density Parity Check (QLDPC) codes with near-optimal rate-distance tradeoff. We get efficiently list decodable QLDPC codes with unique decoders.
  arXiv  Detail & Related papers  (2024-11-06T23:08:55Z)
• Quantum subspace verification for error correction codes [13.856955493134908]
  We introduce a framework of quantum subspace verification, employing the knowledge of quantum error correction code subspaces to reduce the potential measurement budgets. For certain codes like the notable Calderbank-Shor-Steane codes and QLDPC stabilizer codes, the setting number and sample complexity can be significantly reduced. By combining the proposed subspace verification and direct fidelity estimation, we construct a protocol to verify the fidelity of general magic logical states.
  arXiv  Detail & Related papers  (2024-10-16T13:28:33Z)
• Multivariate Bicycle Codes [0.0]
  Quantum Low-Density Parity-Check (QLDPC) codes are an extension of the framework developed by Bravyi et al.<n>We show that TB-QLDPC codes up to weight-6 have a bi-planar structure and often posses a two-dimensional toric layout.<n>The high encoding rate and compact layout make our codes highly suitable candidates for near-term hardware implementations.
  arXiv  Detail & Related papers  (2024-06-27T13:10:37Z)
• Weight Reduced Stabilizer Codes with Lower Overhead [0.0]
  A stabilizer code is defined by a set of parity-check operators, which are measured in order to infer information about errors that may have occurred. Hastings proposed a method for reducing the parity checks of a stabilizer code, though it has previously only been studied in the regime. Here, we focus on the regime of small-to-medium size codes suitable for quantum computing hardware.
  arXiv  Detail & Related papers  (2024-02-07T20:08:38Z)
• Quaternary Neural Belief Propagation Decoding of Quantum LDPC Codes with Overcomplete Check Matrices [45.997444794696676]
  Quantum low-density parity-check (QLDPC) codes are promising candidates for error correction in quantum computers.<n>One of the major challenges in implementing QLDPC codes in quantum computers is the lack of a universal decoder.<n>We first propose to decode QLDPC codes with a belief propagation (BP) decoder operating on overcomplete check matrices.<n>We extend the neural BP (NBP) decoder, which was originally studied for suboptimal binary BP decoding of QLPDC codes, to quaternary BP decoders.
  arXiv  Detail & Related papers  (2023-08-16T08:24:06Z)
• Improved rate-distance trade-offs for quantum codes with restricted connectivity [34.95121779484252]
  We study how the connectivity graph associated with a quantum code constrains the code parameters. We establish a tighter dimension-distance trade-off as a function of the size of separators in the connectivity graph.
  arXiv  Detail & Related papers  (2023-07-06T20:38:34Z)
• Single-shot decoding of good quantum LDPC codes [38.12919328528587]
  We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise. We show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round.
  arXiv  Detail & Related papers  (2023-06-21T18:00:01Z)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Single-shot quantum error correction with the three-dimensional subsystem toric code [77.34726150561087]
  We introduce a new topological quantum code, the three-dimensional subsystem toric code (3D STC) The 3D STC can be realized by measuring geometrically-local parity checks of weight at most three on the cubic lattice with open boundary conditions.
  arXiv  Detail & Related papers  (2021-06-04T17:35:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.