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:2509.12502 · Quantum

Enlarging the GKP stabilizer group for enhanced noise protection

Jonathan Pelletier, Baptiste Royer

Published Jul 8, 2026• 1 citation
arXivHTMLPDF

Abstract

Encoding a qubit in a larger Hilbert space of an oscillator is an efficient way to protect its quantum information against decoherence. Promising examples of such bosonic encodings are the Gottesman-Kitaev-Preskill (GKP) codes. In this work, we investigate how redefining the stabilizer group of the GKP codes to include all operations with trivial action on the code space can contribute to the search for an optimal implementation of a logical circuit when it is affected by noise. We find the generators of the Gaussian stabilizer group, allowing us to search for different physical implementations of a Clifford operation. We then propose an algorithm that finds the optimal implementation of a given logical Clifford circuit on GKP codes, such that the state is less affected by loss errors during the computation. Finally, we demonstrate numerically, with logical randomized benchmarking, that such a compiler can increase the lifetime of square-GKP qubits while running Clifford circuits, compared to a random walk compiler.

DOI
10.22331/q-2026-07-08-2156

Related papers

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.

arXiv:2302.12088•Physical Review A•Oct 26, 2023•9 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

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•6 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

Fault-Tolerant Non-Clifford GKP Gates using Polynomial Phase Gates and On-Demand Noise Biasing

Minh T. P. Nguyen, Mackenzie H. Shaw

The Gottesman-Kitaev-Preskill (GKP) error correcting code uses a bosonic mode to encode a logical qubit, and has the attractive property that its logical Clifford gates can be implemented using Gaussian unitary gates. In contrast, a direct unitary implementation of the ${T}$ gate using the cubic phase gate has been shown to have logical error floor unless the GKP codestate has a biased noise profile [1]. In this work, we propose a method for on-demand noise biasing based on a standard GKP error correction circuit. This on-demand biasing circuit can be used to bias the GKP codestate before a $T$ gate and return it to a non-biased state afterwards. With the on-demand biasing circuit, we prove that the logical error rate of the $T$ gate can be made arbitrarily small as the quality of the GKP codestates increases. We complement our proof with a numerical investigation of the cubic phase gate subject to a phenomenological noise model, showing that the ${T}$ gate can achieve average gate fidelities above $99\%$ with 12 dB of GKP squeezing without the use of postselection. Moreover, we develop a formalism for finding optimal unitary representations of logical diagonal gates in higher levels of the Clifford hierarchy that is based on a framework of ``polynomial phase stabilizers'' whose exponents are polynomial functions of one of the quadrature operators. This formalism naturally extends to multi-qubit logical gates and even to number-phase bosonic codes, providing a powerful algebraic tool for analyzing non-Clifford gates in bosonic quantum codes. [1] J. Hastrup, M. V. Larsen, J. S. Neergaard-Nielsen, N. C. Menicucci, and U. L. Andersen, Phys. Rev. A 103, 032409 (2021)

quant-pharXiv:2511.20355•Physical Review Research•Nov 26, 2025•4 citations

Dynamical GKP codes

Jonathan Pelletier, Baptiste Royer

Dynamical codes protect quantum information with sequences of measurements, generalizing the stabilizer formalism of static codes. However, the dynamical formalism has been developed exclusively for qubit systems. While Gottesman-Kitaev-Preskill (GKP) codes are promising candidates for quantum computing that encode qubits in the continuous phase space of oscillators, no dynamical formalism has been developed for them. In this work, we bridge this gap and introduce dynamical GKP codes, combining continuous-variable lattice encodings with time-dependent translation measurement dynamics. To obtain the update rules and the distance of a given measurement sequence, we first generalize GKP codes to subsystem GKP codes using scaled symplectic lattices. Building on this structure, we adapt the ancestry, detector, and benign-error machinery originally developed for dynamical qubit codes. From this construction, we obtain a general and efficient method to compute the syndrome and distance of a dynamical GKP code from a persistent stabilizer lattice and a bounded inference window. We illustrate the framework with the example of the two-mode square-hexagonal Floquet GKP code. This code has reduced measurement weight compared to both the square and hexagonal GKP codes, while combining their set of logical gates, resulting in easier implementation of the full single-qubit Clifford group. Finally, we show that measurements with irrational symplectic overlap, which have no analog in discrete qubit codes, reduce to destructive homodyne detection in the single-mode case. These results extend an important qubit-code tool to continuous-variable systems and identify a new bridge between discrete stabilizer measurements and continuous homodyne detection.

arXiv:2611.14081•Nov 10, 2026•0 citations
Encoding a qubit in a larger Hilbert space of an oscillator is an efficient way to protect its quantum information against decoherence. Promising examples of such bosonic encodings are the Gottesman-Kitaev-Preskill (GKP) codes. In this work, we investigate how redefining the stabilizer group of the GKP codes to include all operations with trivial action on the code space can contribute to the search for an optimal implementation of a logical circuit when it is affected by noise. We find the generators of the Gaussian stabilizer group, allowing us to search for different physical implementations of a Clifford operation. We then propose an algorithm that finds the optimal implementation of a given logical Clifford circuit on GKP codes, such that the state is less affected by loss errors during the computation. Finally, we demonstrate numerically, with logical randomized benchmarking, that such a compiler can increase the lifetime of square-GKP qubits while running Clifford circuits, compared to a random walk compiler.
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.
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) 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.
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.
The Gottesman-Kitaev-Preskill (GKP) error correcting code uses a bosonic mode to encode a logical qubit, and has the attractive property that its logical Clifford gates can be implemented using Gaussian unitary gates. In contrast, a direct unitary implementation of the T{T}T gate using the cubic phase gate has been shown to have logical error floor unless the GKP codestate has a biased noise profile [1]. In this work, we propose a method for on-demand noise biasing based on a standard GKP error correction circuit. This on-demand biasing circuit can be used to bias the GKP codestate before a TTT gate and return it to a non-biased state afterwards. With the on-demand biasing circuit, we prove that the logical error rate of the TTT gate can be made arbitrarily small as the quality of the GKP codestates increases. We complement our proof with a numerical investigation of the cubic phase gate subject to a phenomenological noise model, showing that the T{T}T gate can achieve average gate fidelities above 99%99\%99% with 12 dB of GKP squeezing without the use of postselection. Moreover, we develop a formalism for finding optimal unitary representations of logical diagonal gates in higher levels of the Clifford hierarchy that is based on a framework of ``polynomial phase stabilizers'' whose exponents are polynomial functions of one of the quadrature operators. This formalism naturally extends to multi-qubit logical gates and even to number-phase bosonic codes, providing a powerful algebraic tool for analyzing non-Clifford gates in bosonic quantum codes. [1] J. Hastrup, M. V. Larsen, J. S. Neergaard-Nielsen, N. C. Menicucci, and U. L. Andersen, Phys. Rev. A 103, 032409 (2021)
Dynamical codes protect quantum information with sequences of measurements, generalizing the stabilizer formalism of static codes. However, the dynamical formalism has been developed exclusively for qubit systems. While Gottesman-Kitaev-Preskill (GKP) codes are promising candidates for quantum computing that encode qubits in the continuous phase space of oscillators, no dynamical formalism has been developed for them. In this work, we bridge this gap and introduce dynamical GKP codes, combining continuous-variable lattice encodings with time-dependent translation measurement dynamics. To obtain the update rules and the distance of a given measurement sequence, we first generalize GKP codes to subsystem GKP codes using scaled symplectic lattices. Building on this structure, we adapt the ancestry, detector, and benign-error machinery originally developed for dynamical qubit codes. From this construction, we obtain a general and efficient method to compute the syndrome and distance of a dynamical GKP code from a persistent stabilizer lattice and a bounded inference window. We illustrate the framework with the example of the two-mode square-hexagonal Floquet GKP code. This code has reduced measurement weight compared to both the square and hexagonal GKP codes, while combining their set of logical gates, resulting in easier implementation of the full single-qubit Clifford group. Finally, we show that measurements with irrational symplectic overlap, which have no analog in discrete qubit codes, reduce to destructive homodyne detection in the single-mode case. These results extend an important qubit-code tool to continuous-variable systems and identify a new bridge between discrete stabilizer measurements and continuous homodyne detection.