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

Coherent manipulation of graph states composed of finite-energy Gottesman-Kitaev-Preskill-encoded qubits

Kaushik P. Seshadreesan, Prajit Dhara, Ashlesha Patil, Liang Jiang, Saikat Guha

Published May 11, 2022• 11 citations
arXivHTMLPDF

Abstract

Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states composed of realistic, finite-energy approximate GKP-encoded qubits thus constitutes a key task. We consider the finite-energy approximation of GKP-qubit states given by a coherent superposition of shifted finite-squeezed vacuum states, where the displacements are Gaussian distributed. We present an exact description of graph states composed of such approximate GKP qubits as a coherent superposition of a Gaussian ensemble of randomly displaced ideal GKP-qubit graph states. Using standard Gaussian dynamics, we track the transformation of the covariance matrix and the mean-displacement vector elements of the Gaussian distribution of the ensemble under tools such as GKP-Steane error-correction and fusion operations that can be used to grow large high-fidelity GKP-qubit graph states. The covariance matrix elements capture the noise in the graph state due to the finite-energy approximation of GKP qubits, while the mean displacements relate to the possible absolute shift errors on the individual qubits arising conditionally from the homodyne measurements that are a part of these tools. Our work thus pins down an exact coherent error model for graph states generated from truly finite-energy GKP qubits, which can shed light on their error-correction properties.

DOI
10.1103/physreva.105.052416

Related papers

Coherent Manipulation of Finite-Energy Gottesman-Kitaev-Preskill-Qubit Graph States

Kaushik P. Seshadreesan, Prajit Dhara, Ashlesha Patil +2 more

We present an exact description of graph states composed of finite-energy Gottesman-Kitaev-Preskill qubits, and determine rules for their transformation under Steane error correction and fusion operations that can be used to grow large graph states.

Conference on Lasers and Electro-Optics•Jan 1, 2021•0 citations

Optical Gottesman-Kitaev-Preskill qubit generation via approximate squeezed coherent state superposition breeding

Andrew J. Pizzimenti, Daniel Soh

Gottesman-Kitaev-Preskill (GKP) qubits, known for their exceptional error-correction capabilities, are highly coveted in quantum computing. However, generating optical GKP qubits has been a significant challenge. Measurement-based methods, where a portion of entangled squeezed vacuum modes are measured with photon number resolving detectors heralding a desired state in the undetected modes, have emerged as leading candidates for optical GKP qubit generation due their minimal resource requirements. While the current measurement-based methods can produce high-quality GKP qubits, they suffer from low success probabilities limiting experimental realization. The heart of the problem lies in the duality of photon number resolving measurements, being both the source of nonlinearity needed to generate quality GKP qubits and the component driving down their probability of successful production. Our method, breeding approximate squeezed coherent state superpositions created by generalized photon subtraction, overcomes this problem by supplementing two photon number resolving measurements with a single high success probability homodyne measurement. This scheme achieves success probabilities $\ensuremath{\ge}{10}^{\ensuremath{-}5}$, two orders of magnitude higher than strictly photon number resolving measurement based methods, while still producing states with high fidelity, possessing error-correction capabilities equivalent to up to a 10 dB squeezed GKP qubit. This breakthrough significantly advances the practical use of the optical GKP qubit encoding.

arXiv:2409.06902•Physical Review A•Dec 27, 2024•9 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

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

Christophe Vuillot, Hamed Asasi, Yang Wang +2 more

We examine the performance of the single-mode Gottesman-Kitaev-Preskill (GKP) code and its concatenation with the toric code for a noise model of Gaussian shifts, or displacement errors. We show how one can optimize the tracking of errors in repeated noisy error correction for the GKP code. We do this by examining the maximum-likelihood problem for this setting and its mapping onto a 1D Euclidean path-integral modeling a particle in a random cosine potential. We demonstrate the efficiency of a minimum-energy decoding strategy as a proxy for the path integral evaluation. In the second part of this paper, we analyze and numerically assess the concatenation of the GKP code with the toric code. When toric code measurements and GKP error correction measurements are perfect, we find that by using GKP error information the toric code threshold improves from $10%$ to $14%$. When only the GKP error correction measurements are perfect we observe a threshold at $6%$. In the more realistic setting when all error information is noisy, we show how to represent the maximum likelihood decoding problem for the toric-GKP code as a 3D compact QED model in the presence of a quenched random gauge field, an extension of the random-plaquette gauge model for the toric code. We present a decoder for this problem which shows the existence of a noise threshold at shift-error standard deviation ${\ensuremath{\sigma}}_{0}\ensuremath{\approx}0.243$ for toric code measurements, data errors and GKP ancilla errors. If the errors only come from having imperfect GKP states, then this corresponds to states with just four photons or more. Our last result is a no-go result for linear oscillator codes, encoding oscillators into oscillators. For the Gaussian displacement error model, we prove that encoding corresponds to squeezing the shift errors. This shows that linear oscillator codes are useless for quantum information protection against Gaussian shift errors.

arXiv:1810.00047•Physical Review A•Mar 26, 2019•149 citations

Energy-Scaled Zero-Noise Extrapolation for Gottesman-Kitaev-Preskill Code

Gui-Zhong Luo, Matthew Otten

The performance of Gottesman-Kitaev-Preskill (GKP) codes, an approach to hardware-efficient quantum error correction, is limited by the finite squeezing capabilities of current experimental platforms. To circumvent this hardware demand, we introduce Energy-Scaled Zero-Noise Extrapolation (ES-ZNE), a quantum error mitigation protocol that uses the mean photon number of the GKP code as a tunable effective noise parameter. The protocol measures logical observables at a series of accessible finite energies and extrapolates the results to the ideal, infinite-energy limit using an ansatz based on the code's asymptotic error scaling. Through simulating a GKP qubit under a pure-loss channel, we demonstrate that ES-ZNE successfully mitigates finite-energy errors, recovering the ideal expectation values (within numerical uncertainty) in the shallow-noise regime. Furthermore, by computationally removing artifacts arising from the finite-energy encoding, our method characterizes the intrinsic performance of the ideal GKP code, revealing a sharp error threshold beyond which the code's corrective power diminishes. These results establish ES-ZNE as a practical, software-based strategy for enhancing the performance of near-term bosonic quantum processors, trading sampling overhead for demanding physical resources like high squeezing.

quant-pharXiv:2512.03583•Dec 4, 2025•1 citation

Realistic Gottesman-Kitaev-Preskill stabilizer states enable universal quantum computation

Fariba Hosseinynejad, Pavithran Iyer, Guillaume Dauphinais +1 more

Physical Gottesman-Kitaev-Preskill (GKP) states are inherently noisy as ideal ones would require infinite energy. While this is typically considered as a deficiency to be actively corrected, this work demonstrates that imperfect GKP stabilizer states can be leveraged in order to apply non-Clifford gates using only linear optical elements. In particular, Gaussian operations on normalizable GKP states, combined with homodyne measurements, permit two key primitives: clean projection onto Pauli eigenstates in the normalizable GKP codespace, thereby implementing Clifford gates with high fidelity; and probabilistic projection of unmeasured modes onto non-Pauli eigenstates. These results demonstrate that normalizable GKP stabilizer states combined with Gaussian operations provide a practical framework for computational universality within the measurement-based model of quantum computation in a realistic continuous-variable setting.

quant-pharXiv:2511.03874•Physical Review Letters•Nov 7, 2025•2 citations
Graph states are a central resource in measurement-based quantum information processing. In the photonic qubit architecture based on Gottesman-Kitaev-Preskill (GKP) encoding, the generation of high-fidelity graph states composed of realistic, finite-energy approximate GKP-encoded qubits thus constitutes a key task. We consider the finite-energy approximation of GKP-qubit states given by a coherent superposition of shifted finite-squeezed vacuum states, where the displacements are Gaussian distributed. We present an exact description of graph states composed of such approximate GKP qubits as a coherent superposition of a Gaussian ensemble of randomly displaced ideal GKP-qubit graph states. Using standard Gaussian dynamics, we track the transformation of the covariance matrix and the mean-displacement vector elements of the Gaussian distribution of the ensemble under tools such as GKP-Steane error-correction and fusion operations that can be used to grow large high-fidelity GKP-qubit graph states. The covariance matrix elements capture the noise in the graph state due to the finite-energy approximation of GKP qubits, while the mean displacements relate to the possible absolute shift errors on the individual qubits arising conditionally from the homodyne measurements that are a part of these tools. Our work thus pins down an exact coherent error model for graph states generated from truly finite-energy GKP qubits, which can shed light on their error-correction properties.
Gottesman-Kitaev-Preskill (GKP) qubits, known for their exceptional error-correction capabilities, are highly coveted in quantum computing. However, generating optical GKP qubits has been a significant challenge. Measurement-based methods, where a portion of entangled squeezed vacuum modes are measured with photon number resolving detectors heralding a desired state in the undetected modes, have emerged as leading candidates for optical GKP qubit generation due their minimal resource requirements. While the current measurement-based methods can produce high-quality GKP qubits, they suffer from low success probabilities limiting experimental realization. The heart of the problem lies in the duality of photon number resolving measurements, being both the source of nonlinearity needed to generate quality GKP qubits and the component driving down their probability of successful production. Our method, breeding approximate squeezed coherent state superpositions created by generalized photon subtraction, overcomes this problem by supplementing two photon number resolving measurements with a single high success probability homodyne measurement. This scheme achieves success probabilities $\ensuremath{\ge}{10}^{\ensuremath{-}5}$, two orders of magnitude higher than strictly photon number resolving measurement based methods, while still producing states with high fidelity, possessing error-correction capabilities equivalent to up to a 10 dB squeezed GKP qubit. This breakthrough significantly advances the practical use of the optical GKP qubit encoding.
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.
We examine the performance of the single-mode Gottesman-Kitaev-Preskill (GKP) code and its concatenation with the toric code for a noise model of Gaussian shifts, or displacement errors. We show how one can optimize the tracking of errors in repeated noisy error correction for the GKP code. We do this by examining the maximum-likelihood problem for this setting and its mapping onto a 1D Euclidean path-integral modeling a particle in a random cosine potential. We demonstrate the efficiency of a minimum-energy decoding strategy as a proxy for the path integral evaluation. In the second part of this paper, we analyze and numerically assess the concatenation of the GKP code with the toric code. When toric code measurements and GKP error correction measurements are perfect, we find that by using GKP error information the toric code threshold improves from 1010%10 to 1414%14. When only the GKP error correction measurements are perfect we observe a threshold at 66%6. In the more realistic setting when all error information is noisy, we show how to represent the maximum likelihood decoding problem for the toric-GKP code as a 3D compact QED model in the presence of a quenched random gauge field, an extension of the random-plaquette gauge model for the toric code. We present a decoder for this problem which shows the existence of a noise threshold at shift-error standard deviation ${\ensuremath{\sigma}}_{0}\ensuremath{\approx}0.243$ for toric code measurements, data errors and GKP ancilla errors. If the errors only come from having imperfect GKP states, then this corresponds to states with just four photons or more. Our last result is a no-go result for linear oscillator codes, encoding oscillators into oscillators. For the Gaussian displacement error model, we prove that encoding corresponds to squeezing the shift errors. This shows that linear oscillator codes are useless for quantum information protection against Gaussian shift errors.
The performance of Gottesman-Kitaev-Preskill (GKP) codes, an approach to hardware-efficient quantum error correction, is limited by the finite squeezing capabilities of current experimental platforms. To circumvent this hardware demand, we introduce Energy-Scaled Zero-Noise Extrapolation (ES-ZNE), a quantum error mitigation protocol that uses the mean photon number of the GKP code as a tunable effective noise parameter. The protocol measures logical observables at a series of accessible finite energies and extrapolates the results to the ideal, infinite-energy limit using an ansatz based on the code's asymptotic error scaling. Through simulating a GKP qubit under a pure-loss channel, we demonstrate that ES-ZNE successfully mitigates finite-energy errors, recovering the ideal expectation values (within numerical uncertainty) in the shallow-noise regime. Furthermore, by computationally removing artifacts arising from the finite-energy encoding, our method characterizes the intrinsic performance of the ideal GKP code, revealing a sharp error threshold beyond which the code's corrective power diminishes. These results establish ES-ZNE as a practical, software-based strategy for enhancing the performance of near-term bosonic quantum processors, trading sampling overhead for demanding physical resources like high squeezing.
Physical Gottesman-Kitaev-Preskill (GKP) states are inherently noisy as ideal ones would require infinite energy. While this is typically considered as a deficiency to be actively corrected, this work demonstrates that imperfect GKP stabilizer states can be leveraged in order to apply non-Clifford gates using only linear optical elements. In particular, Gaussian operations on normalizable GKP states, combined with homodyne measurements, permit two key primitives: clean projection onto Pauli eigenstates in the normalizable GKP codespace, thereby implementing Clifford gates with high fidelity; and probabilistic projection of unmeasured modes onto non-Pauli eigenstates. These results demonstrate that normalizable GKP stabilizer states combined with Gaussian operations provide a practical framework for computational universality within the measurement-based model of quantum computation in a realistic continuous-variable setting.