Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.31462

Gottesman-Kitaev-Preskill error-correction with decohered resources

Rajendra S. Bhati, T. Bazylewicz, Jarosław K. Korbicz

quant-phSubmitted Sep 25, 2026• Announced Sep 28, 2026• 0 citations
arXivHTMLPDF

Abstract

Teleportation-based Gottesman-Kitaev-Preskill (GKP) error correction typically assumes a decoherence-free GKP ancilla Bell pair, an idealization that is difficult to reconcile with the ubiquitous environmental decoherence in bosonic systems. Here, we analyze the performance of the GKP protocol subject to pure-dephasing processes, ubiquitous in realistic situations. We show that, under this class of interactions, teleportation, instead of projecting the input onto the GKP subspace, transforms GKP error correction into a correlated Pauli-Gaussian noise process that can accumulate over successive correction rounds. Thus, unlike in previously studied noisy GKP scenarios, the code no longer self-corrects. Moreover, repeated noisy GKP teleportation drives the encoded modes out of the logical subspace, progressively degrading the encoded codewords. We show that the resulting leakage rapidly saturates with the number of correction rounds. Finally, we investigate the implications of our results for motional-oscillator-based GKP error-correction platforms.

AI Summary

The paper asks how environmental decoherence of the ancillary GKP Bell pair affects teleportation-based GKP error correction. It studies finite-energy square-lattice GKP resources under a pure-dephasing quantum Brownian-motion model: both Bell modes couple through $q_A+q_B$ to a common thermal bosonic bath. System self-Hamiltonians are neglected, and a deterministic bath-induced Gaussian shear is assumed compensable. An analytical derivation gives the conditional teleportation map as a Gaussian mixture of operators $K_{\mathbf m}(r)=D(-ir)\Pi_\beta D(-\mathbf m)D(-ir)$. The same random displacement acts before and after the finite-energy codespace projection, correlating residual logical errors with continuous displacement noise. Consequently, the output is not confined to the logical subspace. Numerical simulations of repeated teleportation show leakage increasing and then saturating; the saturation is described phenomenologically rather than established by an analytical bound. Simulations use $\beta=0.1$—approximately $10$ dB squeezing—a Fock cutoff of $50$, and fixed homodyne outcomes $(0,0)$. Ohmic baths with Lorentz–Drude and exponential cutoffs provide explicit time-dependent decoherence parameters in the high-temperature regime. Illustrative trapped-ion estimates report $\tau\sim10$–$10^5$, corresponding to first-round leakage $0.39$–$0.60$ and fidelity $0.55$–$0.36$ for $\beta=0.1$. Small decoherence instead produces negligible asymptotic leakage. The analysis does not establish a fault-tolerance threshold; extensions to other decoherence mechanisms, platform-specific noise, and stabilizer-subsystem fault-tolerance analyses are left for future work.

Little sign of AI-generated textOverclaimsStrong assumptionsMissing comparisonPossible error

Central claim may not hold: Repeated-round accumulation and saturation are demonstrated only for the fixed zero-outcome conditional protocol at one squeezing parameter and finite cutoff, not for outcome-averaged error correction with feedforward. The correlated-displacement construction is derived for compensated equal position coupling to a common bath with vanishing system self-Hamiltonians, rather than for pure dephasing generally. The Gaussian weight in the central teleportation map has integral 1/sqrt(2) and produces dependence on tau squared instead of the tau dependence required by the stated decoherence factor. The continuum decoherence expression is inconsistent with the paper’s discrete coupling formula and explicitly defined spectral density. The experimental estimates equate a dimensionless prefactor with a heating rate in inverse seconds, invalidating the quoted large decoherence strengths and severe practical-degradation estimates.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
14 pages

Related papers

Analysis of loss correction with the Gottesman-Kitaev-Preskill code

Jacob Hastrup, Ulrik L. Andersen

The Gottesman-Kitaev-Preskill (GKP) code is a promising bosonic quantum error-correcting code, encoding logical qubits into a bosonic mode in such a way that many physically relevant noise types can be corrected effectively. A particularly relevant noise channel is the pure loss channel, which the GKP code is known to protect against. In particular, it is commonly pointed out that losses can be corrected by the GKP code by transforming the losses into random Gaussian displacements through a quantum-limited amplification channel. However, implementing such amplification in practice is not ideal and could easily introduce an additional overhead of noise from associated experimental imperfections. Here, we analyze the performance of teleportation-based GKP error correction against loss in the absence of an amplification channel. We show that amplification is not required to perform GKP error correction and that performing amplification actually worsens the performance for practically relevant parameter regimes.

arXiv:2112.01425•Physical Review A•Nov 15, 2023•21 citations

Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes

Victoria Wadewitz, Alessandro Ciani

In order to solve practical problems on a quantum computer, it is necessary to use fault-tolerant quantum error correction schemes to overcome noise: the errors arising from imperfections in physical components. The Gottesman-Kitaev-Preskill (GKP) code aims at achieving this in a hardware efficient manner by encoding finite-dimensional logical subspaces in the Hilbert space of one or more continuous variable modes. In near term implementations, however, it is not feasible to eliminate errors entirely, so it is natural to also employ alternative error mitigation techniques together with error correction. In this work, we study a quantum error mitigation method known as probabilistic error cancellation in the context of the GKP code. We compare Steane-type and teleportation-based GKP error correction, and calculate the sampling overheads associated with the technique for square and hexagonal GKP codes. We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations that is used to express the ideal one of a target logical unitary. We consider noise from finite squeezing on the data and the two ancilla modes, needed for error correction, and examine the relationship between the sampling overhead and the noise for different decoding methods. Our results are calculated for single- and two-qubit GKP Clifford gates and one round of error correction, and show the nontrivial combination of error correction and mitigation in continuous variable codes.

quant-pharXiv:2609.17095•Sep 16, 2026•0 citations

Quantum error correction with the toric Gottesman-Kitaev-Preskill code

Christophe Vuillot, Hamed Asasi, Yang Wang +2 more

We examine the performance of the single-mode Gottesman-Kitaev-Preskill (GKP) code and its concatenation with the toric code for a noise model of Gaussian shifts, or displacement errors. We show how one can optimize the tracking of errors in repeated noisy error correction for the GKP code. We do this by examining the maximum-likelihood problem for this setting and its mapping onto a 1D Euclidean path-integral modeling a particle in a random cosine potential. We demonstrate the efficiency of a minimum-energy decoding strategy as a proxy for the path integral evaluation. In the second part of this paper, we analyze and numerically assess the concatenation of the GKP code with the toric code. When toric code measurements and GKP error correction measurements are perfect, we find that by using GKP error information the toric code threshold improves from $10%$ to $14%$. When only the GKP error correction measurements are perfect we observe a threshold at $6%$. In the more realistic setting when all error information is noisy, we show how to represent the maximum likelihood decoding problem for the toric-GKP code as a 3D compact QED model in the presence of a quenched random gauge field, an extension of the random-plaquette gauge model for the toric code. We present a decoder for this problem which shows the existence of a noise threshold at shift-error standard deviation ${\ensuremath{\sigma}}_{0}\ensuremath{\approx}0.243$ for toric code measurements, data errors and GKP ancilla errors. If the errors only come from having imperfect GKP states, then this corresponds to states with just four photons or more. Our last result is a no-go result for linear oscillator codes, encoding oscillators into oscillators. For the Gaussian displacement error model, we prove that encoding corresponds to squeezing the shift errors. This shows that linear oscillator codes are useless for quantum information protection against Gaussian shift errors.

arXiv:1810.00047•Physical Review A•Mar 26, 2019•149 citations

Performance Analysis of Quantum GKP Error Correction Code Under Noisy Environment

M. Samin Salek, M.A.Mosabbir Antor, Md. Saifur Rahman

Gottesman-Kitaev-Preskill (GKP) Codes tend to address one of the most challenging tasks for Quantum Communication of correcting the erroneous quantum bits. This paper focuses on analyzing the performance of this code under thermal displacement noise. GKP-encoded quantum memory under repeated error-correction cycles was simulated using the Strawberry Fields Bosonic simulator via finite energy approximation of the GKP state. We evaluate the logical-state fidelity as a function of correction cycles and noise strength, and analyze the effectiveness of error correction. Our results illustrate the robustness limits of GKP-based memory under realistic noise and highlight the dependence of logical performance on displacement noise variance, providing insight into practical continuous-variable quantum error correction.

IEEE International Conference on Quantum Photonics, Artificial Intelligence & Networking (QPAIN)•Apr 16, 2026•0 citations

Energy-Scaled Zero-Noise Extrapolation for Gottesman-Kitaev-Preskill Code

Gui-Zhong Luo, Matthew Otten

The performance of Gottesman-Kitaev-Preskill (GKP) codes, an approach to hardware-efficient quantum error correction, is limited by the finite squeezing capabilities of current experimental platforms. To circumvent this hardware demand, we introduce Energy-Scaled Zero-Noise Extrapolation (ES-ZNE), a quantum error mitigation protocol that uses the mean photon number of the GKP code as a tunable effective noise parameter. The protocol measures logical observables at a series of accessible finite energies and extrapolates the results to the ideal, infinite-energy limit using an ansatz based on the code's asymptotic error scaling. Through simulating a GKP qubit under a pure-loss channel, we demonstrate that ES-ZNE successfully mitigates finite-energy errors, recovering the ideal expectation values (within numerical uncertainty) in the shallow-noise regime. Furthermore, by computationally removing artifacts arising from the finite-energy encoding, our method characterizes the intrinsic performance of the ideal GKP code, revealing a sharp error threshold beyond which the code's corrective power diminishes. These results establish ES-ZNE as a practical, software-based strategy for enhancing the performance of near-term bosonic quantum processors, trading sampling overhead for demanding physical resources like high squeezing.

quant-pharXiv:2512.03583•Dec 4, 2025•1 citation

Performance of Teleportation-Based Error-Correction Circuits for Bosonic Codes with Noisy Measurements

Timo Hillmann, Fernando Quijandría, Arne L. Grimsmo +1 more

Bosonic quantum error-correcting codes offer a viable direction towards reducing the hardware overhead required for fault-tolerant quantum information processing.A broad class of bosonic codes, namely rotation-symmetric codes, can be characterized by their phase-space rotation symmetry.However, their performance has been examined to date only within an idealistic noise model.Here, we further analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit.To this end, we numerically compute the average gate fidelity, including measurement errors into the noise model of the data qubit.Focusing on physical measurement models, we assess the performance of heterodyne and adaptive homodyne detection in comparison to the previously studied canonical phase measurement.This setting allows us to shed light on the role of different currently available measurement schemes when decoding the encoded information.We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.In addition, we perform a detailed analysis of Gottesman-Kitaev-Preskill (GKP) codes using a similar error-correction circuit that allows us to analyze the effect of realistic measurement models on different codes.In comparison to RSB codes, we find for GKP codes an even greater reduction in performance together with a vulnerability to photon-number dephasing.Our results show that highly efficient measurement protocols constitute a crucial building block towards error-corrected quantum information processing with bosonic continuous-variable systems.

arXiv:2108.01009•PRX Quantum•May 13, 2022•31 citations
Teleportation-based Gottesman-Kitaev-Preskill (GKP) error correction typically assumes a decoherence-free GKP ancilla Bell pair, an idealization that is difficult to reconcile with the ubiquitous environmental decoherence in bosonic systems. Here, we analyze the performance of the GKP protocol subject to pure-dephasing processes, ubiquitous in realistic situations. We show that, under this class of interactions, teleportation, instead of projecting the input onto the GKP subspace, transforms GKP error correction into a correlated Pauli-Gaussian noise process that can accumulate over successive correction rounds. Thus, unlike in previously studied noisy GKP scenarios, the code no longer self-corrects. Moreover, repeated noisy GKP teleportation drives the encoded modes out of the logical subspace, progressively degrading the encoded codewords. We show that the resulting leakage rapidly saturates with the number of correction rounds. Finally, we investigate the implications of our results for motional-oscillator-based GKP error-correction platforms.
The paper asks how environmental decoherence of the ancillary GKP Bell pair affects teleportation-based GKP error correction. It studies finite-energy square-lattice GKP resources under a pure-dephasing quantum Brownian-motion model: both Bell modes couple through qA+qBq_A+q_BqA​+qB​ to a common thermal bosonic bath. System self-Hamiltonians are neglected, and a deterministic bath-induced Gaussian shear is assumed compensable.
An analytical derivation gives the conditional teleportation map as a Gaussian mixture of operators Km(r)=D(−ir)ΠβD(−m)D(−ir)K_{\mathbf m}(r)=D(-ir)\Pi_\beta D(-\mathbf m)D(-ir)Km​(r)=D(−ir)Πβ​D(−m)D(−ir). The same random displacement acts before and after the finite-energy codespace projection, correlating residual logical errors with continuous displacement noise. Consequently, the output is not confined to the logical subspace. Numerical simulations of repeated teleportation show leakage increasing and then saturating; the saturation is described phenomenologically rather than established by an analytical bound. Simulations use β=0.1\beta=0.1β=0.1—approximately 101010 dB squeezing—a Fock cutoff of 505050, and fixed homodyne outcomes (0,0)(0,0)(0,0).
Ohmic baths with Lorentz–Drude and exponential cutoffs provide explicit time-dependent decoherence parameters in the high-temperature regime. Illustrative trapped-ion estimates report τ∼10\tau\sim10τ∼10–10510^5105, corresponding to first-round leakage 0.390.390.39–0.600.600.60 and fidelity 0.550.550.55–0.360.360.36 for β=0.1\beta=0.1β=0.1. Small decoherence instead produces negligible asymptotic leakage. The analysis does not establish a fault-tolerance threshold; extensions to other decoherence mechanisms, platform-specific noise, and stabilizer-subsystem fault-tolerance analyses are left for future work.
The Gottesman-Kitaev-Preskill (GKP) code is a promising bosonic quantum error-correcting code, encoding logical qubits into a bosonic mode in such a way that many physically relevant noise types can be corrected effectively. A particularly relevant noise channel is the pure loss channel, which the GKP code is known to protect against. In particular, it is commonly pointed out that losses can be corrected by the GKP code by transforming the losses into random Gaussian displacements through a quantum-limited amplification channel. However, implementing such amplification in practice is not ideal and could easily introduce an additional overhead of noise from associated experimental imperfections. Here, we analyze the performance of teleportation-based GKP error correction against loss in the absence of an amplification channel. We show that amplification is not required to perform GKP error correction and that performing amplification actually worsens the performance for practically relevant parameter regimes.
In order to solve practical problems on a quantum computer, it is necessary to use fault-tolerant quantum error correction schemes to overcome noise: the errors arising from imperfections in physical components. The Gottesman-Kitaev-Preskill (GKP) code aims at achieving this in a hardware efficient manner by encoding finite-dimensional logical subspaces in the Hilbert space of one or more continuous variable modes. In near term implementations, however, it is not feasible to eliminate errors entirely, so it is natural to also employ alternative error mitigation techniques together with error correction. In this work, we study a quantum error mitigation method known as probabilistic error cancellation in the context of the GKP code. We compare Steane-type and teleportation-based GKP error correction, and calculate the sampling overheads associated with the technique for square and hexagonal GKP codes. We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations that is used to express the ideal one of a target logical unitary. We consider noise from finite squeezing on the data and the two ancilla modes, needed for error correction, and examine the relationship between the sampling overhead and the noise for different decoding methods. Our results are calculated for single- and two-qubit GKP Clifford gates and one round of error correction, and show the nontrivial combination of error correction and mitigation in continuous variable codes.
We examine the performance of the single-mode Gottesman-Kitaev-Preskill (GKP) code and its concatenation with the toric code for a noise model of Gaussian shifts, or displacement errors. We show how one can optimize the tracking of errors in repeated noisy error correction for the GKP code. We do this by examining the maximum-likelihood problem for this setting and its mapping onto a 1D Euclidean path-integral modeling a particle in a random cosine potential. We demonstrate the efficiency of a minimum-energy decoding strategy as a proxy for the path integral evaluation. In the second part of this paper, we analyze and numerically assess the concatenation of the GKP code with the toric code. When toric code measurements and GKP error correction measurements are perfect, we find that by using GKP error information the toric code threshold improves from 1010%10 to 1414%14. When only the GKP error correction measurements are perfect we observe a threshold at 66%6. In the more realistic setting when all error information is noisy, we show how to represent the maximum likelihood decoding problem for the toric-GKP code as a 3D compact QED model in the presence of a quenched random gauge field, an extension of the random-plaquette gauge model for the toric code. We present a decoder for this problem which shows the existence of a noise threshold at shift-error standard deviation ${\ensuremath{\sigma}}_{0}\ensuremath{\approx}0.243$ for toric code measurements, data errors and GKP ancilla errors. If the errors only come from having imperfect GKP states, then this corresponds to states with just four photons or more. Our last result is a no-go result for linear oscillator codes, encoding oscillators into oscillators. For the Gaussian displacement error model, we prove that encoding corresponds to squeezing the shift errors. This shows that linear oscillator codes are useless for quantum information protection against Gaussian shift errors.
Gottesman-Kitaev-Preskill (GKP) Codes tend to address one of the most challenging tasks for Quantum Communication of correcting the erroneous quantum bits. This paper focuses on analyzing the performance of this code under thermal displacement noise. GKP-encoded quantum memory under repeated error-correction cycles was simulated using the Strawberry Fields Bosonic simulator via finite energy approximation of the GKP state. We evaluate the logical-state fidelity as a function of correction cycles and noise strength, and analyze the effectiveness of error correction. Our results illustrate the robustness limits of GKP-based memory under realistic noise and highlight the dependence of logical performance on displacement noise variance, providing insight into practical continuous-variable quantum error correction.
The performance of Gottesman-Kitaev-Preskill (GKP) codes, an approach to hardware-efficient quantum error correction, is limited by the finite squeezing capabilities of current experimental platforms. To circumvent this hardware demand, we introduce Energy-Scaled Zero-Noise Extrapolation (ES-ZNE), a quantum error mitigation protocol that uses the mean photon number of the GKP code as a tunable effective noise parameter. The protocol measures logical observables at a series of accessible finite energies and extrapolates the results to the ideal, infinite-energy limit using an ansatz based on the code's asymptotic error scaling. Through simulating a GKP qubit under a pure-loss channel, we demonstrate that ES-ZNE successfully mitigates finite-energy errors, recovering the ideal expectation values (within numerical uncertainty) in the shallow-noise regime. Furthermore, by computationally removing artifacts arising from the finite-energy encoding, our method characterizes the intrinsic performance of the ideal GKP code, revealing a sharp error threshold beyond which the code's corrective power diminishes. These results establish ES-ZNE as a practical, software-based strategy for enhancing the performance of near-term bosonic quantum processors, trading sampling overhead for demanding physical resources like high squeezing.
Bosonic quantum error-correcting codes offer a viable direction towards reducing the hardware overhead required for fault-tolerant quantum information processing.A broad class of bosonic codes, namely rotation-symmetric codes, can be characterized by their phase-space rotation symmetry.However, their performance has been examined to date only within an idealistic noise model.Here, we further analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit.To this end, we numerically compute the average gate fidelity, including measurement errors into the noise model of the data qubit.Focusing on physical measurement models, we assess the performance of heterodyne and adaptive homodyne detection in comparison to the previously studied canonical phase measurement.This setting allows us to shed light on the role of different currently available measurement schemes when decoding the encoded information.We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.In addition, we perform a detailed analysis of Gottesman-Kitaev-Preskill (GKP) codes using a similar error-correction circuit that allows us to analyze the effect of realistic measurement models on different codes.In comparison to RSB codes, we find for GKP codes an even greater reduction in performance together with a vulnerability to photon-number dephasing.Our results show that highly efficient measurement protocols constitute a crucial building block towards error-corrected quantum information processing with bosonic continuous-variable systems.