Dresden 2026 – scientific programme

Parts | Days | Selection | Search | Updates | Downloads | Help

QI: Fachverband Quanteninformation

QI 16: Quantum Software

QI 16.4: Talk

Thursday, March 12, 2026, 10:30–10:45, BEY/0245

Probabilistic error cancellation for single-mode Gottesman-Kitaev-Preskillev-Preskill codes — Alessandro Ciani¹ and •Victoria Wadewitz^1,2 — ¹Institute for Quantum Computing Analytics (PGI-12), Forschungszentrum Jülich, 52425 Jülich, Germany — ²Theoretical Physics, Universität des Saarlandes, 66123 Saarbrücken, Germany

To solve practical problems on a quantum computer, fault-tolerant quantum error correction schemes are necessary to overcome noise from imperfections in physical components. The Gottesman-Kitaev-Preskill (GKP) code achieves this by encoding finite-dimensional logical space within the continuous variables of bosonic modes, offering a pathway to scalable, fault-tolerant quantum computing. However, it is not feasible to eliminate errors entirely, so they must be mitigated. In this work, we study a quantum error mitigation method known as probabilistic error cancellation (PEC) in the context of GKP codes. We compare Steane-type and teleportation-based GKP error correction, and calculate sampling overheads for square and hexagonal GKP codes. The PEC sampling probabilities are derived using a stabilizer subsystem decomposition for GKP codes. Considering noise from finite squeezing of the data and the two ancilla modes, as well as other contributions like pure loss and Gaussian random displacement, we examine the relationship between the overhead and the noise. Our results cover single- and two-GKP-qubit Clifford gates. Preliminary analysis suggests that, when combined with error mitigation techniques, teleportation-based GKP error correction outperforms Steane-type GKP error correction.

Keywords: GKP code; Quantum Error Correction; Quantum Error Mitigation; Probabilistic Error Cancellation