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:2502.14165

A Quantum Analog of Delsarte's Linear Programming Bounds

Rui Okada

Published Feb 20, 2025• 4 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2502.14165

Related papers

Upper bounds on the size of quantum codes

Alexei Ashikhmin, Simon N. Litsyn

Upper bounds on the size of quantum error correcting codes are considered. We generalize the linear programming approach to the quantum case and obtain the Singleton, Hamming and first linear programming type bounds for quantum codes.

IEEE International Symposium on Information Theory (ISIT)•Nov 27, 2002•3 citations

Upper bounds on the size of quantum codes

Alexei Ashikhmin, S. Litsyu

This paper is concerned with bounds for quantum error-correcting codes. Using the quantum MacWilliams (1972, 1977) identities, we generalize the linear programming approach from classical coding theory to the quantum case. Using this approach, we obtain Singleton-type, Hamming-type, and the first linear-programming-type bounds for quantum codes. Using the special structure of linear quantum codes, we derive an upper bound that is better than both Hamming and the first linear programming bounds on some subinterval of rates.

IEEE Transactions on Information Theory•May 1, 1999•77 citations

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

Christopher J. Bumgardner

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.

arXiv:1205.4517•ProQuest LLC eBooks•May 21, 2012•5 citations

The Quantum Hamming Bound in Arbitrary Local Dimension

Yu-Xuan Zhang, Jing-Ling Chen

The quantum Hamming bound arises from a direct dimension estimate for exact quantum error-correcting codes. For nondegenerate codes, distinct correctable errors map the code space into orthogonal subspaces, so dimension counting directly gives the bound; degeneracy allows these subspaces to overlap and invalidates the argument. Although linear-programming, asymptotic, and structural approaches have advanced the problem from several directions, the general local-dimension case has remained open. Here we prove the quantum Hamming bound for every local dimension $q\ge3$. Building on the exact two-center Fourier reduction, we develop new overlap estimates for nonbinary Hamming spaces. For $q\ge4$, Jacobi estimates and monotonicity give a uniform gap; qutrits form the boundary case where the gap vanishes and are handled by a filtered correction. This completes the finite-length nonbinary case; together with the existing qubit result, it establishes the quantum Hamming bound for arbitrary local dimension.

quant-pharXiv:2606.22538•Jun 23, 2026•2 citations

Linear Programming Bounds for Approximate Quantum Error Correction Over Arbitrary Quantum Channels

Yingkai Ouyang, Ching–Yi Lai

While quantum weight enumerators establish some of the best upper bounds on the minimum distance of quantum error-correcting codes, these bounds are not optimized to quantify the performance of quantum codes under the effect of arbitrary quantum channels that describe bespoke noise models. Herein, for any Kraus decomposition of any given quantum channel, we introduce corresponding quantum weight enumerators that naturally generalize the Shor-Laflamme quantum weight enumerators. We establish an indirect linear relationship between these generalized quantum weight enumerators by introducing an auxiliary exact weight enumerator that completely quantifies the quantum code’s projector, and is independent of the underlying noise process. By additionally working within the framework of approximate quantum error correction, we establish a general framework for constructing a linear program that is infeasible whenever approximate quantum error correcting codes with corresponding parameters do not exist. Our linear programming framework allows us to establish the non-existence of certain quantum codes that approximately correct amplitude damping errors, and obtain non-trivial upper bounds on the maximum dimension of a broad family of permutation-invariant quantum codes.

arXiv:2108.04434•IEEE Transactions on Information Theory•Mar 25, 2022•7 citations

Linear Programming Bounds for Entanglement-Assisted Quantum Error-Correcting Codes by Split Weight Enumerators

Ching–Yi Lai, Alexei Ashikhmin

Linear programming approaches have been applied to derive upper bounds on the size of classical and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance by considering a type of split weight enumerator. After deriving the MacWilliams identities for these enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. Our Singleton bound and Hamming bound are more general than the previous bounds for entanglement-assisted quantum stabilizer codes. In addition, we show that the first linear programming bound improves the Hamming bound when the relative distance is sufficiently large. On the other hand, we obtain additional constraints on the size of Pauli subgroups for quantum codes, which allow us to improve the linear programming bounds on the minimum distance of quantum codes of small length. In particular, we show that there is no [[27, 15, 5]] or [[28, 14, 6]] stabilizer code. We also discuss the existence of some entanglement-assisted quantum stabilizer codes with maximal entanglement. As a result, the upper and lower bounds on the minimum distance of maximal-entanglement quantum stabilizer codes with length up to 20 are significantly improved.

arXiv:1602.00413•IEEE Transactions on Information Theory•Jun 2, 2017•107 citations
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.
This paper is concerned with bounds for quantum error-correcting codes. Using the quantum MacWilliams (1972, 1977) identities, we generalize the linear programming approach from classical coding theory to the quantum case. Using this approach, we obtain Singleton-type, Hamming-type, and the first linear-programming-type bounds for quantum codes. Using the special structure of linear quantum codes, we derive an upper bound that is better than both Hamming and the first linear programming bounds on some subinterval of rates.
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.
The quantum Hamming bound arises from a direct dimension estimate for exact quantum error-correcting codes. For nondegenerate codes, distinct correctable errors map the code space into orthogonal subspaces, so dimension counting directly gives the bound; degeneracy allows these subspaces to overlap and invalidates the argument. Although linear-programming, asymptotic, and structural approaches have advanced the problem from several directions, the general local-dimension case has remained open. Here we prove the quantum Hamming bound for every local dimension q≥3q\ge3q≥3. Building on the exact two-center Fourier reduction, we develop new overlap estimates for nonbinary Hamming spaces. For q≥4q\ge4q≥4, Jacobi estimates and monotonicity give a uniform gap; qutrits form the boundary case where the gap vanishes and are handled by a filtered correction. This completes the finite-length nonbinary case; together with the existing qubit result, it establishes the quantum Hamming bound for arbitrary local dimension.
While quantum weight enumerators establish some of the best upper bounds on the minimum distance of quantum error-correcting codes, these bounds are not optimized to quantify the performance of quantum codes under the effect of arbitrary quantum channels that describe bespoke noise models. Herein, for any Kraus decomposition of any given quantum channel, we introduce corresponding quantum weight enumerators that naturally generalize the Shor-Laflamme quantum weight enumerators. We establish an indirect linear relationship between these generalized quantum weight enumerators by introducing an auxiliary exact weight enumerator that completely quantifies the quantum code’s projector, and is independent of the underlying noise process. By additionally working within the framework of approximate quantum error correction, we establish a general framework for constructing a linear program that is infeasible whenever approximate quantum error correcting codes with corresponding parameters do not exist. Our linear programming framework allows us to establish the non-existence of certain quantum codes that approximately correct amplitude damping errors, and obtain non-trivial upper bounds on the maximum dimension of a broad family of permutation-invariant quantum codes.
Linear programming approaches have been applied to derive upper bounds on the size of classical and quantum codes. In this paper, we derive similar results for general quantum codes with entanglement assistance by considering a type of split weight enumerator. After deriving the MacWilliams identities for these enumerators, we are able to prove algebraic linear programming bounds, such as the Singleton bound, the Hamming bound, and the first linear programming bound. Our Singleton bound and Hamming bound are more general than the previous bounds for entanglement-assisted quantum stabilizer codes. In addition, we show that the first linear programming bound improves the Hamming bound when the relative distance is sufficiently large. On the other hand, we obtain additional constraints on the size of Pauli subgroups for quantum codes, which allow us to improve the linear programming bounds on the minimum distance of quantum codes of small length. In particular, we show that there is no [[27, 15, 5]] or [[28, 14, 6]] stabilizer code. We also discuss the existence of some entanglement-assisted quantum stabilizer codes with maximal entanglement. As a result, the upper and lower bounds on the minimum distance of maximal-entanglement quantum stabilizer codes with length up to 20 are significantly improved.