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

QIFE: a calibration-free decoder for finite-energy GKP qubits

Hikaru Wakaura, Taiki Tanimae

Published May 20, 2026• 0 citations
Publisher

Abstract

Abstract We introduce \textbf{QIFE} (Quantum Information Field Explorer), a closed-form, noise-model-free decoder for finite-energy Gottesman--Kitaev--Preskill (GKP) qubits. The QIFE decoder operates on Fourier-modular shot statistics of homodyne data and requires no values for the displacement noise, photon transmissivity, or finite-energy envelope, only a small labelled calibration set of known-bit codeword preparations from the operating channel. We show that the textbook Gaussian-mixture-on-lattice maximum-likelihood decoder is not Bayes-optimal under coherent displacement channels and derive the correct $\alpha$-marginalised classifier (a threefold error-rate improvement). When perfectly calibrated, the Bayes-optimal decoder beats our QIFE decoder by about $40\,\%$; under realistic channel mis-calibration, the Bayes-optimal accuracy band is only $\pm 0.2$ wide in $\eta$ and our decoder is up to $51\,\%$ better outside that band, at $\sim 50\,\mu\mathrm{s}$ per inference on a laptop CPU.

DOI
10.21203/rs.3.rs-9755708/v1

Related papers

Noise-model-free versus Bayes-optimal decoding of finite-energy GKP qubits

Hikaru Wakaura, Taiki Tanimae

We study Bayesian decoding of finite-energy Gottesman–Kitaev–Preskill (GKP) qubits from multi-shot homo dyne records under coherent displacement channels, in which all shots of a trial share one latent shift. Our first contribution is an α-marginalised Bayes-optimal decoder, validated shot-for shot against the exact likelihood computed from the simulator's own wavefunction/Fock pipeline: the textbook IID Gaussian mixture maximum-likelihood decoder is 3.2–3.6× worse across σch = 0.4–0.7 (20 seeds), and the failure persists down to shot-shift correlations of ρ ≈ 0.5. Our second contribution is QIFE (Quantum Information Field Explorer), a closed-form Wiener-filter decoder on fixed 36-dimensional Fourier-modular shot statistics that uses no likelihood at all: it trains from a labelled calibration set in 0.67ms (130–240× faster than matched-budget neural decoders, which it also outperforms at every operating point tested) and decodes in 1.3µs per record (∼ 750× faster than the α-marginalised decoder). Third, an equal-calibration-budget comparison: when the same 300 labelled records used to train QIFE are instead used to estimate the channel parameters by grid maximum likelihood, the resulting plug-in Bayes decoder outperforms QIFE at every channel-drift cell we test. We therefore do not recommend noise-model-free decoding when even a coarse loss-aware likelihood is available; its niche is likelihood-free settings and latency-critical post processing. All results are reproducible from an open-source package with an exact-likelihood validation suite.

IEEE Transactions on Quantum Engineering•Jan 1, 2026•0 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

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

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

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

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.

arXiv:2105.04300•Physical Review A•May 11, 2022•11 citations

Quantum Decision Theory for Displacement Detection with Finite-Energy GKP States

Seid Koudia, Symeon Chatzinotas

We develop a quantum-decision-theoretic framework for detecting phase-space displacements with finite-energy, $d$-level Gottesman-Kitaev-Preskill (GKP) probes. For single-mode and entanglement-assisted architectures, we derive the Bayesian minimum-error probability, the optimal Neyman-Pearson receiver-operating characteristic, and the corresponding minimum detectable displacement. Finite-energy effects are treated through exact theta-series displacement kernels, while pure loss followed by quantum-limited amplification is mapped to an effective Gaussian random-displacement channel. Entanglement removes preparation-dependent blind directions and preserves both logical displacement labels, although it does not surpass the pointwise optimized single-mode strategy in the noiseless pure-state setting. We benchmark the resulting protocols against coherent-state, direction-matched squeezed-vacuum, and twin-beam schemes at equal nominal squeezing. Numerical results identify finite-squeezing and lossy regimes in which GKP probes achieve both a lower Bayesian error and a smaller minimum detectable perturbation than the selected Gaussian receivers.

quant-pharXiv:2608.08051•Aug 11, 2026•0 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
Abstract We introduce \textbf{QIFE} (Quantum Information Field Explorer), a closed-form, noise-model-free decoder for finite-energy Gottesman--Kitaev--Preskill (GKP) qubits. The QIFE decoder operates on Fourier-modular shot statistics of homodyne data and requires no values for the displacement noise, photon transmissivity, or finite-energy envelope, only a small labelled calibration set of known-bit codeword preparations from the operating channel. We show that the textbook Gaussian-mixture-on-lattice maximum-likelihood decoder is not Bayes-optimal under coherent displacement channels and derive the correct α\alphaα-marginalised classifier (a threefold error-rate improvement). When perfectly calibrated, the Bayes-optimal decoder beats our QIFE decoder by about 40 %40\,\%40%; under realistic channel mis-calibration, the Bayes-optimal accuracy band is only ±0.2\pm 0.2±0.2 wide in η\etaη and our decoder is up to 51 %51\,\%51% better outside that band, at ∼50 μs\sim 50\,\mu\mathrm{s}∼50μs per inference on a laptop CPU.
We study Bayesian decoding of finite-energy Gottesman–Kitaev–Preskill (GKP) qubits from multi-shot homo dyne records under coherent displacement channels, in which all shots of a trial share one latent shift. Our first contribution is an α-marginalised Bayes-optimal decoder, validated shot-for shot against the exact likelihood computed from the simulator's own wavefunction/Fock pipeline: the textbook IID Gaussian mixture maximum-likelihood decoder is 3.2–3.6× worse across σch = 0.4–0.7 (20 seeds), and the failure persists down to shot-shift correlations of ρ ≈ 0.5. Our second contribution is QIFE (Quantum Information Field Explorer), a closed-form Wiener-filter decoder on fixed 36-dimensional Fourier-modular shot statistics that uses no likelihood at all: it trains from a labelled calibration set in 0.67ms (130–240× faster than matched-budget neural decoders, which it also outperforms at every operating point tested) and decodes in 1.3µs per record (∼ 750× faster than the α-marginalised decoder). Third, an equal-calibration-budget comparison: when the same 300 labelled records used to train QIFE are instead used to estimate the channel parameters by grid maximum likelihood, the resulting plug-in Bayes decoder outperforms QIFE at every channel-drift cell we test. We therefore do not recommend noise-model-free decoding when even a coarse loss-aware likelihood is available; its niche is likelihood-free settings and latency-critical post processing. All results are reproducible from an open-source package with an exact-likelihood validation suite.
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 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.
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.
We develop a quantum-decision-theoretic framework for detecting phase-space displacements with finite-energy, ddd-level Gottesman-Kitaev-Preskill (GKP) probes. For single-mode and entanglement-assisted architectures, we derive the Bayesian minimum-error probability, the optimal Neyman-Pearson receiver-operating characteristic, and the corresponding minimum detectable displacement. Finite-energy effects are treated through exact theta-series displacement kernels, while pure loss followed by quantum-limited amplification is mapped to an effective Gaussian random-displacement channel. Entanglement removes preparation-dependent blind directions and preserves both logical displacement labels, although it does not surpass the pointwise optimized single-mode strategy in the noiseless pure-state setting. We benchmark the resulting protocols against coherent-state, direction-matched squeezed-vacuum, and twin-beam schemes at equal nominal squeezing. Numerical results identify finite-squeezing and lossy regimes in which GKP probes achieve both a lower Bayesian error and a smaller minimum detectable perturbation than the selected Gaussian receivers.
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.