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:2504.13383 · Physical Review A

Logical channels in approximate Gottesman-Kitaev-Preskill error correction

Mahnaz Jafarzadeh, Jonathan Conrad, Rafael N. Alexander, Ben Q. Baragiola

Published Oct 16, 2025• 6 citations
arXivHTMLPDF

Abstract

The Gottesman-Kitaev-Preskill (GKP) encoding is a top contender among bosonic codes for fault-tolerant quantum computation. However, analysis of the code is complicated by the fact that finite-energy code states leak out of the ideal GKP code space and are not orthogonal. We analyze a variant of the GKP stabilizer measurement circuit that virtually projects onto the ideal GKP code space between rounds of error correction, even when damped, finite-energy GKP states are used. This allows us to identify logical maps between projectors; however, due to finite-energy effects, these maps fail to resolve completely positive, trace-preserving (CPTP) channels on the logical GKP code space. We present two solutions to this problem based on channel twirling the damping operator. The first uses symmetries of standard binning (SB) decoding to passively twirl over the full stabilizer group. Doing so converts small amounts of damping into stochastic Gaussian random noise (GRN). The second uses active twirling over a minimal set of representative Pauli shifts that keeps the energy in the code finite and allows for arbitrary decoding. This approach is not limited to small damping and allows the study of decoding more general than SB, which can be optimized to the noise in the circuit. Focusing on damping, we compare decoding strategies tailored to different levels of effective squeezing. While our results indicate that SB decoding is suboptimal for finite-energy GKP states, we observe that the advantage of optimized decoding shrinks as the energy in the code increases. Moreover, the performance of both decoding strategies converges to that of the stabilizer-twirled GRN logical channel. These studies provide stronger arguments for two commonplace procedures in the analysis of GKP error correction in the fault-tolerance regime: $(i)$ using stochastically shifted GKP states in place of coherently damped ones, and $(ii)$ the use of SB decoding.

DOI
10.1103/c8hk-v1qf

Related papers

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

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

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

Modeling Logical Gates and Readout of Superconducting Gottesman-Kitaev-Preskill Qubits

Mackenzie H. Shaw, Andrew C. Doherty, Arne L. Grimsmo

The Gottesman-Kitaev-Preskill (GKP) code is an exciting route to fault-tolerant quantum computing since Gaussian resources and GKP Pauli-eigenstate preparation are sufficient to achieve universal quantum computing. However, there is a disconnect between the noise model that GKP qubits are in theory designed to correct—uniform random displacement errors—and the conditions that affect GKP qubits in superconducting devices in practice: realistic noise channels, logical gates, and inefficient measurements. In this work we bridge this gap in three ways. First, we approximate the effect loss and dephasing on approximate GKP codestates using a random displacement channel, and show that this approximation matches well with numerics. Second, we analyze the error-spreading properties of GKP Clifford gates and describe how a modification in the decoder following the implementation of each gate can reduce the gate infidelity by multiple orders of magnitude. Finally, we consider the effect of homodyne measurement inefficiencies on logical state readout and analyze a scheme to improve the measurement efficiency using the theory of quantum trajectories.

arXiv:2403.02396•PRX Quantum•Sep 24, 2026•17 citations

Twirling and Hamiltonian engineering via dynamical decoupling for Gottesman-Kitaev-Preskill quantum computing

Jonathan Conrad

I introduce an energy constrained approximate twirling operation that can be used to diagonalize effective logical channels in Gottesman-Kitaev-Preskill (GKP) quantum error correction, project states into the GKP code space and construct a dynamical decoupling sequence with fast displacements pulses to distill the GKP stabilizer Hamiltonians from a suitable substrate Hamiltonian. The latter is given by an LC oscillator comprising a superinductance in parallel to a Josephson Junction. This platform, in principle, allows for protected GKP quantum computing without explicit stabilizer measurements or state reset by dynamically generating a ``passively'' stabilized GKP qubit.

arXiv:2010.13853•Physical Review A•Feb 3, 2021•26 citations

Concatenation of the Gottesman-Kitaev-Preskill code with the XZZX surface code

Jiaxuan Zhang, Yu-Chun Wu, Guo‐Ping Guo

Bosonic codes provide an alternative option for quantum error correction. An important category of bosonic codes called the Gottesman-Kitaev-Preskill (GKP) code has aroused much interest recently. Theoretically, the error correction ability of the GKP code is limited since it can only correct small shift errors in position and momentum quadratures. A natural approach to promote the GKP error correction for large-scale, fault-tolerant quantum computation is concatenating encoded GKP states with a stabilizer code. The performance of the XZZX surface-GKP code, i.e., the single-mode GKP code concatenated with the XZZX surface code is investigated in this paper under two different noise models. Firstly, in the code-capacity noise model, the asymmetric rectangular GKP code with parameter $\ensuremath{\lambda}$ is introduced. Using the minimum weight perfect matching decoder combined with the continuous-variable GKP information, the optimal threshold of the XZZX-surface GKP code reaches $\ensuremath{\sigma}\ensuremath{\approx}0.67$ when $\ensuremath{\lambda}=2.1$, compared with the threshold $\ensuremath{\sigma}\ensuremath{\approx}0.60$ of the standard surface-GKP code. Secondly, we analyze the shift errors of two-qubit gates in the actual implementation and build the full circuit-level noise model. By setting the appropriate bias parameters, the logical error rate is reduced by several times in some cases. These results indicate the XZZX surface-GKP codes are more suitable for asymmetric concatenation under the general noise models. We also estimate the overhead of the XZZX-surface GKP code which uses about 291 GKP states with the noise parameter 18.5 dB ($\ensuremath{\kappa}/g\ensuremath{\approx}0.71%$) to encode a logical qubit with the error rate $2.53\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}7}$, compared with the qubit-based surface code using 3041 qubits to achieve almost the same logical error rate.

arXiv:2207.04383•Physical Review A•Jun 9, 2023•20 citations
The Gottesman-Kitaev-Preskill (GKP) encoding is a top contender among bosonic codes for fault-tolerant quantum computation. However, analysis of the code is complicated by the fact that finite-energy code states leak out of the ideal GKP code space and are not orthogonal. We analyze a variant of the GKP stabilizer measurement circuit that virtually projects onto the ideal GKP code space between rounds of error correction, even when damped, finite-energy GKP states are used. This allows us to identify logical maps between projectors; however, due to finite-energy effects, these maps fail to resolve completely positive, trace-preserving (CPTP) channels on the logical GKP code space. We present two solutions to this problem based on channel twirling the damping operator. The first uses symmetries of standard binning (SB) decoding to passively twirl over the full stabilizer group. Doing so converts small amounts of damping into stochastic Gaussian random noise (GRN). The second uses active twirling over a minimal set of representative Pauli shifts that keeps the energy in the code finite and allows for arbitrary decoding. This approach is not limited to small damping and allows the study of decoding more general than SB, which can be optimized to the noise in the circuit. Focusing on damping, we compare decoding strategies tailored to different levels of effective squeezing. While our results indicate that SB decoding is suboptimal for finite-energy GKP states, we observe that the advantage of optimized decoding shrinks as the energy in the code increases. Moreover, the performance of both decoding strategies converges to that of the stabilizer-twirled GRN logical channel. These studies provide stronger arguments for two commonplace procedures in the analysis of GKP error correction in the fault-tolerance regime: (i)(i)(i) using stochastically shifted GKP states in place of coherently damped ones, and (ii)(ii)(ii) the use of SB decoding.
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.
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.
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 Gottesman-Kitaev-Preskill (GKP) code is an exciting route to fault-tolerant quantum computing since Gaussian resources and GKP Pauli-eigenstate preparation are sufficient to achieve universal quantum computing. However, there is a disconnect between the noise model that GKP qubits are in theory designed to correct—uniform random displacement errors—and the conditions that affect GKP qubits in superconducting devices in practice: realistic noise channels, logical gates, and inefficient measurements. In this work we bridge this gap in three ways. First, we approximate the effect loss and dephasing on approximate GKP codestates using a random displacement channel, and show that this approximation matches well with numerics. Second, we analyze the error-spreading properties of GKP Clifford gates and describe how a modification in the decoder following the implementation of each gate can reduce the gate infidelity by multiple orders of magnitude. Finally, we consider the effect of homodyne measurement inefficiencies on logical state readout and analyze a scheme to improve the measurement efficiency using the theory of quantum trajectories.
I introduce an energy constrained approximate twirling operation that can be used to diagonalize effective logical channels in Gottesman-Kitaev-Preskill (GKP) quantum error correction, project states into the GKP code space and construct a dynamical decoupling sequence with fast displacements pulses to distill the GKP stabilizer Hamiltonians from a suitable substrate Hamiltonian. The latter is given by an LC oscillator comprising a superinductance in parallel to a Josephson Junction. This platform, in principle, allows for protected GKP quantum computing without explicit stabilizer measurements or state reset by dynamically generating a ``passively'' stabilized GKP qubit.
Bosonic codes provide an alternative option for quantum error correction. An important category of bosonic codes called the Gottesman-Kitaev-Preskill (GKP) code has aroused much interest recently. Theoretically, the error correction ability of the GKP code is limited since it can only correct small shift errors in position and momentum quadratures. A natural approach to promote the GKP error correction for large-scale, fault-tolerant quantum computation is concatenating encoded GKP states with a stabilizer code. The performance of the XZZX surface-GKP code, i.e., the single-mode GKP code concatenated with the XZZX surface code is investigated in this paper under two different noise models. Firstly, in the code-capacity noise model, the asymmetric rectangular GKP code with parameter $\ensuremath{\lambda}$ is introduced. Using the minimum weight perfect matching decoder combined with the continuous-variable GKP information, the optimal threshold of the XZZX-surface GKP code reaches $\ensuremath{\sigma}\ensuremath{\approx}0.67$ when $\ensuremath{\lambda}=2.1$, compared with the threshold $\ensuremath{\sigma}\ensuremath{\approx}0.60$ of the standard surface-GKP code. Secondly, we analyze the shift errors of two-qubit gates in the actual implementation and build the full circuit-level noise model. By setting the appropriate bias parameters, the logical error rate is reduced by several times in some cases. These results indicate the XZZX surface-GKP codes are more suitable for asymmetric concatenation under the general noise models. We also estimate the overhead of the XZZX-surface GKP code which uses about 291 GKP states with the noise parameter 18.5 dB ($\ensuremath{\kappa}/g\ensuremath{\approx}0.71%$) to encode a logical qubit with the error rate $2.53\ifmmode\times\else\texttimes\fi{}{10}^{\ensuremath{-}7}$, compared with the qubit-based surface code using 3041 qubits to achieve almost the same logical error rate.