Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes

@misc{wadewitz2026probabilistic,
  title = {{Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes}},
  author = {Victoria Wadewitz and Alessandro Ciani},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.17095},
  eprint = {2609.17095},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.17095},
}

TY  - UNPB
TI  - Probabilistic Error Cancellation for Single-Mode Gottesman-Kitaev-Preskill Codes
AU  - Victoria Wadewitz
AU  - Alessandro Ciani
PY  - 2026
DA  - 2026/09/15
PB  - arXiv
DO  - 10.48550/arxiv.2609.17095
UR  - https://arxiv.org/abs/2609.17095
AB  - 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.
ER  -