Boundary-Aware Stabilizer Scheduling for Distributed Quantum Error Correction

• URL: http://arxiv.org/abs/2604.22471v1
• Date: Fri, 24 Apr 2026 11:49:07 GMT
• Title: Boundary-Aware Stabilizer Scheduling for Distributed Quantum Error Correction
• Abstract summary: In topological quantum error correction, such as color codes, parity checks require remote CNOT operations using heralded Bell pairs.<n>A natural way to reduce this overhead is to skip some seam measurements.<n>We develop a scheduling module that integrates directly into standard syndrome-extraction circuits.
• Score: 1.556083770714207
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Future quantum architectures are expected to be modular, with quantum processors connecting multiple quantum processing units (QPUs) via photonic interconnects. In topological quantum error correction, such as color codes, this creates seam boundaries where parity checks require remote CNOT operations using heralded Bell pairs. These non-local checks are slower and noisier than bulk local checks because entanglement generation is probabilistic, causing data qubits to accumulate idle noise while waiting for remote operations. A natural way to reduce this overhead is to skip some seam measurements; however, doing so makes seam syndrome information stale and can degrade decoding. The central scheduling problem is therefore to determine how frequently seam checks should be measured so as to balance remote-operation and waiting noise against syndrome staleness. To address this trade-off, we develop a scheduling module that integrates directly into standard syndrome-extraction circuits. We consider two policies: Skip-Seam-$τ$ (SS-$τ$), which measures all bulk checks every round while measuring seam checks once every $τ$ rounds and copying the most recent syndrome in skipped rounds, and Adaptive Skip-$τ$ (AST), which selects $τ$ as a function of code distance and entanglement generation rate (EGR). We evaluate these policies on triangular color codes under circuit-level noise in Stim, including idling errors induced by Bell-pair generation delays. Our simulations show that SS-tau and AST reduce remote-operation overhead and can lower the logical error rate (LER) relative to the Measure-All (MA) baseline. For physical error rate $p = 10^{-3}$, we identify an EGR regime in which both SS-$τ$ and AST exhibit behavior consistent with fault-tolerant scaling, with LER decreasing as code distance increases. Across these regimes, SS-$τ$ and AST outperform MA.

Related papers

• QCORE: A Quantum-Control-Oriented Real-Time Execution Architecture with Extensible Closed-Loop Services and Shared AI Acceleration [3.1760149320493807]
  This article presents QCORE, a digital control reference architecture positioned between the Host and a platform-specific analog/mixed-signal front end.<n>QCORE separates task management, shared resources, hard-real-time execution, and long-timescale services into four hardware partitions.<n>Transaction-level, event-driven, and quantum-behavioral models are used for evaluation.
  arXiv  Detail & Related papers  (2026-08-07T07:01:14Z)
• Scaling Laws for Agent Harnesses via Effective Feedback Compute [53.68149869349268]
  emphEffective Feedback Compute (EFC) is a trace-level scaling coordinate that credits feedback only when it is informative, valid, non-redundant, and retained for subsequent decisions.<n>EFC-based coordinates consistently predict failure rates better than raw-compute baselines.
  arXiv  Detail & Related papers  (2026-05-28T09:45:47Z)
• Co-Designing Error Mitigation and Error Detection for Logical Qubits [0.6100263509208005]
  Near-term quantum workloads demand error management.<n>QED encodes logical qubits and discards error-flagged runs.<n>PEC can correct these in software, but at exponential cost in noise strength.
  arXiv  Detail & Related papers  (2026-04-21T18:00:02Z)
• Correction and Corruption: A Two-Rate View of Error Flow in LLM Protocols [51.56484100374058]
  We propose a paired-outcome measurement interface for auditing a single protocol step on exact-match tasks.<n>For each instance, the interface records a baseline correctness bit and a post-step correctness bit.<n>These rates predict accuracy changes and define a reusable empirical interface testable across seeds, mixtures, and pipelines.
  arXiv  Detail & Related papers  (2026-04-20T13:25:40Z)
• Autonomous Hamiltonian certification and changepoint detection [1.2021700665093262]
  Environmental noise can cause calibrated Hamiltonian parameters to drift over time, necessitating expensive recalibration.<n>We develop efficient Hamiltonian certification and changepoint detection protocols in the autonomous setting.<n>Our approach enables quantum devices to autonomously monitor their own calibration status without requiring entangling systems, verification operations, or a trusted reference device.
  arXiv  Detail & Related papers  (2026-03-27T17:54:45Z)
• Unsupervised Conformal Inference: Bootstrapping and Alignment to Control LLM Uncertainty [49.19257648205146]
  We propose an unsupervised conformal inference framework for generation.<n>Our gates achieve close-to-nominal coverage and provide tighter, more stable thresholds than split UCP.<n>The result is a label-free, API-compatible gate for test-time filtering.
  arXiv  Detail & Related papers  (2025-09-26T23:40:47Z)
• Optimizing quantum error correction protocols with erasure qubits [42.00287729190062]
  Erasure qubits offer a promising avenue toward reducing the overhead of quantum error correction protocols. We focus on the performance of the surface code as a quantum memory. Our results indicate that QEC protocols with erasure qubits can outperform the ones with state-of-the-art transmons.
  arXiv  Detail & Related papers  (2024-08-01T18:00:01Z)
• DASA: Delay-Adaptive Multi-Agent Stochastic Approximation [64.32538247395627]
  We consider a setting in which $N$ agents aim to speedup a common Approximation problem by acting in parallel and communicating with a central server. To mitigate the effect of delays and stragglers, we propose textttDASA, a Delay-Adaptive algorithm for multi-agent Approximation.
  arXiv  Detail & Related papers  (2024-03-25T22:49:56Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• DGR: Tackling Drifted and Correlated Noise in Quantum Error Correction via Decoding Graph Re-weighting [14.817445452647588]
  We propose an efficient decoding graph edge re-weighting strategy with no quantum overhead. DGR reduces the logical error rate by 3.6x on average-case noise mismatch with exceeding 5000x improvement under worst-case mismatch.
  arXiv  Detail & Related papers  (2023-11-27T18:26:16Z)
• 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)
• Long-range data transmission in a fault-tolerant quantum bus architecture [0.0]
  Scheme generates a maximally entangled state of two qubits using a depth-$6$ circuit consisting of nearest-neighbor Clifford gates and local measurements only. We prove a converse bound $Omega(log R)$ on the number of qubits per repeater among all low-latency schemes for fault-tolerant quantum communication over distance.
  arXiv  Detail & Related papers  (2022-09-20T14:57:27Z)

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.