Fidelity Determines the Minimum Error of Quantum Recovery
quant-ph
Submitted: 2026-11-05
Updated: 2026-11-05
Comments: 34 pages, 2 figures; includes Supplemental Material
License: http://creativecommons.org/licenses/by/4.0/
The gist: Even a recovery that maximizes worst-input entanglement fidelity can retain avoidable errors in subsequent measurements.
Terminology
Abstract
Even a recovery that maximizes worst-input entanglement fidelity can retain avoidable errors in subsequent measurements. Entanglement fidelity is the probability of passing a test of whether the state and its entanglement were preserved; infidelity is the probability of failing it. Operational error is the largest possible change in any measurement probability, quantified by the normalized diamond distance. For every finite-dimensional noise channel and fixed encoding, we prove that operational error and worst-input entanglement infidelity have the same minimum over all recovery operations. The proof constructs one final unitary (a reversible quantum operation) that makes any recovery's operational error no greater than its original worst-input entanglement infidelity. With a retained noise record, we determine the optimal error and characterize all optimal decoders subject to a Kraus-rank limit for each outcome. For a fixed decoded channel, a semidefinite program finds the optimal final unitary in the low-error regime. We characterize all optimal final corrections and show that, at a fixed error floor 0<ε<1, the operational optimizers' sensitivity to residual unitary errors of size s is at worst of order s 4/3, while the canonical polar correction has quadratic sensitivity.
Sources
- Sending quantum entanglement through noisy channels
- General conditions for approximate quantum error correction and near-optimal recovery channels
- Approximate simulation of quantum channels
- Cryptographic Distinguishability Measures for Quantum Mechanical States
- The Information-Disturbance Tradeoff and the Continuity of Stinespring's Representation
- Comparing Experiments to the Fault-Tolerance Threshold
- Quantifying the performance of approximate teleportation and quantum error correction via symmetric two-PPT-extendibility
- Physical time-energy cost of a quantum process determines its information fidelity
- A polar decomposition for quantum channels (with applications to bounding error propagation in quantum circuits)
- A simple formula for the average gate fidelity of a quantum dynamical operation
- Product theorems via semidefinite programming
- Quantum-Inspired Hierarchy for Rank-Constrained Optimization
- A Class of Quantum Error-Correcting Codes Saturating the Quantum Hamming Bound
Related papers
- Computational regimes in matrix-product-state-based quantum trajectory simulations
- Toward chemically accurate quantum simulations on quantum hardware: A quantum-HPC hybrid approach
- Transversal surface-code game with reconfigurable qubits
- Fulqrum: a generalized framework for quantum subspace diagonalization
- Flux-Activated Resonant Control of a Bosonic Quantum Memory
- Machine learning the effects of many quantum measurements