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.
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
α-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
±0.2 wide in
η and our decoder is up to
51% better outside that band, at
∼50μs per inference on a laptop CPU.
Continuous-variable quantum-state tomography usually reconstructs a truncated Fock-basis density matrix. We study a compact alternative: finite mixtures of displaced, squeezed Gaussian kets whose ρ = BB† construction is positive semidefinite by construction, fitted by per-sample homodyne likelihood with closed-form gradients, and composed with physical loss and noise channels. On the public propagating-light GKP dataset of Konno et al. (Science 2024), a rank-4 model with 92 real parameters matches the empirical full-rank maximum-likelihood frontier (255 parameters) at confidence-interval resolution on held-out likelihood. On a synthetic thermal-noise target that we prove lies outside the model family — no detection efficiency and no finite rank reproduces it exactly — the channel-composed model fitted blind exceeds a full-rank MLE run under the pre-declared 900-second baseline budget, a verdict that holds across all five pre-declared seed and noise configurations. We do not claim a universally superior method: comparisons on real data reuse observations across splits, the strongest baseline is test-selected, and the blind result covers one target class. The contribution is a compact, physically constrained model family together with a fully falsification-first research record — negative results, superseded scorings, and pre-declared protocols are all preserved in the accompanying repository.
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.
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.
The Gottesman-Kitaev-Preskill (GKP) encoding is a top contender among bosonic codes for fault-tolerant quantum computation. However, analysis of the code is complicated by the fact that finite-energy code states leak out of the ideal GKP code space and are not orthogonal. We analyze a variant of the GKP stabilizer measurement circuit that virtually projects onto the ideal GKP code space between rounds of error correction, even when damped, finite-energy GKP states are used. This allows us to identify logical maps between projectors; however, due to finite-energy effects, these maps fail to resolve completely positive, trace-preserving (CPTP) channels on the logical GKP code space. We present two solutions to this problem based on channel twirling the damping operator. The first uses symmetries of standard binning (SB) decoding to passively twirl over the full stabilizer group. Doing so converts small amounts of damping into stochastic Gaussian random noise (GRN). The second uses active twirling over a minimal set of representative Pauli shifts that keeps the energy in the code finite and allows for arbitrary decoding. This approach is not limited to small damping and allows the study of decoding more general than SB, which can be optimized to the noise in the circuit. Focusing on damping, we compare decoding strategies tailored to different levels of effective squeezing. While our results indicate that SB decoding is suboptimal for finite-energy GKP states, we observe that the advantage of optimized decoding shrinks as the energy in the code increases. Moreover, the performance of both decoding strategies converges to that of the stabilizer-twirled GRN logical channel. These studies provide stronger arguments for two commonplace procedures in the analysis of GKP error correction in the fault-tolerance regime:
(i) using stochastically shifted GKP states in place of coherently damped ones, and
(ii) the use of SB decoding.
I examine whether a noisy fixed-parameter quantum front end preserves class information from input data before variational optimization. Only the input vector
x is encoded; the label is used after circuit execution to estimate training distributions and score disjoint held-out inputs. The main density-matrix grid contains 10,800 directly simulated configurations over two binary tasks, widths
n∈{2,3,4} , every integer depth
L=1,…,12 , five depolarizing strengths, and 30 circuit seeds. At
n=4 , mean held-out mutual information has a finite-depth maximum that shifts from
L=6 to 5 for Gaussian data and from
L=7 to 6 for the Wisconsin Diagnostic Breast Cancer (WDBC) benchmark as
p increases from 0 to 0.04. In five-fold complete-seed validation, including training-distribution mutual information with declared design variables raises held-out-accuracy
R2 from 0.724 to 0.961 for Gaussian data and from 0.714 to 0.860 for WDBC. Training total variation is the stronger binary comparator in complete-seed validation; test-set total variation is reported only as a non-deployable post-outcome oracle. Paired seed-level RMSE improvements from mutual information are 0.0185 (95% bootstrap interval 0.0179–0.0190) and 0.00634 (0.00592–0.00675), and finite-shot training estimates retain most of that gain. Twenty independently seeded Gaussian realizations, twenty repeated WDBC partitions, per-input 256-shot tests, and explicit rotation-schedule ablations expose both transfer and limitations. A family-matched damped-alignment response outperforms an equal-parameter-count polynomial comparator under identical grouped folds but transfers weakly to some widths, encodings, and schedules. Explicit local-folding zero-noise extrapolation and tensor-product measurement-error mitigation improve information and held-out likelihood accuracy in selected simulated budgets; small-cluster sensitivity and failure cases are retained. The accompanying reproducibility archive contains the complete source, raw counts, parameter registries, 2,000-replicate bootstrap vectors, mitigation replicates, automated tests, and resumable one-click workflow. I make no hardware, trained-VQNN, clinical, quantum-advantage, or universal-scaling claim.