Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction
Abstract
Approximate quantum error correction (AQEC) extends the framework of discrete- and continuous-variable quantum error correction beyond the Knill-Laflamme (KL) conditions, where the recovery performance is quantified by entanglement fidelity. Recent studies have enabled efficient evaluation of near-optimal entanglement fidelity using transpose-channel recovery. Yet, determining the global optimal recovery map and its entanglement fidelity for general codes beyond the KL conditions remains a major computational challenge. Direct optimization becomes prohibitive as the number of noise Kraus operators grows rapidly with system size, and existing approaches lack rigorous guarantees for reducing this optimization to a tractable dimension. Here, we derive an explicit characterization of the optimal environmental state of complement channel, which transforms the optimization over recovery channels into an equivalent optimization over quotient unitaries. For a broader class of codes that satisfy only the orthogonality part of the KL conditions, we show that the optimal recovery map admits an explicit analytical form. Building on this form, we derive novel rigorous lower bounds of entanglement fidelity that strictly improve upon the transpose-recovery bound. We further develop a novel recovery strategy based on principle components, and derive a rigorous bound on the error introduced by noise truncation. Our approach enables efficient searches for approximate recovery maps for AQEC codes, avoiding the need to optimize over the full Kraus-operator space.
Related
- Universal recovery in approximate quantum error correction
- High-Rank Encoding Can Improve Approximate Quantum Error Correction
- Petz Recovery through a Single Polar Transformation for Approximate Quantum Error Correction
- Quantum thermalization achieves optimal approximate quantum error correction
- Composable logical gate error in approximate quantum error correction: reexamining gate implementations in Gottesman-Kitaev-Preskill codes
BibTeX
@misc{wu2026universal,
title = {{Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction}},
author = {Jing Wu and Michele Grossi and Doga Kurkcuoglu and Silvia Zorzetti},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2607.24968},
eprint = {2607.24968},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2607.24968},
}
RIS
TY - UNPB
TI - Universal Optimization and Tighter Fidelity Bounds for Approximate Quantum Error Correction
AU - Jing Wu
AU - Michele Grossi
AU - Doga Kurkcuoglu
AU - Silvia Zorzetti
PY - 2026
DA - 2026/09/02
PB - arXiv
DO - 10.48550/arxiv.2607.24968
UR - https://arxiv.org/abs/2607.24968
AB - Approximate quantum error correction (AQEC) extends the framework of discrete- and continuous-variable quantum error correction beyond the Knill-Laflamme (KL) conditions, where the recovery performance is quantified by entanglement fidelity. Recent studies have enabled efficient evaluation of near-optimal entanglement fidelity using transpose-channel recovery. Yet, determining the global optimal recovery map and its entanglement fidelity for general codes beyond the KL conditions remains a major computational challenge. Direct optimization becomes prohibitive as the number of noise Kraus operators grows rapidly with system size, and existing approaches lack rigorous guarantees for reducing this optimization to a tractable dimension. Here, we derive an explicit characterization of the optimal environmental state of complement channel, which transforms the optimization over recovery channels into an equivalent optimization over quotient unitaries. For a broader class of codes that satisfy only the orthogonality part of the KL conditions, we show that the optimal recovery map admits an explicit analytical form. Building on this form, we derive novel rigorous lower bounds of entanglement fidelity that strictly improve upon the transpose-recovery bound. We further develop a novel recovery strategy based on principle components, and derive a rigorous bound on the error introduced by noise truncation. Our approach enables efficient searches for approximate recovery maps for AQEC codes, avoiding the need to optimize over the full Kraus-operator space.
ER -