When to Skip Syndrome Extraction in Surface-GKP Codes

• URL: http://arxiv.org/abs/2606.24469v1
• Date: Tue, 23 Jun 2026 12:01:14 GMT
• Title: When to Skip Syndrome Extraction in Surface-GKP Codes
• Abstract summary: We propose a concrete adaptive skipping scheme for the surface-GKP code.<n>We show that the scheme can reduce the number of surface-code stabilizer measurements while maintaining logical error rates comparable to or lower than those of the full-measurement baseline.
• Score: 0.1909808926064466
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fault-tolerant quantum error correction requires repeated syndrome extraction to address errors induced by the syndrome-extraction circuit itself. However, repeated syndrome extraction incurs significant overhead in terms of gate count and ancilla consumption (e.g., Gottesman-Kitaev-Preskill (GKP) states). Moreover, noisy syndrome extraction can itself inject additional errors into the data qubits. To address these issues, we propose a concrete adaptive skipping scheme for the surface-GKP code, a representative GKP-concatenated architecture, that uses analog information naturally generated during inner GKP correction. At each round, the scheme selects one of four actions: measuring both Z-type and X-type surface-code stabilizers, measuring only one type, or skipping both types and reusing previous syndromes. The decision is based on a reliability comparison between reusing the previous syndrome value and performing a new noisy syndrome extraction. Using circuit-level simulations, we show that the adaptive skipping scheme can reduce the number of surface-code stabilizer measurements while maintaining logical error rates comparable to or lower than those of the full-measurement baseline. The improvement is most pronounced when gate and measurement noise are larger than idle noise, so that avoiding unnecessary syndrome extraction reduces the noise injected into the code. These results indicate that analog information from inner GKP correction can be used not only to improve decoding but also to reduce the measurement overhead of outer-code syndrome extraction.

Related papers

• Overfitting Mitigation via Singular Value Decomposition in Minimum Bayes Risk Decoding [53.9009465845701]
  We introduce SVD-MBR, which frames the pairwise utility matrix as a noisy information signal.<n> Experiments demonstrate that SVD-MBR successfully regularizes decoding, yielding substantial gains across a range of generalized metrics.
  arXiv  Detail & Related papers  (2026-09-01T12:11:29Z)
• Optimizing bias-tailored quantum error correction beyond code-capacity noise [41.99844472131922]
  We find that the substantial advantages predicted for bias-tailored quantum error correction (QEC) under code-capacity noise are strongly reduced once realistic syndrome extraction is considered.<n>We introduce a bias-filtering CNOT gadget that temporarily encodes the ancillary target qubit during syndrome extraction in a repetition code.<n>In a regime of high-bias and low-idle errors, this bias-filtering gadget yields a few-percent relative improvement of the XZZX code error threshold.
  arXiv  Detail & Related papers  (2026-06-16T09:19:10Z)
• JSCGC: Joint Source-Channel-Generation Coding for Wireless Generative Communications [58.67925548779465]
  Joint Source-Channel-Generation Coding (JSCGC) is a generative communication paradigm that replaces the conventional decoder with a generative model at the receiver.<n>JSCGC consistently improves feature-based, semantic-level, and inferenceal quality across diverse channel conditions.
  arXiv  Detail & Related papers  (2026-06-11T03:42:03Z)
• Syndrome resampling enhances quantum error correction thresholds [0.9744114320491685]
  We introduce syndrome resampling, a method that increases QEC thresholds of any decoder.<n>We show that syndrome resampling substantially increases thresholds for both optimal and suboptimal decoders.<n>Applying the method to existing experimental QEC data yields up to two orders of magnitude reduction in logical error rates.
  arXiv  Detail & Related papers  (2026-05-07T12:16:39Z)
• Fault-tolerant measurement-device-independent quantum key distribution with noisy non-Gaussian error correction [0.0]
  We propose an enhanced scheme for the asymmetric CV-MDI-QKD protocol by using Gottesman-Kitaev-Preskill (GKP)<n>In particular, the proposed scheme, which correlates the noises of the data and ancilla via a pair of symplectic transforms, extracts the error syndromes from stabilizer measurements.<n> Numerical analysis shows the composable finite-size security of the protocol under the collective Gaussian attack.
  arXiv  Detail & Related papers  (2026-05-05T02:27:11Z)
• Characterization of syndrome-dependent logical noise in detector regions [0.0]
  We introduce a protocol to directly estimate the logical Pauli channels associated with detector regions formed of two or more syndrome extraction gadgets.<n>We validate this new protocol on a small error-detecting code using Quantinuum H1-1, a trapped-ion device.
  arXiv  Detail & Related papers  (2025-08-11T17:07:54Z)
• The random coupled-plaquette gauge model and the surface code under circuit-level noise [1.351813974961217]
  We optimally account for genuine Y-errors in the surface code in a setting with noisy measurements.<n>We tackle the circuit-level noise scenario, where we use a reduction technique to find effective asymmetric depolarizing and syndrome noise rates.
  arXiv  Detail & Related papers  (2024-12-18T16:20:14Z)
• 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)
• Soft Syndrome Decoding of Quantum LDPC Codes for Joint Correction of Data and Syndrome Errors [10.200716411599831]
  Quantum errors are primarily detected and corrected using the measurement of syndrome information. In this paper, we use this "soft" or analog information without the conventional discretization step. We demonstrate the advantages of extracting the soft information from the syndrome in our improved decoders.
  arXiv  Detail & Related papers  (2022-05-04T22:00:32Z)
• On the Double Descent of Random Features Models Trained with SGD [78.0918823643911]
  We study properties of random features (RF) regression in high dimensions optimized by gradient descent (SGD) We derive precise non-asymptotic error bounds of RF regression under both constant and adaptive step-size SGD setting. We observe the double descent phenomenon both theoretically and empirically.
  arXiv  Detail & Related papers  (2021-10-13T17:47:39Z)
• 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)
• Composably secure data processing for Gaussian-modulated continuous variable quantum key distribution [58.720142291102135]
  Continuous-variable quantum key distribution (QKD) employs the quadratures of a bosonic mode to establish a secret key between two remote parties. We consider a protocol with homodyne detection in the general setting of composable finite-size security. In particular, we analyze the high signal-to-noise regime which requires the use of high-rate (non-binary) low-density parity check codes.
  arXiv  Detail & Related papers  (2021-03-30T18:02:55Z)

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.