Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors

• URL: http://arxiv.org/abs/2508.09082v1
• Date: Tue, 12 Aug 2025 17:03:59 GMT
• Title: Generalized Bicycle Codes with Low Connectivity: Minimum Distance Bounds and Hook Errors
• Abstract summary: We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes.<n>We analyze two highly degenerate GB code families with parameters $[[d2+1,2,d]]$ for odd $d geq 3$ and $[d2,2,d]]$ for even $d geq 4$.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present new upper and lower bounds on the minimum distance of certain generalized bicycle (GB) codes beyond the reach of techniques for classical codes capable of even capturing the true minimum distance for some cases. These bounds are then applied to illustrate the existence and analyze two highly degenerate GB code families with parameters $[[d^2+1,2,d]]$ for odd $d \geq 3$ and $[[d^2,2,d]]$ for even $d \geq 4$, both having the property that each check qubit is connected to exactly four data qubits similar to surface codes. For the odd-distance family, we analyze the structure of low-weight logical Pauli operators and demonstrate the existence of a fault-tolerant logical CNOT gate between the two logical qubits, achievable through a simple relabeling of data qubits. We further construct a syndrome extraction pattern for both families that does not imply minimum distance reduction arising from extraction circuit faults that propagate from the check qubits to the data qubits. Finally, we numerically evaluate their logical error rates under a code capacity depolarizing noise model using the belief propagation ordered statistics decoding (BP-OSD) and minimum-weight perfect-matching (MWPM) decoders, yielding thresholds of approximately $14-16\%$ for the odd and even families, very similar to those of rotated surface codes.

Related papers

• Strictly Local Tile-Code Architectures on Two-Dimensional Planar Lattices [0.0]
  Tile codes are a family of planar quantum low-density parity-check (qLDPC) codes with weight-6 stabilizers and open boundary conditions.<n>We show that routed tile codes require fewer physical qubits per logical qubit than the surface code at sufficiently low physical error rates.
  arXiv  Detail & Related papers  (2026-07-07T06:50:27Z)
• A polynomial-time approximation scheme for minimum-weight decoding of topological codes [42.44256445495892]
  Two-dimensional topological translationally in (2D TTI) stabilizer codes lie at the heart of fault-tolerant quantum computation.<n>Minimum-weight decoding of these codes was recently shown to be NP-hard, even in basic settings.
  arXiv  Detail & Related papers  (2026-06-16T16:44:08Z)
• Stairway Codes: Floquetifying Bivariate Bicycle Codes and Beyond [41.99844472131922]
  Floquet codes define fault-tolerant protocols through periodic measurement sequences.<n>We introduce Stairway codes, a family of high-rate Floquet protocols.<n>We demonstrate logical error rates surpassing those of other Floquet codes at comparable encoding rates.
  arXiv  Detail & Related papers  (2026-02-27T19:00:00Z)
• 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)
• Hierarchical Quantum Error Correction with Hypergraph Product Code and Rotated Surface Code [0.9002260638342727]
  We propose and analyze a hierarchical quantum error correction (QEC) scheme that encodes hypergraph product (HGP) codes with rotated surface codes.<n>The upper layer employs (3,4)-random HGP codes, known for their constant error rate.<n>The lower layer consists of a rotated surface code with distance 5, allowing hardware compatibility through lattice surgery.
  arXiv  Detail & Related papers  (2025-05-24T08:39:39Z)
• In-situ mid-circuit qubit measurement and reset in a single-species trapped-ion quantum computing system [34.82692226532414]
  We implement in-situ mid-circuit measurement and reset (MCMR) operations on a trapped-ion quantum computing system.<n>We introduce and compare two methods for isolating data qubits from measured qubits.<n>We experimentally demonstrate both methods on a crystal of two $171textrmYb+$ ions.
  arXiv  Detail & Related papers  (2025-04-17T00:10:35Z)
• Parallel Logical Measurements via Quantum Code Surgery [42.95092131256421]
  Quantum code surgery is a flexible and low overhead technique for performing logical measurements on quantum error-correcting codes.<n>We present a code surgery scheme, applicable to any qubit stabiliser low-density parity check (LDPC) code, that fault-tolerantly measures many logical Pauli operators in parallel.
  arXiv  Detail & Related papers  (2025-03-06T22:05:52Z)
• Demonstrating dynamic surface codes [118.67046728951689]
  We experimentally demonstrate three time-dynamic implementations of the surface code.<n>First, we embed the surface code on a hexagonal lattice, reducing the necessary couplings per qubit from four to three.<n>Second, we walk a surface code, swapping the role of data and measure qubits each round, achieving error correction with built-in removal of accumulated non-computational errors.<n>Third, we realize the surface code using iSWAP gates instead of the traditional CNOT, extending the set of viable gates for error correction without additional overhead.
  arXiv  Detail & Related papers  (2024-12-18T21:56:50Z)
• Quantum error correction below the surface code threshold [107.92016014248976]
  Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit. We present two surface code memories operating below a critical threshold: a distance-7 code and a distance-5 code integrated with a real-time decoder. Our results present device performance that, if scaled, could realize the operational requirements of large scale fault-tolerant quantum algorithms.
  arXiv  Detail & Related papers  (2024-08-24T23:08:50Z)
• High-threshold, low-overhead and single-shot decodable fault-tolerant quantum memory [0.6144680854063939]
  We present a new family of quantum low-density parity-check codes, which we call radial codes. In simulations of circuit-level noise, we observe comparable error suppression to surface codes of similar distance. Their error correction capabilities, tunable parameters and small size make them promising candidates for implementation on near-term quantum devices.
  arXiv  Detail & Related papers  (2024-06-20T16:08:06Z)
• Fault-tolerant quantum computing with the parity code and noise-biased qubits [0.0]
  We present a fault-tolerant universal quantum computing architecture based on a code concatenation of noise-biased qubits and the parity architecture. The parity architecture can be understood as a LDPC code tailored specifically to obtain any desired logical connectivity from nearest neighbor physical interactions.
  arXiv  Detail & Related papers  (2024-04-17T12:49:31Z)
• Fault-tolerant hyperbolic Floquet quantum error correcting codes [0.0]
  We introduce a family of dynamically generated quantum error correcting codes that we call "hyperbolic Floquet codes" One of our hyperbolic Floquet codes uses 400 physical qubits to encode 52 logical qubits with a code distance of 8, i.e., it is a $[[400,52,8]]$ code. At small error rates, comparable logical error suppression to this code requires 5x as many physical qubits (1924) when using the honeycomb Floquet code with the same noise model and decoder.
  arXiv  Detail & Related papers  (2023-09-18T18:00:02Z)
• Quantum computation on a 19-qubit wide 2d nearest neighbour qubit array [59.24209911146749]
  This paper explores the relationship between the width of a qubit lattice constrained in one dimension and physical thresholds. We engineer an error bias at the lowest level of encoding using the surface code. We then address this bias at a higher level of encoding using a lattice-surgery surface code bus.
  arXiv  Detail & Related papers  (2022-12-03T06:16:07Z)
• Minimax Optimal Quantization of Linear Models: Information-Theoretic Limits and Efficient Algorithms [59.724977092582535]
  We consider the problem of quantizing a linear model learned from measurements. We derive an information-theoretic lower bound for the minimax risk under this setting. We show that our method and upper-bounds can be extended for two-layer ReLU neural networks.
  arXiv  Detail & Related papers  (2022-02-23T02:39:04Z)
• Bounds on stabilizer measurement circuits and obstructions to local implementations of quantum LDPC codes [0.0]
  We establish lower bounds on the size of Clifford circuits that measure a family of commuting Pauli operators. For local-expander quantum codes, we prove that any syndrome extraction circuit implemented with local Clifford gates has depth at least $Omega(n/sqrtN)$. This suggests that quantum LDPC codes are impractical with 2D local quantum hardware.
  arXiv  Detail & Related papers  (2021-09-29T17:52:16Z)

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.