Compressing Syndrome Measurement Sequences

• URL: http://arxiv.org/abs/2509.07288v1
• Date: Mon, 08 Sep 2025 23:48:49 GMT
• Title: Compressing Syndrome Measurement Sequences
• Authors: Benjamin Anker, Milad Marvian,
• Abstract summary: We produce explicit measurement schedules sufficient for fault-tolerant error correction of quantum codes of distance $d$ with $r$ independent stabilizer generators.<n>We numerically examine the performance of our construction on the surface code under several noise models.
• Score: 0.4870012761464388
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In this work, we analyze a framework for constructing fault-tolerant measurement schedules of varying lengths by combining stabilizer generators, and prove results about the distance of such schedules by combining according to classical codes. Using this framework, we produce explicit measurement schedules sufficient for fault-tolerant error correction of quantum codes of distance $d$ with $r$ independent stabilizer generators using only $O(d \log{r})$ measurements if the code is LDPC, and $O(d \log d \log r)$ measurements if the code is produced via concatenating a smaller code with itself $O(\log d)$ times. In both of these cases the number of measurements can be asymptotically fewer than the number of stabilizer generators which define the code. Although optimizing our construction to use the fewest measurements produces high-weight stabilizers, we also show that we can reduce the number of measurements used for specific examples while maintaining low-weight stabilizer measurements. We numerically examine the performance of our construction on the surface code under several noise models and demonstrate the exponential error suppression with increasing distance which is characteristic of weak fault tolerance.

Related papers

• 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)
• Single-Shot and Few-Shot Decoding via Stabilizer Redundancy in Bivariate Bicycle Codes [5.685589351789461]
  We prove that $g(z)$ dictates the code's stabilizer redundancy and the structure of the classical emphsyndrome codes required for single-shot decoding.<n>Within the coprime BB ansatz, high quantum rate imposes an upper bound on syndrome distance, limiting single-shot performance.
  arXiv  Detail & Related papers  (2026-01-03T09:49:58Z)
• Decoding Correlated Errors in Quantum LDPC Codes [41.04211723135311]
  We introduce a decoding framework for correlated errors in quantum LDPC codes under circuit-level noise.<n>The core of our approach is a graph augmentation and rewiring for interference (GARI) method, which modifies the correlated detector error model.<n>Preliminary FPGA implementation results show that such high accuracy can be achieved in real time, with a per-round average decoding latency of 273 ns and sub-microsecond latency in 99.99% of the decoding instances.
  arXiv  Detail & Related papers  (2025-10-15T19:59:05Z)
• Dynamical codes for hardware with noisy readouts [1.5833270109954136]
  Dynamical stabilizer codes may offer a practical route to large-scale quantum computation.<n>We ask how best to optimise the measurement schedule of dynamically condensed colour codes in various limits of noise bias.<n>We find differences in performance are primarily due to the number of rounds of measurements required, rather than the number of qubits.
  arXiv  Detail & Related papers  (2025-05-12T15:24:50Z)
• 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)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Single-shot error correction on toric codes with high-weight stabilizers [0.49109372384514843]
  Single-shot error correction allows for an error threshold with only one round of noisy syndrome measurements regardless of the code size. The single-shot check operators result in a sustainable threshold at 5.62% for an error model with noisy measurements. For this error model, the conventional check operators with multiple measurements yields a lower logical error rate.
  arXiv  Detail & Related papers  (2023-10-24T20:06:19Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Partial Syndrome Measurement for Hypergraph Product Codes [0.0]
  Hypergraph product codes are a promising avenue to achieving fault-tolerant quantum computation with constant overhead. We introduce a fault-tolerance scheme that aims to alleviate the effects of implementing this nonlocality. We find numerical evidence that the logical error rate is exponentially suppressed even when a large constant fraction of generators are not measured.
  arXiv  Detail & Related papers  (2023-06-29T17:23:20Z)
• 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)
• Flag Gadgets based on Classical Codes [1.30536490219656]
  We develop a framework to design flag gadgets using classical codes. We show how to perform fault-tolerant syndrome extraction for any stabilizer code with arbitrary distance. These small examples may be relevant to near-term experiments on small-scale quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T03:16:49Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)

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.