Theory of low-weight quantum codes

• URL: http://arxiv.org/abs/2601.19848v1
• Date: Tue, 27 Jan 2026 17:54:18 GMT
• Title: Theory of low-weight quantum codes
• Authors: Fuchuan Wei, Zhengyi Han, Austin Yubo He, Zimu Li, Zi-Wen Liu,
• Abstract summary: 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.
• Score: 1.9757087157232078
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Low check weight is practically crucial code property for fault-tolerant quantum computing, which underlies the strong interest in quantum low-density parity-check (qLDPC) codes. Here, we explore the theory of weight-constrained stabilizer codes from various foundational perspectives including the complexity of computing code weight and the explicit boundary of feasible low-weight codes in both theoretical and practical settings. We first prove that calculating the optimal code weight is an $\mathsf{NP}$-hard problem, demonstrating the necessity of establishing bounds for weight that are analytical or efficiently computable. Then we systematically investigate the feasible code parameters with weight constraints. We provide various explicit analytical lower bounds and in particular completely characterize stabilizer codes with weight at most 3, showing that they have distance 2 and code rate at most 1/4. We also develop a powerful linear programming (LP) scheme for setting code parameter bounds with weight constraints, which yields exact optimal weight values for all code parameters with $n\leq 9$. We further refined this constraint from multiple perspectives by considering the generator weight distribution and overlap. In particular, we consider practical architectures and demonstrate how to apply our methods to e.g.~the IBM 127-qubit chip. Our study brings the weight as a crucial parameter into coding theory and provide guidance for code design and utility in practical scenarios.

Related papers

• Check-weight-constrained quantum codes: Bounds and examples [41.528148407718604]
  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.
  arXiv  Detail & Related papers  (2026-01-21T20:24:51Z)
• Simplified Quantum Weight Reduction with Optimal Bounds [9.984974174262328]
  Low-weight codes are essential for implementing quantum error correction on physical hardware.<n>Weight reduction also serves as a critical theoretical tool, which may be relevant to the quantum PCP conjecture.<n>We introduce a new procedure for quantum weight reduction that combines geometric insights with coning techniques.
  arXiv  Detail & Related papers  (2025-10-10T17:58:31Z)
• Is Compression Really Linear with Code Intelligence? [60.123628177110206]
  textitFormat Annealing is a lightweight, transparent training methodology designed to assess the intrinsic capabilities of pre-trained models equitably.<n>Our empirical results reveal a fundamental logarithmic relationship between measured code intelligence and bits-per-character (BPC)<n>Our work provides a more nuanced understanding of compression's role in developing code intelligence and contributes a robust evaluation framework in the code domain.
  arXiv  Detail & Related papers  (2025-05-16T16:59:14Z)
• An Efficient Quantum Classifier Based on Hamiltonian Representations [50.467930253994155]
  Quantum machine learning (QML) is a discipline that seeks to transfer the advantages of quantum computing to data-driven tasks.<n>We propose an efficient approach that circumvents the costs associated with data encoding by mapping inputs to a finite set of Pauli strings.<n>We evaluate our approach on text and image classification tasks, against well-established classical and quantum models.
  arXiv  Detail & Related papers  (2025-04-13T11:49:53Z)
• Discovering highly efficient low-weight quantum error-correcting codes with reinforcement learning [0.5524804393257919]
  We introduce a versatile and computationally efficient approach to stabilizer code weight reduction based on reinforcement learning (RL)<n>Our approach demonstrates savings in physical qubit overhead compared to existing results by 1 to 2 orders of magnitude for weight 6 codes.
  arXiv  Detail & Related papers  (2025-02-20T09:05:34Z)
• 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)
• End-to-end resource analysis for quantum interior point methods and portfolio optimization [63.4863637315163]
  We provide a complete quantum circuit-level description of the algorithm from problem input to problem output. We report the number of logical qubits and the quantity/depth of non-Clifford T-gates needed to run the algorithm.
  arXiv  Detail & Related papers  (2022-11-22T18:54:48Z)
• Conservation laws and quantum error correction: towards a generalised matching decoder [2.1756081703276]
  We explore decoding algorithms for the surface code, a prototypical quantum low-density parity-check code. The decoder works by exploiting underlying structure that arises due to materialised symmetries among surface-code stabilizer elements. We propose a systematic way of constructing a minimum-weight perfect-matching decoder for codes with certain characteristic properties.
  arXiv  Detail & Related papers  (2022-07-13T18:00:00Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)

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.