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:2611.14081

Dynamical GKP codes

Jonathan Pelletier, Baptiste Royer

Published Nov 10, 2026• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2611.14081

Related papers

Hybrid Oscillator-Qudit Quantum Processors: Stabilizer States, Stabilizer Codes, Symplectic Operations, and Noncommutative Geometry

S. Chakraborty, Victor V. Albert

We construct stabilizer states and error-correcting codes on hybrid discrete- and continuous-variable systems, generalizing the Gottesman-Kitaev-Preskill (GKP) lattice formalism. Our framework embeds qudit phase space into a hybrid phase space parameterized by continuous variables, with unit cells that grow with qudit dimension—enabling simultaneous measurement of an arbitrarily large range of noncommuting displacements. Simple hybrid states arise from applying a conditional displacement to a GKP state and a Pauli eigenstate, or by encoding qudits of a stabilizer state into a GKP code; their oscillator-qudit entanglement is non-Gaussian, distinguishing them as a resource beyond tensor products of stabilizer states. Simple hybrid codes are subsystem GKP codes whose gauge factor is entangled with a qudit. Numerical experiments suggest that they can outperform GKP codes against physical noise, with decoders tunable to either qudit or oscillator errors. We also relate stabilizer codes to noncommutative tori, showing that a general construction yields multimode multiqudit GKP extensions. We compute the codes’ logical dimension and operators via Morita equivalence.

arXiv:2508.04819•PRX Quantum•Feb 26, 2026•3 citations

Gottesman-Kitaev-Preskill codes: A lattice perspective

Jonathan Conrad, Jens Eisert, Francesco Arzani

We examine general Gottesman-Kitaev-Preskill (GKP) codes for continuous-variable quantum error correction, including concatenated GKP codes, through the lens of lattice theory, in order to better understand the structure of this class of stabilizer codes. We derive formal bounds on code parameters, show how different decoding strategies are precisely related, propose new ways to obtain GKP codes by means of glued lattices and the tensor product of lattices and point to natural resource savings that have remained hidden in recent approaches. We present general results that we illustrate through examples taken from different classes of codes, including scaled self-dual GKP codes and the concatenated surface-GKP code.

arXiv:2109.14645•Quantum•Feb 10, 2022•54 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

Closest Lattice Point Decoding for Multimode Gottesman-Kitaev-Preskill Codes

Mao Lin, Christopher Chamberland, Kyungjoo Noh

Quantum error correction (QEC) plays an essential role in fault-tolerantly realizing quantum algorithms of practical interest.Among different approaches to QEC, encoding logical quantum information in harmonic oscillator modes has been shown to be promising and hardware efficient.In this work, we study multimode Gottesman-Kitaev-Preskill (GKP) codes, encoding a qubit in many oscillators, through a lattice perspective.In particular, we implement a closest point decoding strategy for correcting random Gaussian shift errors.For decoding a generic multimode GKP code, we first identify its corresponding lattice followed by finding the closest lattice point in its symplectic dual lattice to a candidate shift error compatible with the error syndrome.We use this method to characterize the error-correction capabilities of several known multimode GKP codes, including their code distances and fidelities.We also perform numerical optimization of multimode GKP codes up to ten modes and find three instances (with three, seven, and nine modes) with better code distances and fidelities compared to the known GKP codes with the same number of modes.While exact closest point decoding incurs exponential time cost in the number of modes for general unstructured GKP codes, we give several examples of structured GKP codes (i.e., of the repetition-rectangular GKP code types) where the closest point decoding can be performed exactly in linear time.For the surface-GKP code, we show that the closest point decoding can be performed exactly in polynomial time with the help of a minimum-weight-perfect-matching algorithm (MWPM).We show that this MWPM closest point decoder improves both the fidelity and the noise threshold of the surface-GKP code to 0.602 compared to the previously studied MWPM decoder assisted by log-likelihood analog information, which yields a noise threshold of 0.599.

arXiv:2303.04702•PRX Quantum•Dec 1, 2023•19 citations

Quantum low-density lattice codes

Timo Hillmann, Jens Eisert, Francesco Arzani

Gottesman-Kitaev-Preskill (GKP) codes provide a family of promising schemes for encoding discrete quantum information (qudits) into infinite-dimensional bosonic modes based on mathematical lattices. While such codes, when concatenated with discrete-variable codes, are relatively well studied, the construction and decoding of native GKP codes has largely remained open due to the computationally hard problems encountered. To address this challenge, we advocate a strategy of co-designing the decoder and the quantum error-correcting code itself by constructing lattices for which decoding is feasible: The requirement of efficient decoding effectively determines the quantum error-correcting code. This construction is built on classical low-density lattice codes (LDLCs), a lattice analogue of low-density parity-check codes, here lifted to families of GKP codes. Concretely, we introduce quantum versions of classical, randomly constructed LDLCs. We show that after suitable dimensionality reduction these codes have code properties comparable to or better than concatenated GKP-surface codes of equal number of modes. However, the GKP-LDLCs constructed here do not have a strictly sparse parity check matrix, which motivates our study of the performance of natively analog message-passing decoders originally developed for LDLCs when applied to concatenated GKP-LDPC codes. We show that the fully analog, linear-time decoder achieves performances close to state-of-the-art hybrid qubit-analog decoders. To facilitate future research on the structure and performance of general GKP codes, the relevant source code will be released in open-source Julia packages LatticeDecoder.jl and SymplecticGKP.jl.

quant-pharXiv:2609.03021•Sep 4, 2026•1 citation

Quantum error correction with the color-Gottesman-Kitaev-Preskill code

Jiaxuan Zhang, Jian Zhao, Yu-Chun Wu +1 more

The Gottesman-Kitaev-Preskill (GKP) code is an important type of bosonic quantum error-correcting code. Since the GKP code only protects against small shift errors in $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{p}$ and $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{q}$ quadratures, it is necessary to concatenate the GKP code with a stabilizer code for the larger error correction. In this paper, we consider the concatenation of the single-mode GKP code with the two-dimensional (2D) color code (color-GKP code) on the square-octagon lattice. We use the Steane-type scheme with a maximum-likelihood estimation for GKP error correction and show its advantage for the concatenation. In our main paper, the minimum-weight perfect matching algorithm is applied to decode the color-GKP code. Complemented with the continuous-variable information from the GKP code, the threshold of the 2D color code is improved. If only data GKP qubits are noisy, the threshold reaches $\ensuremath{\sigma}\ensuremath{\approx}0.59(\overline{p}\ensuremath{\approx}13.3%)$ compared with $\overline{p}=10.2%$ of the normal 2D color code. If measurements are also noisy, we introduce the generalized restriction decoder on the three-dimensional space-time graph for decoding. The threshold reaches $\ensuremath{\sigma}\ensuremath{\approx}0.46$ when measurements in the GKP error correction are noiseless, and $\ensuremath{\sigma}\ensuremath{\approx}0.24$ when all measurements are noisy. Lastly, the good performance of the generalized restriction decoder is also shown on the normal 2D color code giving the threshold at $3.1%$ under the phenomenological error model.

arXiv:2112.14447•Physical Review A•Dec 20, 2021•18 citations
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.
We construct stabilizer states and error-correcting codes on hybrid discrete- and continuous-variable systems, generalizing the Gottesman-Kitaev-Preskill (GKP) lattice formalism. Our framework embeds qudit phase space into a hybrid phase space parameterized by continuous variables, with unit cells that grow with qudit dimension—enabling simultaneous measurement of an arbitrarily large range of noncommuting displacements. Simple hybrid states arise from applying a conditional displacement to a GKP state and a Pauli eigenstate, or by encoding qudits of a stabilizer state into a GKP code; their oscillator-qudit entanglement is non-Gaussian, distinguishing them as a resource beyond tensor products of stabilizer states. Simple hybrid codes are subsystem GKP codes whose gauge factor is entangled with a qudit. Numerical experiments suggest that they can outperform GKP codes against physical noise, with decoders tunable to either qudit or oscillator errors. We also relate stabilizer codes to noncommutative tori, showing that a general construction yields multimode multiqudit GKP extensions. We compute the codes’ logical dimension and operators via Morita equivalence.
We examine general Gottesman-Kitaev-Preskill (GKP) codes for continuous-variable quantum error correction, including concatenated GKP codes, through the lens of lattice theory, in order to better understand the structure of this class of stabilizer codes. We derive formal bounds on code parameters, show how different decoding strategies are precisely related, propose new ways to obtain GKP codes by means of glued lattices and the tensor product of lattices and point to natural resource savings that have remained hidden in recent approaches. We present general results that we illustrate through examples taken from different classes of codes, including scaled self-dual GKP codes and the concatenated surface-GKP code.
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.
Quantum error correction (QEC) plays an essential role in fault-tolerantly realizing quantum algorithms of practical interest.Among different approaches to QEC, encoding logical quantum information in harmonic oscillator modes has been shown to be promising and hardware efficient.In this work, we study multimode Gottesman-Kitaev-Preskill (GKP) codes, encoding a qubit in many oscillators, through a lattice perspective.In particular, we implement a closest point decoding strategy for correcting random Gaussian shift errors.For decoding a generic multimode GKP code, we first identify its corresponding lattice followed by finding the closest lattice point in its symplectic dual lattice to a candidate shift error compatible with the error syndrome.We use this method to characterize the error-correction capabilities of several known multimode GKP codes, including their code distances and fidelities.We also perform numerical optimization of multimode GKP codes up to ten modes and find three instances (with three, seven, and nine modes) with better code distances and fidelities compared to the known GKP codes with the same number of modes.While exact closest point decoding incurs exponential time cost in the number of modes for general unstructured GKP codes, we give several examples of structured GKP codes (i.e., of the repetition-rectangular GKP code types) where the closest point decoding can be performed exactly in linear time.For the surface-GKP code, we show that the closest point decoding can be performed exactly in polynomial time with the help of a minimum-weight-perfect-matching algorithm (MWPM).We show that this MWPM closest point decoder improves both the fidelity and the noise threshold of the surface-GKP code to 0.602 compared to the previously studied MWPM decoder assisted by log-likelihood analog information, which yields a noise threshold of 0.599.
Gottesman-Kitaev-Preskill (GKP) codes provide a family of promising schemes for encoding discrete quantum information (qudits) into infinite-dimensional bosonic modes based on mathematical lattices. While such codes, when concatenated with discrete-variable codes, are relatively well studied, the construction and decoding of native GKP codes has largely remained open due to the computationally hard problems encountered. To address this challenge, we advocate a strategy of co-designing the decoder and the quantum error-correcting code itself by constructing lattices for which decoding is feasible: The requirement of efficient decoding effectively determines the quantum error-correcting code. This construction is built on classical low-density lattice codes (LDLCs), a lattice analogue of low-density parity-check codes, here lifted to families of GKP codes. Concretely, we introduce quantum versions of classical, randomly constructed LDLCs. We show that after suitable dimensionality reduction these codes have code properties comparable to or better than concatenated GKP-surface codes of equal number of modes. However, the GKP-LDLCs constructed here do not have a strictly sparse parity check matrix, which motivates our study of the performance of natively analog message-passing decoders originally developed for LDLCs when applied to concatenated GKP-LDPC codes. We show that the fully analog, linear-time decoder achieves performances close to state-of-the-art hybrid qubit-analog decoders. To facilitate future research on the structure and performance of general GKP codes, the relevant source code will be released in open-source Julia packages LatticeDecoder.jl and SymplecticGKP.jl.
The Gottesman-Kitaev-Preskill (GKP) code is an important type of bosonic quantum error-correcting code. Since the GKP code only protects against small shift errors in $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{p}$ and $\stackrel{\ifmmode \hat{}\else \^{}\fi{}}{q}$ quadratures, it is necessary to concatenate the GKP code with a stabilizer code for the larger error correction. In this paper, we consider the concatenation of the single-mode GKP code with the two-dimensional (2D) color code (color-GKP code) on the square-octagon lattice. We use the Steane-type scheme with a maximum-likelihood estimation for GKP error correction and show its advantage for the concatenation. In our main paper, the minimum-weight perfect matching algorithm is applied to decode the color-GKP code. Complemented with the continuous-variable information from the GKP code, the threshold of the 2D color code is improved. If only data GKP qubits are noisy, the threshold reaches $\ensuremath{\sigma}\ensuremath{\approx}0.59(\overline{p}\ensuremath{\approx}13.3%)$ compared with p‾=10.2\overline{p}=10.2%p​=10.2 of the normal 2D color code. If measurements are also noisy, we introduce the generalized restriction decoder on the three-dimensional space-time graph for decoding. The threshold reaches $\ensuremath{\sigma}\ensuremath{\approx}0.46$ when measurements in the GKP error correction are noiseless, and $\ensuremath{\sigma}\ensuremath{\approx}0.24$ when all measurements are noisy. Lastly, the good performance of the generalized restriction decoder is also shown on the normal 2D color code giving the threshold at 3.13.1%3.1 under the phenomenological error model.