Variance Geometry of Exact Pauli-Detecting Codes: Continuous Landscapes Beyond Stabilizers

2026-04-23

AI Summary

This study investigates the geometric structure of quantum codes capable of precisely detecting prescribed Pauli errors within the framework of high-rank joint numerical ranges, with a focus on the existence and continuity of non-stabilizer, non-additive codes. By analyzing the joint variance geometry of Pauli operators over the code subspace, the work introduces a scalar parameter λ* to characterize variance profiles. Combining techniques from high-rank operator compression, symmetry decomposition, Stiefel manifold optimization, and symmetry-adapted parametrization, it establishes for the first time that such quantum codes form continuous closed intervals in the λ* spectrum rather than discrete point sets, with stabilizer codes emerging only as measure-zero special cases. This result opens a new geometric perspective for the systematic study of non-additive quantum codes.

Technology Category

• Machine Learning: Quantum Machine Learning
• Search and Optimization: Non-convex Optimization
• Reasoning under Uncertainty: Stochastic Optimization

Application Category

• Graph Algorithms and Modeling for the Web: Algorithms and analysis for incomplete, noisy, or partially observed Web-related graphs
• Security and Privacy: Large-scale security measurements
• Economics, Online Markets and Human Computation: Data quality aspects of human-annotated datasets

Abstract

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 $\geq 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.

Problem

• Pauli-detecting codes
• higher-rank numerical ranges
• quantum error correction
• nonadditive codes
• variance geometry

Innovation

• higher-rank numerical range
• continuous code families
• nonadditive quantum codes
• Pauli error detection
• variance geometry