Composable logical gate error in approximate quantum error correction: reexamining gate implementations in Gottesman-Kitaev-Preskill codes
- 1Department of Mathematics, School of Computation, Information and Technology, Technical University of Munich, 85748 Garching, Germany
- 2Munich Center for Quantum Science and Technology, 80799 Munich, Germany
Abstract
Quantifying the accuracy of logical gates is paramount in approximate error correction, where perfect implementations are often unachievable with the available set of physical operations. To this end, we introduce a single scalar quantity we call the (composable) logical gate error. It captures both the deviation of the logical action from the desired target gate as well as leakage out of the code space. It is subadditive under successive application of gates, providing a simple means for analyzing circuits. We show how to bound the composable logical gate error in terms of matrix elements of physical unitaries between (approximate) logical computational basis states. In the continuous-variable context, this sidesteps the need for computing energy-bounded norms. As an example, we study the composable logical gate error for linear optics implementations of Paulis and Cliffords in approximate Gottesman-Kitaev-Preskill (GKP) codes. We find that the logical gate error for implementations of Paulis depends linearly on the squeezing parameter. This implies that their accuracy improves monotonically with the amount of squeezing. For some Cliffords, however, linear optics implementations which are exact for ideal GKP codes fail in the approximate case: they have a constant logical gate error even in the limit of infinite squeezing. This is consistent with previous results about the limitations of certain gate implementations for approximate GKP codes. It shows that findings applicable to ideal GKP codes do not always translate to the realm of physically realizable approximate GKP codes.
Related
- Gottesman-Kitaev-Preskill error-correction with decohered resources
- High-Rank Encoding Can Improve Approximate Quantum Error Correction
- Petz Recovery through a Single Polar Transformation for Approximate Quantum Error Correction
- Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction
- Universal recovery in approximate quantum error correction
BibTeX
@article{brenner2026composable,
title = {{Composable logical gate error in approximate quantum error correction: reexamining gate implementations in Gottesman-Kitaev-Preskill codes}},
author = {Lukas Brenner and Beatriz Dias and Robert Koenig},
journal = {Quantum},
year = {2026},
month = oct,
doi = {10.22331/q-2026-10-08-2230},
url = {https://quantum-journal.org/papers/q-2026-10-08-2230/},
note = {CC BY 4.0},
}
RIS
TY - JOUR
TI - Composable logical gate error in approximate quantum error correction: reexamining gate implementations in Gottesman-Kitaev-Preskill codes
AU - Lukas Brenner
AU - Beatriz Dias
AU - Robert Koenig
PY - 2026
DA - 2026/10/08
JO - Quantum
DO - 10.22331/q-2026-10-08-2230
UR - https://quantum-journal.org/papers/q-2026-10-08-2230/
AB - Quantifying the accuracy of logical gates is paramount in approximate error correction, where perfect implementations are often unachievable with the available set of physical operations. To this end, we introduce a single scalar quantity we call the (composable) logical gate error. It captures both the deviation of the logical action from the desired target gate as well as leakage out of the code space. It is subadditive under successive application of gates, providing a simple means for analyzing circuits. We show how to bound the composable logical gate error in terms of matrix elements of physical unitaries between (approximate) logical computational basis states. In the continuous-variable context, this sidesteps the need for computing energy-bounded norms. As an example, we study the composable logical gate error for linear optics implementations of Paulis and Cliffords in approximate Gottesman-Kitaev-Preskill (GKP) codes. We find that the logical gate error for implementations of Paulis depends linearly on the squeezing parameter. This implies that their accuracy improves monotonically with the amount of squeezing. For some Cliffords, however, linear optics implementations which are exact for ideal GKP codes fail in the approximate case: they have a constant logical gate error even in the limit of infinite squeezing. This is consistent with previous results about the limitations of certain gate implementations for approximate GKP codes. It shows that findings applicable to ideal GKP codes do not always translate to the realm of physically realizable approximate GKP codes.
SN - 2521-327X
ER -