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

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

Jonathan Conrad

Published Feb 3, 2021• 26 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1103/physreva.103.022404

Related papers

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

Stabilization of Finite-Energy Gottesman-Kitaev-Preskill States

Baptiste Royer, Shraddha Singh, S. M. Girvin

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.

arXiv:2009.07941•Physical Review Letters•Dec 31, 2020•97 citations

Autonomous Quantum Error Correction of Gottesman-Kitaev-Preskill States

Dany Lachance-Quirion, Marc-Antoine Lemonde, Jean Olivier Simoneau +12 more

The Gottesman-Kitaev-Preskill (GKP) code encodes a logical qubit into a bosonic system with resilience against single-photon loss, the predominant error in most bosonic systems. Here we present experimental results demonstrating quantum error correction of GKP states based on reservoir engineering of a superconducting device. Error correction is made fully autonomous through an unconditional reset of an auxiliary transmon qubit. We show that the lifetime of the logical qubit is increased from quantum error correction, therefore reaching the point at which more errors are corrected than generated.

arXiv:2310.11400•Physical Review Letters•Apr 12, 2024•62 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.

arXiv:2302.12088•Physical Review A•Oct 26, 2023•9 citations

Subsystem self-correction of the GKP qubit

Brian Chung Hang Cheung, Lasse Bjørn Kristensen, Frederik Nathan +1 more

Passive quantum error correction, also known as self-correction, is a holy grail in quantum information science. Recent theoretical advances suggest that the Gottesman-Kitaev-Preskill (GKP) code can exhibit self-correction properties, positioning it as a candidate for the realization of self-correcting quantum memories. In this article, we provide a self-contained derivation of the self-correcting behavior of the ideal GKP Hamiltonian, manifested in the Arrhenius type scaling of the logical lifetime, from a quantum-information perspective based on the subsystem code decomposition. When coupling through the physical quadrature $q$ and $p$, the detailed-balance jump operators decompose into a dominant part acting only on the gauge subsystem and a boundary term that acts non-trivially on the logical qubit. The boundary term is then exponentially suppressed by the Gibbs weights near the edge of the modular cells. In contrast to spin-based quantum memories such as the two-dimensional surface code, the GKP Hamiltonian realizes an effective string tension in modular phase space, whereby the energy cost increases as an error approaches the boundary of a logical sector.

quant-pharXiv:2609.07702•Sep 8, 2026•0 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
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.
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 encodes a logical qubit into a bosonic system with resilience against single-photon loss, the predominant error in most bosonic systems. Here we present experimental results demonstrating quantum error correction of GKP states based on reservoir engineering of a superconducting device. Error correction is made fully autonomous through an unconditional reset of an auxiliary transmon qubit. We show that the lifetime of the logical qubit is increased from quantum error correction, therefore reaching the point at which more errors are corrected than generated.
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.
Passive quantum error correction, also known as self-correction, is a holy grail in quantum information science. Recent theoretical advances suggest that the Gottesman-Kitaev-Preskill (GKP) code can exhibit self-correction properties, positioning it as a candidate for the realization of self-correcting quantum memories. In this article, we provide a self-contained derivation of the self-correcting behavior of the ideal GKP Hamiltonian, manifested in the Arrhenius type scaling of the logical lifetime, from a quantum-information perspective based on the subsystem code decomposition. When coupling through the physical quadrature qqq and ppp, the detailed-balance jump operators decompose into a dominant part acting only on the gauge subsystem and a boundary term that acts non-trivially on the logical qubit. The boundary term is then exponentially suppressed by the Gibbs weights near the edge of the modular cells. In contrast to spin-based quantum memories such as the two-dimensional surface code, the GKP Hamiltonian realizes an effective string tension in modular phase space, whereby the energy cost increases as an error approaches the boundary of a logical sector.
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.