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

IEEE International Conference on Quantum Photonics, Artificial Intelligence & Networking (QPAIN)

Performance Analysis of Quantum GKP Error Correction Code Under Noisy Environment

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

Published Apr 16, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/qpain69676.2026.11546220

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

Correcting biased noise using Gottesman-Kitaev-Preskill repetition code with noisy ancilla

Z. Li, Daiqin Su

Concatenation of a bosonic code with a qubit code is one of the promising ways to achieve fault-tolerant quantum computation. As one of the most important bosonic codes, the Gottesman-Kitaev-Preskill (GKP) code is proposed to correct small displacement errors in phase space. If the noise in phase space is biased, the square-lattice GKP code can be concatenated with the repetition code that promises a high fault-tolerant threshold to suppress the logical error. In this work, we study the performance of GKP repetition codes with finite-energy ancillary GKP qubits in correcting biased noise. We find that there exists a critical value of noise variance for the ancillary GKP qubit such that the logical Pauli error rate decreases when increasing the code size. Furthermore, one round of GKP error correction has to be performed before concatenating with the repetition code. Our study paves the way for practical implementation of error correction by concatenating the GKP code with low-level qubit codes.

arXiv:2308.01549•Physical Review A•May 13, 2024•7 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

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

Exploring the quantum capacity of a Gaussian random-displacement channel using Gottesman-Kitaev-Preskill codes and maximum-likelihood decoding

Mao Lin, Kyungjoo Noh

Determining the quantum capacity of a noisy quantum channel is an important problem in the field of quantum communication theory. In this work, we consider the Gaussian random-displacement channel ${\mathcal{N}}_{\ensuremath{\sigma}}$, a type of bosonic Gaussian channels relevant in various bosonic quantum information processing systems. In particular, we attempt to make progress on the problem of determining the quantum capacity of a Gaussian random-displacement channel by analyzing the error-correction performance of several families of multimode Gottesman-Kitaev-Preskill (GKP) codes. In doing so we analyze the surface-square GKP codes using an efficient and exact maximum-likelihood decoder (MLD) up to a large code distance of $d=39$. We find that the error threshold of the surface-square GKP code is remarkably close to $\ensuremath{\sigma}=1/\sqrt{e}\ensuremath{\simeq}0.6065$ at which the best-known lower bound of the quantum capacity of ${\mathcal{N}}_{\ensuremath{\sigma}}$ vanishes. We also analyze the performance of color-hexagonal GKP codes up to a code distance of $d=13$ using a tensor-network decoder serving as an approximate MLD. By focusing on multimode GKP codes that encode just one logical qubit over multiple bosonic modes, we show that GKP codes can achieve nonzero quantum state transmission rates for a Gaussian random-displacement channel ${\mathcal{N}}_{\ensuremath{\sigma}}$ at larger values of $\ensuremath{\sigma}$ than previously demonstrated. Thus, our work reduces the gap between the quantum communication theoretic bounds and the performance of explicit bosonic quantum error-correcting codes in regards to the quantum capacity of a Gaussian random-displacement channel.

arXiv:2411.04277•Physical Review A•May 27, 2025•3 citations
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 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.
Concatenation of a bosonic code with a qubit code is one of the promising ways to achieve fault-tolerant quantum computation. As one of the most important bosonic codes, the Gottesman-Kitaev-Preskill (GKP) code is proposed to correct small displacement errors in phase space. If the noise in phase space is biased, the square-lattice GKP code can be concatenated with the repetition code that promises a high fault-tolerant threshold to suppress the logical error. In this work, we study the performance of GKP repetition codes with finite-energy ancillary GKP qubits in correcting biased noise. We find that there exists a critical value of noise variance for the ancillary GKP qubit such that the logical Pauli error rate decreases when increasing the code size. Furthermore, one round of GKP error correction has to be performed before concatenating with the repetition code. Our study paves the way for practical implementation of error correction by concatenating the GKP code with low-level qubit 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.
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.
Determining the quantum capacity of a noisy quantum channel is an important problem in the field of quantum communication theory. In this work, we consider the Gaussian random-displacement channel ${\mathcal{N}}_{\ensuremath{\sigma}}$, a type of bosonic Gaussian channels relevant in various bosonic quantum information processing systems. In particular, we attempt to make progress on the problem of determining the quantum capacity of a Gaussian random-displacement channel by analyzing the error-correction performance of several families of multimode Gottesman-Kitaev-Preskill (GKP) codes. In doing so we analyze the surface-square GKP codes using an efficient and exact maximum-likelihood decoder (MLD) up to a large code distance of d=39d=39d=39. We find that the error threshold of the surface-square GKP code is remarkably close to $\ensuremath{\sigma}=1/\sqrt{e}\ensuremath{\simeq}0.6065$ at which the best-known lower bound of the quantum capacity of ${\mathcal{N}}_{\ensuremath{\sigma}}$ vanishes. We also analyze the performance of color-hexagonal GKP codes up to a code distance of d=13d=13d=13 using a tensor-network decoder serving as an approximate MLD. By focusing on multimode GKP codes that encode just one logical qubit over multiple bosonic modes, we show that GKP codes can achieve nonzero quantum state transmission rates for a Gaussian random-displacement channel ${\mathcal{N}}_{\ensuremath{\sigma}}$ at larger values of $\ensuremath{\sigma}$ than previously demonstrated. Thus, our work reduces the gap between the quantum communication theoretic bounds and the performance of explicit bosonic quantum error-correcting codes in regards to the quantum capacity of a Gaussian random-displacement channel.