Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1205.4517 · ProQuest LLC eBooks

Codes in W\ast-metric Spaces: Theory and Examples

Christopher J. Bumgardner

Published May 21, 2012• 5 citations
arXivHTMLPDF

Abstract

We introduce a $W^*$-metric space, which is a particular approach to non-commutative metric spaces where a \textit{quantum metric} is defined on a von Neumann algebra. We generalize the notion of a quantum code and quantum error correction to the setting of finite dimensional $W^*$-metric spaces, which includes codes and error correction for classical finite metric spaces. We also introduce a class of $W^*$-metric spaces that come from representations of semi-simple Lie algebras $\mathfrak{g}$ called \textit{$\mathfrak{g}$-metric} spaces, and present an outline for code constructions. In turn, we produce specific code constructions for $\mathfrak{su}(2,\mathbb{C})$-metric spaces that depend upon proving Tverberg's theorem for points on a moment curve constructed from arithmetic sequences. We introduce a \textit{quantum distance distribution}, and we prove an analogue of the MacWilliam's identities for $\mathfrak{su}(2)$-metric spaces.

DOI
10.48550/arxiv.1205.4517

Related papers

A Quantum Analog of Delsarte's Linear Programming Bounds

Rui Okada

This thesis presents results in quantum error correction within the context of finite dimensional quantum metric spaces. In classical error correction, a focal problem is the study of large codes of metric spaces. For a class of finite metric spaces that are also metric association schemes, Delsarte introduced a method of using linear programming to compute upper bounds on the size of codes. Within quantum error correction, there is an analogous study of large quantum codes of quantum metric spaces and, in the setting of quantum Hamming space, a quantum analog of Delsarte's method was discovered by Shor and Laflamme and independently by Rains. Later, Bumgardner introduced an analogous method for single-spin codes, or quantum codes related to the Lie algebra $\mathfrak{su}(2)$. The main contribution of this thesis is a generalization of the results of Shor, Laflamme, Rains, and Bumgardner to a class of finite dimensional quantum metric spaces analogous to metric association schemes of the classical case.

arXiv:2502.14165•Feb 20, 2025•4 citations

Hybrid Clifford Codes via Operator Algebra Quantum Error Correction and Projective Representation Theory

Jonas Eidesen, David W. Kribs, Andrew Nemec

Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of quantum subsystem codes. We formulate a two-fold generalization of Clifford codes, for both the hybrid classical and quantum information and projective representation theory settings. This leads to new classes of hybrid subspace and subsystem Clifford codes. We extend the fundamental representation theoretic quantum error correction theorem to include these codes, based on the operator algebra quantum error correction framework. We also discuss several examples throughout the presentation, of both stabilizer and non-stabilizer type.

quant-pharXiv:2606.02531•Journal of Physics A Mathematical and Theoretical•Jun 2, 2026•0 citations

Quantum Anticodes

ChunJun Cao, Giuseppe Cotardo, Brad Lackey

This work introduces a symplectic framework for quantum error correcting codes in which local structure is analyzed through an anticode perspective. In this setting, a code is treated as a symplectic space, and anticodes arise as maximal symplectic subspaces whose elements vanish on a prescribed set of components, providing a natural quantum analogue of their classical counterparts. This framework encompasses several families of quantum codes, including stabilizer and subsystem codes, provides a natural extension of generalized distances in quantum codes, and yields new invariants that capture local algebraic and combinatorial features. The notion of anticodes also naturally leads to operations such as puncturing and shortening for symplectic codes, which in turn provide algebraic interpretations of key phenomena in quantum error correction, such as the cleaning lemma and complementary recovery and yield new descriptions of weight enumerators.

quant-pharXiv:2512.13891•Dec 17, 2025•4 citations

Quantum Error Correction beyond S U ( 2 ) : Spin, Bosonic, and Permutation-Invariant Codes from Convex Geometry

Arda Aydin, Victor V. Albert, Alexander Barg

We develop a framework for constructing quantum error-correcting codes and logical gates for three types of spaces—composite permutation-invariant spaces of many qubits or qudits, composite constant-excitation Fock state spaces of many bosonic modes, and monolithic nuclear state spaces of atoms, ions, and molecules. By identifying all three spaces with discrete simplices and representations of the Lie group S U ( q ) , we prove that many codes and their gates in S U ( q ) can be interconverted between the three state spaces. We construct code instances for all three spaces using classical ℓ 1 codes and Tverberg’s theorem, a classic result from convex geometry. We obtain families of quantum codes with distance that scales almost linearly with the code length N by constructing ℓ 1 codes based on combinatorial patterns called Sidon sets and utilizing their Tverberg partitions. This compares favorably with the existing designs for all the state spaces. We present explicit constructions of codes with shorter length or lower total spin/excitation than known codes with similar parameters, bosonic codes with exotic Gaussian gates, as well as examples of short codes with distance larger than the known constructions.

arXiv:2509.20545•PRX Quantum•Jan 14, 2026•12 citations

Quantum error correction on infinite-dimensional Hilbert spaces

Cédric Bény, Achim Kempf, David W. Kribs

We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. We find that, under relatively mild conditions, much of the structure known from systems in finite-dimensional Hilbert spaces carries straightforwardly over to infinite dimensions. We also find that, at least in principle, there exist qualitatively new classes of quantum error correcting codes that have no finite-dimensional counterparts. We begin with a shift of focus from states to algebras of observables. Standard subspace codes and subsystem codes are seen as the special case of algebras of observables given by finite-dimensional von Neumann factors of type I. The new classes of codes that arise in infinite dimensions are shown to be characterized by von Neumann algebras of types II and III, for which we give in-principle physical examples.

arXiv:0811.0421•Journal of Mathematical Physics•Jun 1, 2009•26 citations

Graded Quantum Codes

Tony Shaska

This work develops a geometric framework for constructing quantum error-correcting codes from weighted projective and orbifold structures, integrating algebraic geometry, divisor theory, and the CSS stabilizer formalism. Beginning with weighted projective spaces and their associated height and defect structures, the study builds classical AG-codes via evaluation on divisors adapted to orbifold singularities. These classical codes are lifted to quantum codes using self-orthogonality conditions and homological constructions, yielding a class of Quantum Weighted Algebraic Geometric (QWAG) codes. A central contribution is the formulation of a refined Singleton-type bound motivated by orbifold defect terms and effective genus corrections. While the classical quantum Singleton bound is recovered in the smooth case, the orbifold setting suggests additional geometric contributions that may adjust the theoretical distance bound. The refined bound is presented with partial justification under specific geometric hypotheses and framed as a conjectural extension in full generality. The monograph further provides explicit constructions, computational implementations in Sage/Python, and illustrative examples demonstrating how weighted geometry influences code parameters. This work establishes a structured bridge between orbifold geometry and quantum coding theory, outlining both concrete constructions and open problems for further mathematical development.

arXiv:2508.07542•Aug 11, 2025•0 citations
We introduce a W∗W^*W∗-metric space, which is a particular approach to non-commutative metric spaces where a \textit{quantum metric} is defined on a von Neumann algebra. We generalize the notion of a quantum code and quantum error correction to the setting of finite dimensional W∗W^*W∗-metric spaces, which includes codes and error correction for classical finite metric spaces. We also introduce a class of W∗W^*W∗-metric spaces that come from representations of semi-simple Lie algebras g\mathfrak{g}g called \textit{g\mathfrak{g}g-metric} spaces, and present an outline for code constructions. In turn, we produce specific code constructions for su(2,C)\mathfrak{su}(2,\mathbb{C})su(2,C)-metric spaces that depend upon proving Tverberg's theorem for points on a moment curve constructed from arithmetic sequences. We introduce a \textit{quantum distance distribution}, and we prove an analogue of the MacWilliam's identities for su(2)\mathfrak{su}(2)su(2)-metric spaces.
This thesis presents results in quantum error correction within the context of finite dimensional quantum metric spaces. In classical error correction, a focal problem is the study of large codes of metric spaces. For a class of finite metric spaces that are also metric association schemes, Delsarte introduced a method of using linear programming to compute upper bounds on the size of codes. Within quantum error correction, there is an analogous study of large quantum codes of quantum metric spaces and, in the setting of quantum Hamming space, a quantum analog of Delsarte's method was discovered by Shor and Laflamme and independently by Rains. Later, Bumgardner introduced an analogous method for single-spin codes, or quantum codes related to the Lie algebra su(2)\mathfrak{su}(2)su(2). The main contribution of this thesis is a generalization of the results of Shor, Laflamme, Rains, and Bumgardner to a class of finite dimensional quantum metric spaces analogous to metric association schemes of the classical case.
Clifford codes are a natural generalization of quantum stabilizer codes based primarily on representation theory. This class of codes has previously been extended to the setting of quantum subsystem codes. We formulate a two-fold generalization of Clifford codes, for both the hybrid classical and quantum information and projective representation theory settings. This leads to new classes of hybrid subspace and subsystem Clifford codes. We extend the fundamental representation theoretic quantum error correction theorem to include these codes, based on the operator algebra quantum error correction framework. We also discuss several examples throughout the presentation, of both stabilizer and non-stabilizer type.
This work introduces a symplectic framework for quantum error correcting codes in which local structure is analyzed through an anticode perspective. In this setting, a code is treated as a symplectic space, and anticodes arise as maximal symplectic subspaces whose elements vanish on a prescribed set of components, providing a natural quantum analogue of their classical counterparts. This framework encompasses several families of quantum codes, including stabilizer and subsystem codes, provides a natural extension of generalized distances in quantum codes, and yields new invariants that capture local algebraic and combinatorial features. The notion of anticodes also naturally leads to operations such as puncturing and shortening for symplectic codes, which in turn provide algebraic interpretations of key phenomena in quantum error correction, such as the cleaning lemma and complementary recovery and yield new descriptions of weight enumerators.
We develop a framework for constructing quantum error-correcting codes and logical gates for three types of spaces—composite permutation-invariant spaces of many qubits or qudits, composite constant-excitation Fock state spaces of many bosonic modes, and monolithic nuclear state spaces of atoms, ions, and molecules. By identifying all three spaces with discrete simplices and representations of the Lie group S U ( q ) , we prove that many codes and their gates in S U ( q ) can be interconverted between the three state spaces. We construct code instances for all three spaces using classical ℓ 1 codes and Tverberg’s theorem, a classic result from convex geometry. We obtain families of quantum codes with distance that scales almost linearly with the code length N by constructing ℓ 1 codes based on combinatorial patterns called Sidon sets and utilizing their Tverberg partitions. This compares favorably with the existing designs for all the state spaces. We present explicit constructions of codes with shorter length or lower total spin/excitation than known codes with similar parameters, bosonic codes with exotic Gaussian gates, as well as examples of short codes with distance larger than the known constructions.
We present a generalization of quantum error correction to infinite-dimensional Hilbert spaces. We find that, under relatively mild conditions, much of the structure known from systems in finite-dimensional Hilbert spaces carries straightforwardly over to infinite dimensions. We also find that, at least in principle, there exist qualitatively new classes of quantum error correcting codes that have no finite-dimensional counterparts. We begin with a shift of focus from states to algebras of observables. Standard subspace codes and subsystem codes are seen as the special case of algebras of observables given by finite-dimensional von Neumann factors of type I. The new classes of codes that arise in infinite dimensions are shown to be characterized by von Neumann algebras of types II and III, for which we give in-principle physical examples.
This work develops a geometric framework for constructing quantum error-correcting codes from weighted projective and orbifold structures, integrating algebraic geometry, divisor theory, and the CSS stabilizer formalism. Beginning with weighted projective spaces and their associated height and defect structures, the study builds classical AG-codes via evaluation on divisors adapted to orbifold singularities. These classical codes are lifted to quantum codes using self-orthogonality conditions and homological constructions, yielding a class of Quantum Weighted Algebraic Geometric (QWAG) codes. A central contribution is the formulation of a refined Singleton-type bound motivated by orbifold defect terms and effective genus corrections. While the classical quantum Singleton bound is recovered in the smooth case, the orbifold setting suggests additional geometric contributions that may adjust the theoretical distance bound. The refined bound is presented with partial justification under specific geometric hypotheses and framed as a conjectural extension in full generality. The monograph further provides explicit constructions, computational implementations in Sage/Python, and illustrative examples demonstrating how weighted geometry influences code parameters. This work establishes a structured bridge between orbifold geometry and quantum coding theory, outlining both concrete constructions and open problems for further mathematical development.