By interpreting the well-known, qualitative criteria for the existence of quantum error correction (QEC) codes by Knill and Laflamme from a quantitative perspective, we propose a figure of merit for assessing a QEC scheme based on the average fidelity between codewords. This enables us to quantify the performance of a protocol as a whole, including errors beyond the correctable set. Various examples are calculated for photonic qubit codes dealing with the experimentally relevant case of photon loss, demonstrating the advantages of the new measure. In the context of continuous-variable QEC, our codeword-overlap measure can be used to reproduce, in a different way with no need for calculating entanglement measures, a previous result concerning the impossibility of improving transmission of Gaussian states through Gaussian channels via Gaussian operations alone.
By interpreting the well-known, qualitative criteria for the existence of quantum error correction (QEC) codes by Knill and Laflamme from a quantitative perspective, we propose a figure of merit for assessing a QEC scheme based on the average fidelity between codewords. This enables us to quantify the performance of a protocol as a whole, including errors beyond the correctable set. Various examples are calculated for photonic qubit codes dealing with the experimentally relevant case of photon loss, demonstrating the advantages of the new measure. In the context of continuous-variable QEC, our codeword-overlap measure can be used to reproduce, in a different way with no need for calculating entanglement measures, a previous result concerning the impossibility of improving transmission of Gaussian states through Gaussian channels via Gaussian operations alone.
We reexamine a non-Gaussian quantum error-correction code designed to protect optical coherent-state qubits against errors due to an amplitude-damping channel. We improve on a previous result [R. Wickert, N. K. Bernardes, and P. van Loock, Phys. Rev. A 81, 062344 (2010)] by providing a tighter upper bound on the performance attained when considering realistic assumptions, which constrain the operation of the gates employed in the scheme. The quantitative characterization is performed through measures of fidelity and concurrence, the latter obtained by employing the code as an entanglement distillation protocol. We find that, when running the code in fully deterministic error-correction mode, direct transmission can only be beaten for certain combinations of channel and input state parameters. In contrast, in error-detection mode, the usage of higher repetition encodings remains beneficial throughout, however, at the expense of diminishing success probabilities.
We develop a theory of approximate quantum error correction (QEC) based on the error-set model, complemented by general methods for code construction. Exact QEC has a powerful error-set structure: by the Knill-Laflamme conditions, a code correcting a given error set automatically protects against every channel whose Kraus operators lie in their linear span. This linearity gives rise to code distance, the equivalence between erasures and general errors, and a theory of asymptotically good codes. A longstanding view has been that these features do not extend to AQEC, leaving the theory essentially channel-by-channel. We show instead that, although full Knill--Laflamme linearity fails, a restricted form survives and suffices to extend all three structural features to the approximate setting. Specifically, a common error-set criterion governs families of channels whose Kraus operators are linear combinations of a given error set and whose coefficient matrices satisfy a spectral constraint. Using the Bény-Oreshkov worst-case and Petz average-case frameworks, we derive uniform fidelity guarantees for these families in terms of two new code parameters--the \emph{environment-leakage distance}, controlling worst-case performance, and the \emph{Knill-Laflamme Hellinger distance}, characterizing the average-case performance of Petz recovery.
To demonstrate the scope of this model, we develop partition-based constructions across diverse quantum systems and geometries, placing exact and approximate correction on equal footing. These constructions lead to a metric--error alignment hierarchy for Hilbert spaces, metrics, and error families, which in turn characterizes the resulting recovery guarantees. They yield the first known asymptotically good code families for fermionic systems, one-dimensional Rydberg-blockaded systems, and deletion errors, and extend to other physical platforms.
Quantum information processing promises exponential advantages for certain computational and communication tasks, but practical quantum devices are inherently vulnerable to decoherence and operational imperfections. This thesis develops new algebraic and analytical tools for quantum error correction (QEC) aimed at unifying entanglement-assisted coding theory with operator-algebra frameworks, while also providing mathematically rigorous insights for continuous-variable photonic implementations. First, we introduce the framework of entanglement-assisted operator algebra quantum error correction (EA-OAQEC), extending entanglement-assisted QEC in an operator-algebra context. Built on a stabilizer-based formalism, EA-OAQEC unifies and generalizes subspace, subsystem, and hybrid classical-quantum entanglement-assisted codes. We establish a master error-correction theorem, define a generalized distance notion, and develop constructive techniques including gauge fixing, clean-qubit transformations, and entanglement-assisted gauge-fixing procedures. Second, we study general logical operators: unitaries that preserve a stabilizer codespace beyond the traditional Pauli normalizer. We derive explicit structure theorems for the centralizer and normalizer in the full unitary setting and show how normalizer transformations can be parameterized via classical bit matrix multiply complement (BMMC) permutations. Finally, motivated by photonic quantum computing, we analyze finite-rank compressions of the continuous position and momentum operators relevant to Gottesman-Kitaev-Preskill (GKP) codes. We prove that the spectra of these compressions are governed by the roots of classical Hermite polynomials and connect the compressed operators to physically realizable approximations of displacement operations and finite-energy GKP states.
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 N-qubit quantum state. We illustrate our bounds with two paradigmatic examples, an N-qubit mixed GHZ state and an N-qubit mixed W state.
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.
The Knill-Laflamme conditions distinguish exact quantum error correction codes, and they have played a critical role in the discovery of state-of-the-art codes. However, the family of exact codes is a very restrictive one and does not necessarily contain the best-performing codes. Therefore, it is desirable to develop a generalized and quantitative performance metric. In this Letter, we derive the near-optimal channel fidelity, a concise and optimization-free metric for arbitrary codes and noise. The metric provides a narrow two-sided bound to the optimal code performance, and it can be evaluated with exactly the same input required by the Knill-Laflamme conditions. We demonstrate the numerical advantage of the near-optimal channel fidelity through multiple qubit code and oscillator code examples. Compared to conventional optimization-based approaches, the reduced computational cost enables us to simulate systems with previously inaccessible sizes, such as oscillators encoding hundreds of average excitations. Moreover, we analytically derive the near-optimal performance for the thermodynamic code and the Gottesman-Kitaev-Preskill code. In particular, the Gottesman-Kitaev-Preskill code's performance under excitation loss improves monotonically with its energy and converges to an asymptotic limit at infinite energy, which is distinct from other oscillator codes.