Correcting quantum errors using a classical code and one additional qubit

• URL: http://arxiv.org/abs/2510.05008v2
• Date: Wed, 29 Oct 2025 18:24:32 GMT
• Title: Correcting quantum errors using a classical code and one additional qubit
• Abstract summary: We introduce Hadamard-based Virtual Error Correction (H-VEC), a protocol that empowers any classical bit-flip code to correct arbitrary Pauli noise.<n>H-VEC virtually filters the error channel, projecting the noise into pure Y-type errors that are subsequently corrected using the classical code's native decoding algorithm.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classical error-correcting codes are powerful but incompatible with quantum noise, which includes both bit-flips and phase-flips. We introduce Hadamard-based Virtual Error Correction (H-VEC), a protocol that empowers any classical bit-flip code to correct arbitrary Pauli noise with the addition of only a single ancilla qubit and two layers of controlled-Hadamard gates. Through classical post-processing, H-VEC virtually filters the error channel, projecting the noise into pure Y-type errors that are subsequently corrected using the classical code's native decoding algorithm. We demonstrate this by applying H-VEC to the classical repetition code. Under a code-capacity noise model, the resulting protocol not only provides full quantum protection but also achieves an exponentially stronger error suppression (in distance) than the original classical code. The improvements over the surface code are even more pronounced, while using far fewer qubits, simpler checks, and straightforward decoding. There are some limitations to the technique, most notably that H-VEC introduces a sampling overhead due to its post-processing nature. Nonetheless, it represents a fundamentally novel hybrid quantum error correction and mitigation framework that redefines the trade-offs between physical hardware requirements and classical processing for error suppression.

Related papers

• Classical Communication Protocol based on Joint Classical-Quantum Coding [34.13664611440956]
  We introduce a robust quantum communication protocol that integrates classical error-control coding, entanglement distribution, and superdense coding.<n>We derive conditions on the employed codes that guarantee successful error correction under a bounded error-frequency model.<n>We develop a physical error model based on fiber attenuation, detector efficiency, dark counts, and time-slot duration, and use it to evaluate the effective performance of different configurations of error-correcting codes.
  arXiv  Detail & Related papers  (2026-09-15T10:14:27Z)
• The Gain-Engineered Transmon [68.89136228609398]
  We introduce and experimentally realize a noise-biased qubit in a standard transmon-readout resonator circuit.<n>Our results open a path towards using this system as a simple building-block for hardware-efficient quantum error detection and correction schemes.
  arXiv  Detail & Related papers  (2026-08-26T17:00:42Z)
• Impulse Decoding of Quantum LDPC Codes: Equivalence of Degeneracy and Code-Shortening [1.9355898755215148]
  We show that degeneracy is closely related to the classical operation of shortening of a linear block code.<n>We present a parallel decoding scheme for quantum low-density parity-check codes, which we term impulse decoding.<n>We then present another algorithm based on decoding of residual errors, which when combined with impulse decoding achieves further performance improvement under circuit-level noise.
  arXiv  Detail & Related papers  (2026-06-16T17:58:26Z)
• Error Correction of Beamsplitter-Generated Entangled GKP States [56.80803785296797]
  A promising bosonic code is the Gottesman-Kitaev-Preskill (GKP) code.<n>We generate entangled states of GKP qubits by interfering two qunaught states, which have a grid structure but carry no logical information, on a beamsplitter.<n>We generate all four Bell states with an average fidelity of 69%, and demonstrate an extension of the entangled state lifetime through the use of quantum error correction.
  arXiv  Detail & Related papers  (2026-05-08T17:01:19Z)
• Structural encoding with classical codes for computational-basis bit-flip correction in the early fault-tolerant regime [0.6524460254566904]
  We propose a novel framework that integrates quantum computation with the functionality of classical error correction.<n>In this approach, quantum computation is performed within the codeword subspace defined by a classical error correction code.
  arXiv  Detail & Related papers  (2025-10-13T01:36:06Z)
• Virtual Channel Purification [3.0949746731814]
  We develop the virtual channel purification protocol, which consumes similar qubit and gate resources as virtual state purification.<n>It offers stronger error suppression with increased system size and more noisy operation copies.<n>The protocol can also be adapted to key tasks in quantum networks like channel capacity activation and entanglement distribution.
  arXiv  Detail & Related papers  (2024-02-12T18:23:11Z)
• 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)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• Correcting biased noise using Gottesman-Kitaev-Preskill repetition code with noisy ancilla [0.6802401545890963]
  Gottesman-Kitaev-Preskill (GKP) code is proposed to correct small displacement error in phase space. If noise in phase space is biased, square-lattice GKP code can be ancillaryd with XZZX surface code or repetition code. We study the performance of GKP repetition codes with physical ancillary GKP qubits in correcting biased noise.
  arXiv  Detail & Related papers  (2023-08-03T06:14:43Z)
• 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)
• Hybrid noise protection of logical qubits for universal quantum computation [0.0]
  We present a model of universal quantum computation that has many advantages over strategies that require a large overhead. We separate collective noise from individual noises on physical qubits and use a decoherence-free subspace. We are able to either use a steady global magnetic field or to devise a set of DD pulses that remove much of the remaining noise.
  arXiv  Detail & Related papers  (2023-06-27T02:09:14Z)
• 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)
• 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)
• Improved decoding of circuit noise and fragile boundaries of tailored surface codes [61.411482146110984]
  We introduce decoders that are both fast and accurate, and can be used with a wide class of quantum error correction codes. Our decoders, named belief-matching and belief-find, exploit all noise information and thereby unlock higher accuracy demonstrations of QEC. We find that the decoders led to a much higher threshold and lower qubit overhead in the tailored surface code with respect to the standard, square surface code.
  arXiv  Detail & Related papers  (2022-03-09T18:48:54Z)
• Quantum Error Source and Channel Coding [0.0]
  We prove conditions on the set of correctable error patterns allowing for unambiguous decoding based on a lookup table. We argue that quantum error correction is more aptly viewed as source compression in the sense of Shannon.
  arXiv  Detail & Related papers  (2020-04-20T17:55:21Z)

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.