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

Loss-aware optimization of realistic GKP gid states

Michal Matulík, Petr Marek

quant-phSubmitted Oct 30, 2026• Announced Nov 2, 2026• 0 citations
arXivHTMLPDF

Abstract

Realistic preparation of Gottesman-Kitaev-Preskill (GKP) states, the prime candidates for quantum computation with bosonic systems, is inevitably burdened by photon loss. We show how taking this loss into account can lead to more robust quantum states, thereby diminishing its negative influence. Using GKP squeezing as an operational figure of merit, we formulate a loss-aware optimization procedure based on the ground state representation of GKP states. Numerical simulations for square, hexagonal, and asymmetric GKP states show that the optimal preparation generally requires a different initial grid spacing than that of the desired ideal code state. For symmetric and hexagonal lattices, the optimal parameters asymptotically follow the simple scaling relation. The optimized states exhibit better GKP squeezing and greater resilience to losses. These results provide a simple and experimentally relevant strategy for improving realistic photonic GKP state preparation in the presence of known photon loss.

AI Summary

The paper asks how finite-energy GKP states should be chosen when a known photon-loss channel acts after preparation. It optimizes the output’s “GKP squeezing,” an expectation value of a positive operator built from two displacement stabilizers, rather than logical error probability or fidelity. The method transfers loss to the squeezing operator using the channel’s adjoint, then finds its ground state after projection onto a finite Fock space. Numerical calculations cover square, hexagonal, and rectangular grids, with representative cutoffs $N=20,40,80,150$. For square and hexagonal cases, equal attenuation of the two displacement terms gives an exact prescription for the input operator’s grid coefficients, $\mathbf{k}=\eta\mathbf{g}$, where $\eta^2$ is intensity transmission. This prescription is approximately optimal for the rectangular case at weak loss; the approximate and fully optimized curves nearly coincide for $\eta^2>0.9$. At $N=80$ and $\eta^2=0.9$, optimization reduces squeezing from $0.61$ to $0.54$ for square grids, $0.67$ to $0.57$ for hexagonal grids, and $0.67$ to $0.59$ for rectangular grids; smaller values are better. At higher loss, nearly degenerate low-energy eigenstates develop different phase-space structures. The paper uses a gap threshold $\Delta<10^{-3}$ to mark this regime. Benefits increase with Fock cutoff and are stated to be small for near-term traveling-light preparations. The analysis assumes known loss, excludes dephasing and thermal noise, and does not demonstrate preparation circuits or improvements in logical error-correction performance.

Little sign of AI-generated textIncrementalMissing comparisonPossible errorUnclear writing

Error found: The square- and hexagonal-lattice infinite-dimensional optimal-squeezing formulas omit a strictly positive contribution from the noncommuting loss-rescaled displacements and therefore give unattainable lower bounds rather than optima. The optimized states retain the desired GKP-like geometry only in a loss- and cutoff-dependent regime, so improved squeezing alone does not establish improved preparation of that grid throughout the parameter range. Equation (Oeta_mod) is not algebraically equal to (Oeta), because its leading displacement-bracket coefficients should be −1/2 rather than −1.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
15 pages

Related papers

Optimized GKP State for Bosonic Channel Sensing

Thinh M. Le, Jianqing Liu, Jiapeng Zhao +1 more

Bosonic quantum computation harnesses the infinite-dimensional Hilbert space of harmonic oscillators, offering scalable architectures with inherent error correction advantages over qubit-based systems. Despite their potential, bosonic modes encounter significant challenges from prevalent noise sources, particularly photon loss and dephasing, which degrade quantum coherence. Among bosonic error-correcting codes, the Gottesman-Kitaev-Preskill (GKP) code stands out for its ability to correct small phase-space displacements, enabling applications in quantum communication, sensing, and computation. While ideal GKP states require infinite squeezing and are unphysical, the finite squeezing approximate GKP states have been experimentally realized, though their performance depend critically on the squeezing level and measurement strategies. This work addresses a central challenge: how to optimize the squeezing parameter of approximate GKP states and the local oscillator (LO) phase in homodyne detection to maximize precision in estimating bosonic loss-dephasing channel parameters. To address this question, we introduce an adaptive optimization framework guided by classical Fisher information (CFI) and quantum Fisher information (QFI). Numerical simulations demonstrate that this adaptive protocol consistently converges to optimal parameter configurations, determining optimized squeezing levels and LO phases. By offering a practical approach to highprecision quantum channel parameter estimation, this framework has broad implications, from quantum metrology to enabling robust quantum communication systems.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Aug 30, 2025•0 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•167 citations

Photon-loss tolerance of the surface-GKP code with anti-photon-loss decoding

Guan-Ju Yan, Pei-Lin Du, Ke-Min Hu +7 more

Photon loss somewhat limits fault-tolerant photonic quantum computing. We investigate its effect on finite-energy Gottesman--Kitaev--Preskill (GKP) states by modeling the pure-loss channel directly. We obtain photon-loss threshold estimates for the surface-GKP code using nearest-lattice-point inner GKP decoding and minimum-weight perfect matching for the outer surface code. For GKP states with $ε=0.01$ and $ε=0.05$, corresponding to GKP squeezing of $20$ and $13\,\mathrm{dB}$, the estimated thresholds are $γ^\ast=5.5\%$ ($0.24\,\mathrm{dB}$) and $γ^\ast=5.9\%$ ($0.26\,\mathrm{dB}$), respectively. We then introduce an anti-photon-loss inner decoder that compensates for the contraction of the measured quadrature. It increases the corresponding threshold estimates to $γ^\ast=9.8\%$ ($0.45\,\mathrm{dB}$) and $γ^\ast=6.3\%$ ($0.28\,\mathrm{dB}$). Our results highlight the importance of accounting for loss-induced lattice contraction in inner decoding and demonstrate that quadrature compensation enhances the photon-loss tolerance of surface-GKP codes for both high- and moderate-quality GKP states, providing a route toward more photon-loss-robust optical quantum computing.

quant-pharXiv:2611.00694•Nov 3, 2026•0 citations

Neural-Network-Based Design of Approximate Gottesman-Kitaev-Preskill Code

Ye‐Xiong Zeng, Wei Qin, Ye‐Hong Chen +2 more

Gottesman-Kitaev-Preskill (GKP) encoding holds promise for continuous-variable fault-tolerant quantum computing. While an ideal GKP encoding is abstract and impractical due to its nonphysical nature, approximate versions provide viable alternatives. Conventional approximate GKP codewords are superpositions of multiple large-amplitude squeezed coherent states. This feature ensures correctability against single-photon loss and dephasing at short times, but also increases the difficulty of preparing the codewords. To minimize this tradeoff, we utilize a neural network to generate optimal approximate GKP states, allowing effective error correction with just a few squeezed coherent states. We find that such optimized GKP codes outperform the best conventional ones, requiring fewer squeezed coherent states, while maintaining simple and generalized stabilizer operators. Specifically, the former outperform the latter with just one-third of the number of squeezed coherent states at a squeezing level of 9.55 dB. This optimization drastically decreases the complexity of codewords while improving error correctability.

arXiv:2411.01265•Physical Review Letters•Feb 14, 2025•18 citations

Phase-space methods for representing, manipulating, and correcting Gottesman-Kitaev-Preskill qubits

Lucas J. Mensen, Ben Q. Baragiola, Nicolas C. Menicucci

The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and manipulation of GKP encodings that includes Wigner functions for ideal and approximate GKP states, for various types of mixed GKP states, and for GKP-encoded operators. One advantage of a phase-space approach is that Gaussian unitaries, required for computation with GKP codes, correspond to simple transformations on the arguments of Wigner functions. We use this fact and our toolkit to describe GKP error correction, including magic-state preparation, entirely in phase space using operations on Wigner functions. While our focus here is on the square-lattice GKP code, we provide a general framework for GKP codes defined on any lattice.

arXiv:2012.12488•Physical Review A•Aug 6, 2021•24 citations

Efficient characterization of general Gottesman-Kitaev-Preskill qubits

Vojtěch Kuchař, Petr Marek

Practical utilization of Gottesman-Kitaev-Preskill (GKP) qubits requires not only the preparation of logical basis states, but also the ability to prepare and evaluate arbitrary logical qubit superpositions. Currently, this is typically done via quantum state tomography, which is resource-intensive. We introduce a family of positive semidefinite Hermitian operators, one for each point on the logical Bloch sphere, whose unique zero-eigenvalue ground states are the corresponding ideal GKP qubit states. We show that the expectation value of each operator serves as a witness of non-Gaussianity, and corresponds to twice the logical infidelity for states in the ideal logical GKP subspace. Furthermore, the truncated finite-dimensional counterparts of these operators yield physical approximations of arbitrary logical GKP states as their ground states. The evaluation of the proposed operators requires only three quadrature measurements, making this framework practical for both the experimental characterization and numerical optimization of GKP state preparation circuits.

quant-pharXiv:2604.17303•Apr 21, 2026•1 citation
Realistic preparation of Gottesman-Kitaev-Preskill (GKP) states, the prime candidates for quantum computation with bosonic systems, is inevitably burdened by photon loss. We show how taking this loss into account can lead to more robust quantum states, thereby diminishing its negative influence. Using GKP squeezing as an operational figure of merit, we formulate a loss-aware optimization procedure based on the ground state representation of GKP states. Numerical simulations for square, hexagonal, and asymmetric GKP states show that the optimal preparation generally requires a different initial grid spacing than that of the desired ideal code state. For symmetric and hexagonal lattices, the optimal parameters asymptotically follow the simple scaling relation. The optimized states exhibit better GKP squeezing and greater resilience to losses. These results provide a simple and experimentally relevant strategy for improving realistic photonic GKP state preparation in the presence of known photon loss.
The paper asks how finite-energy GKP states should be chosen when a known photon-loss channel acts after preparation. It optimizes the output’s “GKP squeezing,” an expectation value of a positive operator built from two displacement stabilizers, rather than logical error probability or fidelity.
The method transfers loss to the squeezing operator using the channel’s adjoint, then finds its ground state after projection onto a finite Fock space. Numerical calculations cover square, hexagonal, and rectangular grids, with representative cutoffs N=20,40,80,150N=20,40,80,150N=20,40,80,150. For square and hexagonal cases, equal attenuation of the two displacement terms gives an exact prescription for the input operator’s grid coefficients, k=ηg\mathbf{k}=\eta\mathbf{g}k=ηg, where η2\eta^2η2 is intensity transmission. This prescription is approximately optimal for the rectangular case at weak loss; the approximate and fully optimized curves nearly coincide for η2>0.9\eta^2>0.9η2>0.9. At N=80N=80N=80 and η2=0.9\eta^2=0.9η2=0.9, optimization reduces squeezing from 0.610.610.61 to 0.540.540.54 for square grids, 0.670.670.67 to 0.570.570.57 for hexagonal grids, and 0.670.670.67 to 0.590.590.59 for rectangular grids; smaller values are better.
At higher loss, nearly degenerate low-energy eigenstates develop different phase-space structures. The paper uses a gap threshold Δ<10−3\Delta<10^{-3}Δ<10−3 to mark this regime. Benefits increase with Fock cutoff and are stated to be small for near-term traveling-light preparations. The analysis assumes known loss, excludes dephasing and thermal noise, and does not demonstrate preparation circuits or improvements in logical error-correction performance.
Bosonic quantum computation harnesses the infinite-dimensional Hilbert space of harmonic oscillators, offering scalable architectures with inherent error correction advantages over qubit-based systems. Despite their potential, bosonic modes encounter significant challenges from prevalent noise sources, particularly photon loss and dephasing, which degrade quantum coherence. Among bosonic error-correcting codes, the Gottesman-Kitaev-Preskill (GKP) code stands out for its ability to correct small phase-space displacements, enabling applications in quantum communication, sensing, and computation. While ideal GKP states require infinite squeezing and are unphysical, the finite squeezing approximate GKP states have been experimentally realized, though their performance depend critically on the squeezing level and measurement strategies. This work addresses a central challenge: how to optimize the squeezing parameter of approximate GKP states and the local oscillator (LO) phase in homodyne detection to maximize precision in estimating bosonic loss-dephasing channel parameters. To address this question, we introduce an adaptive optimization framework guided by classical Fisher information (CFI) and quantum Fisher information (QFI). Numerical simulations demonstrate that this adaptive protocol consistently converges to optimal parameter configurations, determining optimized squeezing levels and LO phases. By offering a practical approach to highprecision quantum channel parameter estimation, this framework has broad implications, from quantum metrology to enabling robust quantum communication systems.
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.
Photon loss somewhat limits fault-tolerant photonic quantum computing. We investigate its effect on finite-energy Gottesman--Kitaev--Preskill (GKP) states by modeling the pure-loss channel directly. We obtain photon-loss threshold estimates for the surface-GKP code using nearest-lattice-point inner GKP decoding and minimum-weight perfect matching for the outer surface code. For GKP states with ε=0.01ε=0.01ε=0.01 and ε=0.05ε=0.05ε=0.05, corresponding to GKP squeezing of 202020 and 13 dB13\,\mathrm{dB}13dB, the estimated thresholds are γ∗=5.5%γ^\ast=5.5\%γ∗=5.5% (0.24 dB0.24\,\mathrm{dB}0.24dB) and γ∗=5.9%γ^\ast=5.9\%γ∗=5.9% (0.26 dB0.26\,\mathrm{dB}0.26dB), respectively. We then introduce an anti-photon-loss inner decoder that compensates for the contraction of the measured quadrature. It increases the corresponding threshold estimates to γ∗=9.8%γ^\ast=9.8\%γ∗=9.8% (0.45 dB0.45\,\mathrm{dB}0.45dB) and γ∗=6.3%γ^\ast=6.3\%γ∗=6.3% (0.28 dB0.28\,\mathrm{dB}0.28dB). Our results highlight the importance of accounting for loss-induced lattice contraction in inner decoding and demonstrate that quadrature compensation enhances the photon-loss tolerance of surface-GKP codes for both high- and moderate-quality GKP states, providing a route toward more photon-loss-robust optical quantum computing.
Gottesman-Kitaev-Preskill (GKP) encoding holds promise for continuous-variable fault-tolerant quantum computing. While an ideal GKP encoding is abstract and impractical due to its nonphysical nature, approximate versions provide viable alternatives. Conventional approximate GKP codewords are superpositions of multiple large-amplitude squeezed coherent states. This feature ensures correctability against single-photon loss and dephasing at short times, but also increases the difficulty of preparing the codewords. To minimize this tradeoff, we utilize a neural network to generate optimal approximate GKP states, allowing effective error correction with just a few squeezed coherent states. We find that such optimized GKP codes outperform the best conventional ones, requiring fewer squeezed coherent states, while maintaining simple and generalized stabilizer operators. Specifically, the former outperform the latter with just one-third of the number of squeezed coherent states at a squeezing level of 9.55 dB. This optimization drastically decreases the complexity of codewords while improving error correctability.
The Gottesman-Kitaev-Preskill (GKP) encoding of a qubit into a bosonic mode is a promising bosonic code for quantum computation due to its tolerance for noise and all-Gaussian gate set. We present a toolkit for phase-space description and manipulation of GKP encodings that includes Wigner functions for ideal and approximate GKP states, for various types of mixed GKP states, and for GKP-encoded operators. One advantage of a phase-space approach is that Gaussian unitaries, required for computation with GKP codes, correspond to simple transformations on the arguments of Wigner functions. We use this fact and our toolkit to describe GKP error correction, including magic-state preparation, entirely in phase space using operations on Wigner functions. While our focus here is on the square-lattice GKP code, we provide a general framework for GKP codes defined on any lattice.
Practical utilization of Gottesman-Kitaev-Preskill (GKP) qubits requires not only the preparation of logical basis states, but also the ability to prepare and evaluate arbitrary logical qubit superpositions. Currently, this is typically done via quantum state tomography, which is resource-intensive. We introduce a family of positive semidefinite Hermitian operators, one for each point on the logical Bloch sphere, whose unique zero-eigenvalue ground states are the corresponding ideal GKP qubit states. We show that the expectation value of each operator serves as a witness of non-Gaussianity, and corresponds to twice the logical infidelity for states in the ideal logical GKP subspace. Furthermore, the truncated finite-dimensional counterparts of these operators yield physical approximations of arbitrary logical GKP states as their ground states. The evaluation of the proposed operators requires only three quadrature measurements, making this framework practical for both the experimental characterization and numerical optimization of GKP state preparation circuits.