Curator's Take
AI Commentary
This article demonstrates how probabilistic error cancellation can be layered on top of Gottesman‑Kitaev‑Preskill (GKP) error correction, providing a concrete quantitative analysis of the sampling overheads required for both square and hexagonal GKP lattices. By comparing Steane‑type and teleportation‑based decoding under realistic finite‑squeezing noise, it shows that mitigation can meaningfully boost logical gate fidelity even when full fault tolerance is not yet achievable—a key step toward practical continuous‑variable quantum processors. The results give experimentalists a clear benchmark for how much extra classical sampling is needed to trade off hardware imperfections against algorithmic performance in near‑term devices.
— Mark Eatherly
Summary
In order to solve practical problems on a quantum computer, it is necessary to use fault-tolerant quantum error correction schemes to overcome noise: the errors arising from imperfections in physical components. The Gottesman-Kitaev-Preskill (GKP) code aims at achieving this in a hardware efficient manner by encoding finite-dimensional logical subspaces in the Hilbert space of one or more continuous variable modes. In near term implementations, however, it is not feasible to eliminate errors entirely, so it is natural to also employ alternative error mitigation techniques together with error correction. In this work, we study a quantum error mitigation method known as probabilistic error cancellation in the context of the GKP code. We compare Steane-type and teleportation-based GKP error correction, and calculate the sampling overheads associated with the technique for square and hexagonal GKP codes. We employ the stabilizer subsystem decomposition for GKP codes to obtain an effective logical channel for noisy operations that is used to express the ideal one of a target logical unitary. We consider noise from finite squeezing on the data and the two ancilla modes, needed for error correction, and examine the relationship between the sampling overhead and the noise for different decoding methods. Our results are calculated for single- and two-qubit GKP Clifford gates and one round of error correction, and show the nontrivial combination of error correction and mitigation in continuous variable codes.