Fidelity-based distance bounds for -qubit approximate quantum error correction
arXiv:2212.04368 · doi:10.1103/PhysRevA.107.032422
Abstract
The Eastin-Knill theorem is a central result of quantum error correction theory and states that a quantum code cannot correct errors exactly, possess continuous symmetries, and implement a universal set of gates transversely. As a way to circumvent this result, there are several approaches in which one gives up on either exact error correction or continuous symmetries. In this context, it is common to employ a complementary measure of fidelity as a way to quantify quantum state distinguishability and benchmark approximations in error correction. Despite having useful properties, evaluating fidelity measures stands as a challenging task for quantum states with a large number of entangled qubits. With that in mind, we address two distance measures based on the sub- and superfidelities as a way to bound error approximations, which in turn require a lower computational cost. We model the lack of exact error correction to be equivalent to the action of a single dephasing channel, evaluate the proposed fidelity-based distances both analytically and numerically, and obtain a closed-form expression for a general -qubit quantum state. We illustrate our bounds with two paradigmatic examples, an -qubit mixed GHZ state and an -qubit mixed state.
12 pages, 6 figures. Close to published version
References in corpus (12)
- Reference frames, superselection rules, and quantum information
- Restrictions on Transversal Encoded Quantum Gate Sets
- The resource theory of quantum reference frames: manipulations and monotones
- Fault-tolerant logical gates in quantum error-correcting codes
- Alternative fidelity measure for quantum states
- Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem
- New perspectives on covariant quantum error correction
- Optimal approximate quantum error correction for quantum metrology
- Near-optimal covariant quantum error-correcting codes from random unitaries with symmetries
- Bound on trace distance based on superfidelity
- Information Geometry Aspects of Minimum Entropy Production Paths from Quantum Mechanical Evolutions
- Complexity and efficiency of minimum entropy production probability paths from quantum dynamical evolutions