Knill-Laflamme coefficients characterize exact quantum error detection through scalar compressions of error operators to the code space. For prescribed Pauli observables and a fixed code dimension, attainable coefficient vectors form a joint higher-rank numerical range, whose Euclidean norm image is the signature spectrum. We study how operator representation, code dimension, and detection constraints govern this geometry. Our main theorem identifies representation multiplicity as sufficient to lift active expectation data to exact scalar compressions: a lift exists whenever each occupied block has multiplicity at least the code dimension times the rank of the corresponding active state. When multiplicity suffices to realize all active states, the coefficient range is the full active expectation body and is therefore convex and connected, with a closed interval as its signature spectrum. This framework unifies commuting Pauli families, where sufficient common-eigenspace degeneracy yields polytopes, and subsystem stabilizer codes, where protected logical subsystems supply multiplicity spaces for noncommuting gauge observables. Explicit examples show how increasing the code dimension can make a range shrink, collapse, or become empty, while increasing multiplicity can turn a Bloch sphere into a filled ball. In the subsystem setting, parent-Hamiltonian constructions realize exact detecting codes as degenerate ground spaces, selecting distinguished vectors and continuous paths within these ranges. A final three-qubit example shows additional noncommuting detection constraints reduce a tetrahedral range to its barycenter and four vertices, producing a disconnected signature spectrum. The results provide a structural framework for Knill-Laflamme coefficient geometry and motivate sharper criteria for connected coefficient ranges and interval signature spectra under structured error models.
Knill-Laflamme coefficients characterize exact quantum error detection through scalar compressions of error operators to the code space. For prescribed Pauli observables and a fixed code dimension, attainable coefficient vectors form a joint higher-rank numerical range, whose Euclidean norm image is the signature spectrum. We study how operator representation, code dimension, and detection constraints govern this geometry. Our main theorem identifies representation multiplicity as sufficient to lift active expectation data to exact scalar compressions: a lift exists whenever each occupied block has multiplicity at least the code dimension times the rank of the corresponding active state. When multiplicity suffices to realize all active states, the coefficient range is the full active expectation body and is therefore convex and connected, with a closed interval as its signature spectrum. This framework unifies commuting Pauli families, where sufficient common-eigenspace degeneracy yields polytopes, and subsystem stabilizer codes, where protected logical subsystems supply multiplicity spaces for noncommuting gauge observables. Explicit examples show how increasing the code dimension can make a range shrink, collapse, or become empty, while increasing multiplicity can turn a Bloch sphere into a filled ball. In the subsystem setting, parent-Hamiltonian constructions realize exact detecting codes as degenerate ground spaces, selecting distinguished vectors and continuous paths within these ranges. A final three-qubit example shows additional noncommuting detection constraints reduce a tetrahedral range to its barycenter and four vertices, producing a disconnected signature spectrum. The results provide a structural framework for Knill-Laflamme coefficient geometry and motivate sharper criteria for connected coefficient ranges and interval signature spectra under structured error models.
Exact quantum codes detecting a prescribed set of Pauli errors are approached through algebraic constructions--stabilizer, codeword-stabilized, permutation-invariant, topological, and related families. Geometrically, exact Pauli detection is governed by joint higher-rank numerical ranges of these Pauli operators, whose structure for rank ≥2 is largely uncharted. From this viewpoint, we show that such codes often form connected continuous families rather than collections of disjoint solution regions. These families are characterized by a single scalar derived from the Knill-Laflamme conditions: denoted λ∗, it is the Euclidean norm of the signature vector of Pauli expectation values on the maximally mixed code state, and provides a one-parameter summary of the code's joint Pauli variance profile. Within these continuous landscapes, stabilizer codes occupy only discrete, measure-zero subsets of the attainable λ∗-spectrum, exposing a largely unexplored continuum of genuinely nonadditive exact codes. We establish this picture by analyzing the geometry of higher-rank operator compressions, and extend it to symmetry-restricted settings where cyclic and permutation symmetries are imposed on both the error model and the code projector. Small-system cases reveal interval, singleton, and empty regimes through eigenvalue interlacing and symmetry-sector decompositions; larger systems are treated numerically via Stiefel-manifold optimization and symmetry-adapted parameterizations. In every unrestricted and symmetry-compatible case analyzed, the attainable λ∗-spectrum forms a single closed interval whenever nonempty--although a general proof remains open. These results place stabilizer, symmetric, and nonadditive code families within a unified higher-rank variance framework, suggesting a continuous geometric perspective on the landscape of exact quantum codes.
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 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.
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 introduce an intrinsic formulation of quantum error correction based on representation theory, in which error-protection structure is encoded directly in a unitary group representation, rather than being tied to a particular embedding into a larger Hilbert space. In this framework, error models are classified according to the isotypic decomposition of the conjugation action on the operator algebra.
Our main result, the \emph{Schur bootstrap}, shows that if an intrinsic code satisfies the Knill--Laflamme conditions on a given symmetry sector, then the same error-protection relations hold for every extrinsic realization obtained from a group-equivariant isometric embedding into a larger Hilbert space. Thus a single intrinsic verification certifies the corresponding symmetry-resolved error-correction conditions across an entire family of physical realizations.
We further introduce an intrinsic notion of distance, called depth, defined via adjoint order. For standard multi-qudit systems this coincides with conventional code distance, while for more general representations it refines the usual weight-based notion. We also prove an intrinsic Eastin--Knill theorem: any intrinsic code of depth at least two has a discrete logical symmetry group, with the obstruction to continuous covariant gates arising from the representation-theoretic structure of the adjoint action.
We illustrate the framework with several examples, including a minimal SU(2) construction that unifies permutation-invariant qubit codes and bosonic codes, and higher-dimensional constructions exhibiting transversal Clifford symmetries and realizations beyond qubit systems.
We develop a holomorphic representation of quantum error correction codes (QECCs) within the Segal--Bargmann space. By encoding qubits into Schwinger boson modes (zaj,zbj) subject to a degree-one homogeneity constraint, we derive closed-form differential operator representations for stabilizers, syndrome extraction, and recovery for fundamental codes (three-, five-, seven-, and nine-qubit codes). Quantum errors are characterized as holomorphic perturbations violating this constraint, while syndrome measurement projects onto eigenspaces of commuting differential operators. Restricting to unit-magnitude variables (∣z∣=1) reveals a toroidal space $\T^{2n}$ where error syndromes manifest as discrete translations in winding number space Z2n, and recovery acts as Hamiltonian flows restoring the winding configuration. In the full Segal--Bargmann space, the code space is a holomorphic submanifold of $\CP^{2^n-1}$, with correctable errors as transverse normal directions. Consequently, the Knill--Laflamme condition becomes a Fubini--Study orthogonality condition between the code submanifold and its error-translated images. Topological protection emerges from the U(1)n fiber bundle structure: global phase noise along fibers is unobservable, while base-space errors require active correction. Finally, we establish a path-integral formulation for semiclassical error correction dynamics and show that geometric entanglement via the Segre embedding naturally quantifies code distance. This framework unifies algebraic, geometric, and topological perspectives on fault-tolerant quantum protocols.