Decoding Multimode Gottesman-Kitaev-Preskill Codes with Noisy Auxiliary States
- URL: http://arxiv.org/abs/2510.12677v2
- Date: Fri, 24 Oct 2025 15:23:51 GMT
- Title: Decoding Multimode Gottesman-Kitaev-Preskill Codes with Noisy Auxiliary States
- Authors: Marc-Antoine Roy, Thomas Pousset, Baptiste Royer,
- Abstract summary: We show that leveraging the correlations between measurement results and the actual error affecting the multimode GKP state can decrease the logical error probability by at least an order of magnitude.
- Score: 0.0
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: In order to achieve fault-tolerant quantum computing, we make use of quantum error correction schemes designed to protect the logical information of the system from decoherence. A promising way to preserve such information is to use the multimode Gottesman-Kitaev-Preskill (GKP) encoding, which encodes logical qubits into several harmonic oscillators. In this work, we focus on decoding the measurements obtained from Steane-type quantum error correction protocols for multimode GKP codes. We propose a decoder that considers the noise present on the auxiliary states, more specifically by tracking the correlations between errors on different modes spreading throughout the error-correction circuit. We show that leveraging the correlations between measurement results and the actual error affecting the multimode GKP state can decrease the logical error probability by at least an order of magnitude, yielding more robust quantum computation.
Related papers
- Bosonic quantum computing with near-term devices and beyond [0.0]
This thesis investigates scalable fault-tolerant quantum computation.<n>We develop bosonic quantum codes, quantum LDPC codes, and decoding protocols that connect continuous-variable and discrete-variable error correction.
arXiv Detail & Related papers (2025-12-17T04:01:54Z) - Scalable dissipative quantum error correction for discrete-variable codes [0.0]
Dissipative quantum error correction (QEC) autonomously protects quantum information using engineered dissipation.<n>We present a dissipative QEC protocol for discrete-variable codes, correcting multi-qubit errors via a trickle-down mechanism that sequentially reduces errors weight.
arXiv Detail & Related papers (2025-07-16T18:00:09Z) - 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) - The END: An Equivariant Neural Decoder for Quantum Error Correction [73.4384623973809]
We introduce a data efficient neural decoder that exploits the symmetries of the problem.
We propose a novel equivariant architecture that achieves state of the art accuracy compared to previous neural decoders.
arXiv Detail & Related papers (2023-04-14T19:46:39Z) - Modular decoding: parallelizable real-time decoding for quantum
computers [55.41644538483948]
Real-time quantum computation will require decoding algorithms capable of extracting logical outcomes from a stream of data generated by noisy quantum hardware.
We propose modular decoding, an approach capable of addressing this challenge with minimal additional communication and without sacrificing decoding accuracy.
We introduce the edge-vertex decomposition, a concrete instance of modular decoding for lattice-surgery style fault-tolerant blocks.
arXiv Detail & Related papers (2023-03-08T19:26:10Z) - Closest lattice point decoding for multimode Gottesman-Kitaev-Preskill
codes [0.8192907805418581]
Quantum error correction (QEC) plays an essential role in fault-tolerantly realizing quantum algorithms of practical interest.
We study multimode Gottesman-Kitaev-Preskill (GKP) codes, encoding a qubit in many oscillators.
We implement a closest point decoding strategy for correcting random shift errors.
arXiv Detail & Related papers (2023-03-08T16:42:42Z) - 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) - 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) - Cellular automaton decoders for topological quantum codes with noisy
measurements and beyond [68.8204255655161]
We propose an error correction procedure based on a cellular automaton, the sweep rule, which is applicable to a broad range of codes beyond topological quantum codes.
For simplicity, we focus on the three-dimensional (3D) toric code on the rhombic dodecahedral lattice with boundaries and prove that the resulting local decoder has a non-zero error threshold.
We find that this error correction procedure is remarkably robust against measurement errors and is also essentially insensitive to the details of the lattice and noise model.
arXiv Detail & Related papers (2020-04-15T18:00:01Z)
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.