Abstract Isoclinic subspaces have been studied for over a century. Quantum error correcting codes were recently shown to define a subclass of families of isoclinic subspaces. The Knill–Laflamme theorem is a seminal result in the theory of quantum error correction, a central topic in quantum information. We show there is a generalized version of the Knill–Laflamme result and conditions that applies to all families of isoclinic subspaces. In the case of quantum stabilizer codes, the expanded conditions are shown to capture logical operators. We apply the general conditions to give a new perspective on a classical subclass of isoclinic subspaces defined by the graphs of anti-commuting unitary operators. We show how the result applies to recently studied mutually unbiased quantum measurements (MUMs), and we give a new construction of such measurements motivated by the approach.
Abstract Isoclinic subspaces have been studied for over a century. Quantum error correcting codes were recently shown to define a subclass of families of isoclinic subspaces. The Knill–Laflamme theorem is a seminal result in the theory of quantum error correction, a central topic in quantum information. We show there is a generalized version of the Knill–Laflamme result and conditions that applies to all families of isoclinic subspaces. In the case of quantum stabilizer codes, the expanded conditions are shown to capture logical operators. We apply the general conditions to give a new perspective on a classical subclass of isoclinic subspaces defined by the graphs of anti-commuting unitary operators. We show how the result applies to recently studied mutually unbiased quantum measurements (MUMs), and we give a new construction of such measurements motivated by the approach.
This thesis studies the classical notion of canonical angles to explore isoclinic subspaces on a complex inner product space and equivalent conditions are developed for a set of subspaces to be isoclinic. A connection between isoclinic subspaces and quantum error correction will be identified. We will show that every quantum error correcting code is associated with a family of isoclinic subspaces and a partial converse for pairs of such subspaces will be proved. It will also be shown how the canonical angles for isoclinic subspaces arise in the structure of the higher rank numerical ranges of the corresponding orthogonal projections. An examination of how this connection could be used to fuel other ideas in quantum error correction and quantum information theory in general will be discussed to conclude this work.
This paper addresses and expands on the contents of the recent Letter [Phys. Rev. Lett. 111, 030502 (2013)] discussing private quantum subsystems. Here we prove several previously presented results, including a condition for a given random unitary channel to not have a private subspace (although this does not mean that private communication cannot occur, as was previously demonstrated via private subsystems) and algebraic conditions that characterize when a general quantum subsystem or subspace code is private for a quantum channel. These conditions can be regarded as the private analog of the Knill-Laflamme conditions for quantum error correction, and we explore how the conditions simplify in some special cases. The bridge between quantum cryptography and quantum error correction provided by complementary quantum channels motivates the study of a new, more general definition of quantum error-correcting code, and we initiate this study here. We also consider the concept of complementarity for the general notion of a private quantum subsystem.
Quantum error correction (QEC) is essential for protecting quantum information against noise, yet understanding the structure of the Knill-Laflamme (KL) coefficients {λij} from the condition PEi†EjP=λijP remains challenging, particularly for nonadditive codes. In this work, we introduce the signature vector λ(P) , composed of the off-diagonal KL coefficients {λij} , where each coefficient corresponds to equivalence classes of errors counted only once. We define its Euclidean norm λ * ( P ) as a scalar measure representing the total strength of error correlations within the code subspace defined by the projector P . We parameterize P on a Stiefel manifold and formulate an optimization problem based on the KL conditions to systematically explore possible values of λ * . Moreover, we show that, for (( n , K , d )) codes, λ * is invariant under local unitary transformations. Applying our approach to the ((6, 2, 3)) quantum code, we find that λmin∗=0.6 and λmax∗=1 , with λ * = 1 corresponding to a known degenerate stabilizer code. We construct continuous families of new nonadditive codes parameterized by vectors in R5 , with λ * varying over the interval [0.6,1] . For the ((7, 2, 3)) code, we identify λmin∗=0 (corresponding to the non-degenerate Steane code) and λmax∗=7 (corresponding to the permutation-invariant code by Pollatsek and Ruskai), and we demonstrate continuous paths connecting these extremes via cyclic codes characterized solely by λ * . Our findings provide new insights into the structure of quantum codes, advance the theoretical foundations of QEC, and open new avenues for investigating intricate relationships between code subspaces and error correlations.
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.
We exhibit equivalent conditions for subspaces of an inner product space to be isoclinic, including a characterization based on the classical notion of canonical angles. We identify a connection with quantum error correction, showing that every quantum error correcting code is associated with a family of isoclinic subspaces, and we prove a converse for pairs of such subspaces. We also show how the canonical angles for isoclinic subspaces arise in the structure of the higher rank numerical ranges of the corresponding orthogonal projections.
We discuss the connection between quantum error-correcting codes (QECCS) and algebraic coding theory. We start with an introduction to the relevant concepts of quantum mechanics, including the general error model. A quantum error-correcting code is a subspace of a complex Hilbert space, and its error-correcting properties are characterized by the Knill-Laflamme conditions. Using the stabilizer formalism, we illustrate how QECCs for can be constructed using techniques from algebraic coding theory. We also sketch how the information obtained via a quantum measurement can be interpreted as syndrome of the related classical code. Additionally, we present secondary constructions for QECCs, leading to propagation rules for the parameters of QECCs. This includes the puncture code by Rains and construction X for quantum codes.