Energetic Costs of Subspace Quantum Error Correction

• URL: http://arxiv.org/abs/2609.03825v1
• Date: Thu, 03 Sep 2026 13:25:26 GMT
• Title: Energetic Costs of Subspace Quantum Error Correction
• Abstract summary: Quantum error correction acts as an entropy pump, transferring noise-induced uncertainty from a protected quantum system into syndrome information stored in an auxiliary memory.<n>Here, we characterise this contribution for subspace quantum error-correcting codes and identify how it depends on the joint structure of the code, the noise, and the representation of the retained syndrome information.<n>Our results establish a hierarchy of syndrome-memory energetic costs and identify the code, noise, and measurement structures that control the ideal thermodynamic burden of subspace quantum error correction.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum error correction acts as an entropy pump, transferring noise-induced uncertainty from a protected quantum system into syndrome information stored in an auxiliary memory. Repeated operation requires this memory to be cleared which unavoidably contributes to the energetic cost of error correction. Here, we characterise this contribution for subspace quantum error-correcting codes and identify how it depends on the joint structure of the code, the noise, and the representation of the retained syndrome information. Starting from the Knill-Laflamme conditions, we construct an effective syndrome state whose von Neumann entropy sets a lower bound on the ideal work required to maintain a reusable syndrome register. Projective syndrome readout generally generates additional entropy, and we quantify the resulting gap through measurement inefficiency. We then specialise to stabiliser codes under independent local Pauli noise and analyse two classical levels of syndrome representation. At the level of abstract error labels, degeneracies among single-qubit errors reduce the leading-order entropy of processed recovery labels. At the parity-check level, lower-weight checks reduce the marginal entropy generated by individual measurement outcomes in the low-noise regime. We identify the additional burden associated with retaining and separately erasing these outcomes as a bit-level inefficiency, and illustrate both costs for the five-qubit, Steane, generalised Shor, and rotated surface codes. Our results establish a hierarchy of syndrome-memory energetic costs and identify the code, noise, and measurement structures that control the ideal thermodynamic burden of subspace quantum error correction.

Related papers

• Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes [45.91504150103373]
  We study a quantum error mitigation method known as probabilistic error cancellation in the context of the Gottesman-Kitaev-Preskill code.<n>We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations.
  arXiv  Detail & Related papers  (2026-09-15T12:29:45Z)
• Quantum Decision Theory for Displacement Detection with Finite-Energy GKP States [46.2474896050764]
  We develop a framework for detecting phase-space displacements with finite-energy, $d$-level Gottesman-Kitaev-Preskill (GKP) probes.<n>For single-mode and entanglement-assisted architectures, we derive the Bayesian minimum-error probability.<n>We benchmark the resulting protocols against coherent-state, direction-matched squeezed-vacuum, and twin-beam schemes.
  arXiv  Detail & Related papers  (2026-08-08T10:32:05Z)
• Measurement-Based Loss Tolerance in Graph-GKP Codes through Syndrome-Resolved Pauli-Frame Decoding [46.2474896050764]
  We develop a causal framework that unifies these mechanisms for measurement-based loss tolerance under pure loss.<n>We derive decoder-conditioned branch restriction, signed-outcome reconstruction, Pauli-frame updating, and syndrome-resolved logical fusion.<n>The resulting graph-GKP interface provides a unified causal control layer for fault-tolerant MBQC, fusion-based computation, and all-photonic repeaters.
  arXiv  Detail & Related papers  (2026-08-01T19:14:42Z)
• Fault-tolerant distributed quantum computing with a single nucleus per node [37.10575718385375]
  In-node gates and measurements are cheap and high-fidelity, whereas inter-node communication relies on a low-coherence communication qubit and faulty photonics.<n>Previous approaches overcame the noisy link by placing several high-quality data qubits in each node and consuming them for Bell pair and GHZ state distillation.<n>Here we show that distillation can be avoided altogether.
  arXiv  Detail & Related papers  (2026-07-27T18:00:00Z)
• When to Skip Syndrome Extraction in Surface-GKP Codes [0.1909808926064466]
  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.
  arXiv  Detail & Related papers  (2026-06-23T12:01:14Z)
• Error recovery protocols within metastable Decoherence-Free Subspaces [0.0]
  Open quantum systems governed by quantum master equations can exhibit quantum metastability.<n>We explore the use of such metastable DFS as code spaces for passive quantum error correction.<n>Using spectral properties of the Liouvillian, we characterize which types of errors can be possibly autonomously reversed.
  arXiv  Detail & Related papers  (2025-06-24T13:54:16Z)
• Fault-Tolerant Qudit Gate Optimization in Solid-State Quantum Memory [0.0]
  This work presents a framework for high-dimensional qudit memory in 153Eu:Y2SiO5.<n>We develop a qudit error correction scheme optimized for solid-state quantum memory.
  arXiv  Detail & Related papers  (2025-03-05T15:06:39Z)
• 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)
• Generalized quantum data-syndrome codes and belief propagation decoding for phenomenological noise [6.322831694506286]
  We introduce quantum data-syndrome codes along with a generalized check matrix that integrates both quaternary and binary alphabets to represent diverse error sources.<n>We observe that at high error rates, fewer rounds of syndrome extraction tend to perform better, while more rounds improve performance at lower error rates.
  arXiv  Detail & Related papers  (2023-10-19T12:23:05Z)
• Minimizing readout-induced noise for early fault-tolerant quantum computers [0.0]
  We present a different method for syndrome extraction, namely Generalized Syndrome Measurement. We can detect the error in the logical state with minimized readout-induced noise. We numerically analyze the performance of our protocol using Iceberg code and Steane code.
  arXiv  Detail & Related papers  (2023-04-23T04:16:26Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Fault-tolerant parity readout on a shuttling-based trapped-ion quantum computer [64.47265213752996]
  We experimentally demonstrate a fault-tolerant weight-4 parity check measurement scheme. We achieve a flag-conditioned parity measurement single-shot fidelity of 93.2(2)%. The scheme is an essential building block in a broad class of stabilizer quantum error correction protocols.
  arXiv  Detail & Related papers  (2021-07-13T20:08:04Z)

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.