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

IEEE Information Theory Workshop (ITW)

A Tighter Distance Upper-Bound for Gottesman-Kitaev-Preskill Codes

Shobhit Bhatnagar, P. Vijay Kumar

Published Nov 24, 2024• 0 citations
Publisher

Abstract

Gottesman-Kitaev-Preskill (GKP) codes are stabi-lizer codes that allow one to encode qubits into oscillators, and are known to be hardware efficient. The stabilizer group of a G KP code is isomorphic to a lattice. A particular generator matrix of this lattice can be related to a canonical form via a symplectic matrix. An upper bound to the distance of a G KP code based on the Euler decomposition of this symplectic matrix has been derived in the literature. We derive an upper-bound that is tighter than this bound whenever this symplectic matrix is not orthogonal. This enables us to show that the bound in the prior literature is tight only for the non-interesting case when the symplectic matrix is orthogonal. We then provide some necessary conditions for a class of G KP codes to achieve the improved upper bound. This allows us to upper-bound the largest possible distance of a G KP code in this class.

DOI
10.1109/itw61385.2024.10806993

Related papers

Symplectic Barnes-Wall GKP Codes: Deterministic $O(N \log^2 N)$ Decoding and Logarithmic Rate Scaling

Shanxiang Lyu

We construct an explicit symplectic realization of the Barnes-Wall lattice that yields a family of multimode Gottesman-Kitaev-Preskill (GKP) codes with encoding rate $R = \frac{1}{2}\log_2 N$ and a deterministic $O(N\log^2 N)$ bounded-distance decoder. The recursive generator $G_{m+1} = \bigl(\begin{smallmatrix} G_m & 0 \\ G_m & R_m G_m \end{smallmatrix}\bigr)$ with $R_m = I + Ω$ simultaneously guarantees symplectic integrality for valid quantum stabilizers and preserves the exact Barnes-Wall decoding structure through a chain of isometric isomorphisms. The code distance is constant at $Δ^2 = 1$ (in units of $2π$), representing an explicit distance--rate tradeoff in which logarithmic encoding efficiency is achieved at the cost of non-scaling protection. This construction provides a deterministic, space-efficient paradigm for GKP error correction in platforms supporting non-local modular connectivity.

cs.ITCross-listedarXiv:2608.00601•Aug 4, 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

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

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

Symplectic Lattices and GKP Codes - Simple Randomized Constructions from Cryptographic Lattices

Johannes Blömer, Yinzi Xiao, Zahra Raissi +1 more

We construct good GKP (Gottesman-Kitaev-Preskill) codes (in the sense of Conrad, Eisert and Seifert proposed) from standard short integer solution lattices (SIS) as well as from ring SIS and module SIS lattices, R-SIS and M-SIS lattices, respectively. These lattice are crucial for lattice-based cryptography. Our construction yields GKP codes with distance $\sqrt{n/πe}$. This compares favorably with the NTRU-based construction by Conrad et al. that achieves distance $Ω(\sqrt{n/q}),$ with $n\le q^2/0.28$. Unlike their codes, our codes do not have secret keys that can be used to speed-up the decoding. However, we present a simple decoding algorithm that, for many parameter choices, experimentally yields decoding results similar to the ones for NTRU-based codes. Using the R-SIS and M-SIS construction, our simple decoding algorithm runs in nearly linear time. Following Conrad, Eisert and Seifert's work, our construction of GKP codes follows directly from an explicit, randomized construction of symplectic lattices with (up to constants $\approx 1$) minimal distance $(1/σ_{2n})^{1/2n}\approx \sqrt{\frac{n}{πe}}$, where $σ_{2n}$ is the volume of the 2n-dimensional unit ball. Before this result, Buser and Sarnak gave a non-constructive proof for the existence of such symplectic lattices.

arXiv:2509.10183•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2026•2 citations
Gottesman-Kitaev-Preskill (GKP) codes are stabi-lizer codes that allow one to encode qubits into oscillators, and are known to be hardware efficient. The stabilizer group of a G KP code is isomorphic to a lattice. A particular generator matrix of this lattice can be related to a canonical form via a symplectic matrix. An upper bound to the distance of a G KP code based on the Euler decomposition of this symplectic matrix has been derived in the literature. We derive an upper-bound that is tighter than this bound whenever this symplectic matrix is not orthogonal. This enables us to show that the bound in the prior literature is tight only for the non-interesting case when the symplectic matrix is orthogonal. We then provide some necessary conditions for a class of G KP codes to achieve the improved upper bound. This allows us to upper-bound the largest possible distance of a G KP code in this class.
Symplectic Barnes-Wall GKP Codes: Deterministic O(Nlog⁡2N)O(N \log^2 N)O(Nlog2N) Decoding and Logarithmic Rate Scaling
We construct an explicit symplectic realization of the Barnes-Wall lattice that yields a family of multimode Gottesman-Kitaev-Preskill (GKP) codes with encoding rate R=12log⁡2NR = \frac{1}{2}\log_2 NR=21​log2​N and a deterministic O(Nlog⁡2N)O(N\log^2 N)O(Nlog2N) bounded-distance decoder. The recursive generator Gm+1=(Gm0GmRmGm)G_{m+1} = \bigl(\begin{smallmatrix} G_m & 0 \\ G_m & R_m G_m \end{smallmatrix}\bigr)Gm+1​=(Gm​Gm​​0Rm​Gm​​) with Rm=I+ΩR_m = I + ΩRm​=I+Ω simultaneously guarantees symplectic integrality for valid quantum stabilizers and preserves the exact Barnes-Wall decoding structure through a chain of isometric isomorphisms. The code distance is constant at Δ2=1Δ^2 = 1Δ2=1 (in units of 2π2π2π), representing an explicit distance--rate tradeoff in which logarithmic encoding efficiency is achieved at the cost of non-scaling protection. This construction provides a deterministic, space-efficient paradigm for GKP error correction in platforms supporting non-local modular connectivity.
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.
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.
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.
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 good GKP (Gottesman-Kitaev-Preskill) codes (in the sense of Conrad, Eisert and Seifert proposed) from standard short integer solution lattices (SIS) as well as from ring SIS and module SIS lattices, R-SIS and M-SIS lattices, respectively. These lattice are crucial for lattice-based cryptography. Our construction yields GKP codes with distance n/πe\sqrt{n/πe}n/πe​. This compares favorably with the NTRU-based construction by Conrad et al. that achieves distance Ω(n/q),Ω(\sqrt{n/q}),Ω(n/q​), with n≤q2/0.28n\le q^2/0.28n≤q2/0.28. Unlike their codes, our codes do not have secret keys that can be used to speed-up the decoding. However, we present a simple decoding algorithm that, for many parameter choices, experimentally yields decoding results similar to the ones for NTRU-based codes. Using the R-SIS and M-SIS construction, our simple decoding algorithm runs in nearly linear time. Following Conrad, Eisert and Seifert's work, our construction of GKP codes follows directly from an explicit, randomized construction of symplectic lattices with (up to constants ≈1\approx 1≈1) minimal distance (1/σ2n)1/2n≈nπe(1/σ_{2n})^{1/2n}\approx \sqrt{\frac{n}{πe}}(1/σ2n​)1/2n≈πen​​, where σ2nσ_{2n}σ2n​ is the volume of the 2n-dimensional unit ball. Before this result, Buser and Sarnak gave a non-constructive proof for the existence of such symplectic lattices.