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:2009.07941 · Physical Review Letters

Stabilization of Finite-Energy Gottesman-Kitaev-Preskill States

Baptiste Royer, Shraddha Singh, S. M. Girvin

Published Dec 31, 2020• 88 citations
arXivHTMLPDF

Abstract

We introduce a new approach to Gottesman-Kitaev-Preskill (GKP) states that treats their finite-energy version in an exact manner. Based on this analysis, we develop new qubit-oscillator circuits that autonomously stabilize a GKP manifold, correcting errors without relying on qubit measurements. Finally, we show numerically that logical information encoded in GKP states is very robust against typical oscillator noise sources when stabilized by these new circuits.

DOI
10.1103/physrevlett.125.260509

Related papers

Robust suppression of noise propagation in GKP error-correction

Christian Siegele, Philippe Campagne-Ibarcq

Straightforward logical operations contrasting with complex state preparation are the hallmarks of the bosonic encoding proposed by Gottesman, Kitaev and Preskill (GKP). The recently reported generation and error-correction of GKP qubits in trapped ions and superconducting circuits thus holds great promise for the future of quantum computing architectures based on such encoded qubits. However, these experiments rely on error-syndrome detection via an auxiliary physical qubit, whose noise may propagate and corrupt the encoded GKP qubit. We propose a simple module composed of two oscillators and a physical qubit, operated with two experimentally accessible quantum gates and elementary feedback controls to implement an error-corrected GKP qubit protected from such propagating errors. In the idealized setting of periodic GKP states, we develop efficient numerical methods to optimize our protocol parameters and show that errors of the encoded qubit stemming from flips of the physical qubit and diffusion of the oscillators state in phase-space may be exponentially suppressed as the noise strength over individual operations is decreased. Our approach circumvents the main roadblock towards fault-tolerant quantum computation with GKP qubits.

arXiv:2302.12088•Feb 23, 2023•1 citation

Stabilizers may be poor bounds for fidelities

Aaron Z. Goldberg

The defining feature of ideal Gottesman-Kitaev-Preskill (GKP) states is that they are unchanged by stabilizers, which allow them to detect and correct for common errors without destroying the quantum information encoded in the states. Given this property, can one use the amount to which a state is unchanged by the stabilizers as a proxy for the quality of a GKP state? This is shown to hold in the opposite manner to which it is routinely assumed, because in fact the fidelity a state has to an ideal GKP state is only \textit{upper} bounded by the stabilizer expectation values. This means that, for qubits encoded in harmonic oscillators via the GKP code, a good stabilizer expectation value does not guarantee proximity to an ideal GKP state in terms of any distance based on fidelity.

quant-pharXiv:2512.14811•Physical Review A•Dec 18, 2025•0 citations

Robust suppression of noise propagation in Gottesman-Kitaev-Preskill error correction

Christian Siegele, Philippe Campagne-Ibarcq

Straightforward logical operations contrasting with complex state preparation are the hallmarks of the bosonic encoding proposed by Gottesman, Kitaev, and Preskill (GKP). The recently reported generation and error correction of GKP qubits in trapped ions and superconducting circuits thus holds great promise for the future of quantum computing architectures based on such encoded qubits. However, these experiments rely on error-syndrome detection via an auxiliary physical qubit, whose noise may propagate and corrupt the encoded GKP qubit. We propose a simple module composed of two oscillators and a physical qubit, operated with two experimentally accessible quantum gates and elementary feedback controls to implement an error-corrected GKP qubit protected from such propagating errors. In the idealized setting of periodic GKP states, we develop efficient numerical methods to optimize our protocol parameters and show that errors of the encoded qubit stemming from flips of the physical qubit and diffusion of the oscillators state in phase space may be exponentially suppressed as the noise strength over individual operations is decreased. Our approach circumvents the main roadblock towards fault-tolerant quantum computation with GKP qubits.

Physical Review A•Oct 26, 2023•4 citations

Progress towards practical qubit computation using approximate Gottesman-Kitaev-Preskill codes

Ilan Tzitrin, J. Eli Bourassa, Nicolas C. Menicucci +1 more

Encoding a qubit in the continuous degrees of freedom of an oscillator is a promising path to error-corrected quantum computation. One advantageous way to achieve this is through Gottesman-Kitaev-Preskill (GKP) grid states, whose symmetries allow for the correction of any small continuous error on the oscillator. Unfortunately, ideal grid states have infinite energy, so it is important to find finite-energy approximations that are realistic, practical, and useful for applications. In the first half of this work we investigate the impact of imperfect GKP states on computational circuits independently of the physical architecture. To this end, we analyze the behavior of the physical and logical content of normalizable GKP states through several figures of merit, employing a recently developed modular subsystem decomposition. By tracking the errors that enter into the computational circuit due to imperfections in the GKP states, we are able to gauge the utility of these states for noisy intermediate-scale quantum devices. In the second half, we focus on a state preparation approach in the photonic domain wherein photon-number-resolving measurements on some modes of Gaussian states produce non-Gaussian states in others. We produce detailed numerical results for the preparation of GKP states alongside estimating the resource requirements in practical settings and probing the quality of the resulting states with the tools we develop. Our numerical experiments indicate that we can generate any state in the GKP Bloch sphere with nearly equal resources, which has implications for magic state preparation overheads.

arXiv:1910.03673•Physical Review A•Mar 12, 2020•158 citations

Logical channels in approximate Gottesman-Kitaev-Preskill error correction

Mahnaz Jafarzadeh, Jonathan Conrad, Rafael N. Alexander +1 more

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.

arXiv:2504.13383•Physical Review A•Oct 16, 2025•1 citation

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
We introduce a new approach to Gottesman-Kitaev-Preskill (GKP) states that treats their finite-energy version in an exact manner. Based on this analysis, we develop new qubit-oscillator circuits that autonomously stabilize a GKP manifold, correcting errors without relying on qubit measurements. Finally, we show numerically that logical information encoded in GKP states is very robust against typical oscillator noise sources when stabilized by these new circuits.
Straightforward logical operations contrasting with complex state preparation are the hallmarks of the bosonic encoding proposed by Gottesman, Kitaev and Preskill (GKP). The recently reported generation and error-correction of GKP qubits in trapped ions and superconducting circuits thus holds great promise for the future of quantum computing architectures based on such encoded qubits. However, these experiments rely on error-syndrome detection via an auxiliary physical qubit, whose noise may propagate and corrupt the encoded GKP qubit. We propose a simple module composed of two oscillators and a physical qubit, operated with two experimentally accessible quantum gates and elementary feedback controls to implement an error-corrected GKP qubit protected from such propagating errors. In the idealized setting of periodic GKP states, we develop efficient numerical methods to optimize our protocol parameters and show that errors of the encoded qubit stemming from flips of the physical qubit and diffusion of the oscillators state in phase-space may be exponentially suppressed as the noise strength over individual operations is decreased. Our approach circumvents the main roadblock towards fault-tolerant quantum computation with GKP qubits.
The defining feature of ideal Gottesman-Kitaev-Preskill (GKP) states is that they are unchanged by stabilizers, which allow them to detect and correct for common errors without destroying the quantum information encoded in the states. Given this property, can one use the amount to which a state is unchanged by the stabilizers as a proxy for the quality of a GKP state? This is shown to hold in the opposite manner to which it is routinely assumed, because in fact the fidelity a state has to an ideal GKP state is only \textit{upper} bounded by the stabilizer expectation values. This means that, for qubits encoded in harmonic oscillators via the GKP code, a good stabilizer expectation value does not guarantee proximity to an ideal GKP state in terms of any distance based on fidelity.
Straightforward logical operations contrasting with complex state preparation are the hallmarks of the bosonic encoding proposed by Gottesman, Kitaev, and Preskill (GKP). The recently reported generation and error correction of GKP qubits in trapped ions and superconducting circuits thus holds great promise for the future of quantum computing architectures based on such encoded qubits. However, these experiments rely on error-syndrome detection via an auxiliary physical qubit, whose noise may propagate and corrupt the encoded GKP qubit. We propose a simple module composed of two oscillators and a physical qubit, operated with two experimentally accessible quantum gates and elementary feedback controls to implement an error-corrected GKP qubit protected from such propagating errors. In the idealized setting of periodic GKP states, we develop efficient numerical methods to optimize our protocol parameters and show that errors of the encoded qubit stemming from flips of the physical qubit and diffusion of the oscillators state in phase space may be exponentially suppressed as the noise strength over individual operations is decreased. Our approach circumvents the main roadblock towards fault-tolerant quantum computation with GKP qubits.
Encoding a qubit in the continuous degrees of freedom of an oscillator is a promising path to error-corrected quantum computation. One advantageous way to achieve this is through Gottesman-Kitaev-Preskill (GKP) grid states, whose symmetries allow for the correction of any small continuous error on the oscillator. Unfortunately, ideal grid states have infinite energy, so it is important to find finite-energy approximations that are realistic, practical, and useful for applications. In the first half of this work we investigate the impact of imperfect GKP states on computational circuits independently of the physical architecture. To this end, we analyze the behavior of the physical and logical content of normalizable GKP states through several figures of merit, employing a recently developed modular subsystem decomposition. By tracking the errors that enter into the computational circuit due to imperfections in the GKP states, we are able to gauge the utility of these states for noisy intermediate-scale quantum devices. In the second half, we focus on a state preparation approach in the photonic domain wherein photon-number-resolving measurements on some modes of Gaussian states produce non-Gaussian states in others. We produce detailed numerical results for the preparation of GKP states alongside estimating the resource requirements in practical settings and probing the quality of the resulting states with the tools we develop. Our numerical experiments indicate that we can generate any state in the GKP Bloch sphere with nearly equal resources, which has implications for magic state preparation overheads.
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.