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

Remarks on Bounds for Quantum Codes

Alexei Ashikhmin

Published May 21, 1997• 2 citations
OpenAlex

Abstract

We present some results that show that bounds from classical coding theory still work in many cases of quantum coding theory.

Related papers

Remarks on Bounds for Quantum Codes

Alexei Ashikhmin

We present some results that show that bounds from classical coding theory still work in many cases of quantum coding theory.

arXiv:quant-ph/9705037•May 21, 1997•6 citations

Burst error-correcting quantum stabilizer codes designed from idempotents

Kai Lin Ong

Abstract Certain classical codes can be viewed isomorphically as ideals of group algebras, while studying their algebraic structures help extracting the code properties. Research has shown that this was remarkably efficient in the case when the code generators are idempotents. In quantum error correction, the theory of stabilizer formalism requires classical self-orthogonal additive codes over the finite field GF(4), which, via the lens of group algebras, are essentially $$F_2$$ F 2 -submodules over GF(4). Therefore, this paper provides a classification on idempotents in commutative group algebra GF(4)G, followed by a criterion that allows idempotents to generate stabilizer subgroups. Later, the construction of quantum stabilizer codes is done in the case when G is a cyclic group $$C_n$$ C n , for $$n=2^m-1$$ n = 2 m - 1 and $$n=2^m+1$$ n = 2 m + 1 . Quantum bounds on their burst error minimum distance are subsequently determined.

Quantum Information Processing•Mar 22, 2023•7 citations

On Bounds for Quantum Error Correcting Codes over EJ-Integers

Eda Yıldız

Electronic Notes in Discrete Mathematics•Dec 1, 2018•1 citation

Simple and general bounds on quantum random access codes

Máté Farkas, Nikolai Miklin, Armin Tavakoli

Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However, only a few cases are solved exactly for quantum random access codes. In this paper, we provide bounds for the fully general setting of n independent variables, each selected from a d-dimensional classical alphabet and encoded in a D -dimensional quantum system subject to an arbitrary quantum measurement. The bound recovers the exactly known special cases, and we demonstrate numerically that even though the bound is not tight overall, it can still yield a good approximation.

arXiv:2312.14142•Quantum•Feb 25, 2025•17 citations

On the Existence of Nonadditive Quantum Codes

Vwani Roychowdhury, Farrokh Vatan

Lecture notes in computer science•Jan 1, 1999•9 citations

Some Remarks on Classical and Classical-Quantum Sphere Packing Bounds: Rényi vs. Kullback–Leibler

Marco Dalai

We review the use of binary hypothesis testing for the derivation of the sphere packing bound in channel coding, pointing out a key difference between the classical and the classical-quantum setting. In the first case, two ways of using the binary hypothesis testing are known, which lead to the same bound written in different analytical expressions. The first method historically compares output distributions induced by the codewords with an auxiliary fixed output distribution, and naturally leads to an expression using the Renyi divergence. The second method compares the given channel with an auxiliary one and leads to an expression using the Kullback–Leibler divergence. In the classical-quantum case, due to a fundamental difference in the quantum binary hypothesis testing, these two approaches lead to two different bounds, the first being the “right” one. We discuss the details of this phenomenon, which suggests the question of whether auxiliary channels are used in the optimal way in the second approach and whether recent results on the exact strong-converse exponent in classical-quantum channel coding might play a role in the considered problem.

Entropy•Jul 12, 2017•10 citations
Abstract Certain classical codes can be viewed isomorphically as ideals of group algebras, while studying their algebraic structures help extracting the code properties. Research has shown that this was remarkably efficient in the case when the code generators are idempotents. In quantum error correction, the theory of stabilizer formalism requires classical self-orthogonal additive codes over the finite field GF(4), which, via the lens of group algebras, are essentially F2F_2F2​ F 2 -submodules over GF(4). Therefore, this paper provides a classification on idempotents in commutative group algebra GF(4)G, followed by a criterion that allows idempotents to generate stabilizer subgroups. Later, the construction of quantum stabilizer codes is done in the case when G is a cyclic group CnC_nCn​ C n , for n=2m−1n=2^m-1n=2m−1 n = 2 m - 1 and n=2m+1n=2^m+1n=2m+1 n = 2 m + 1 . Quantum bounds on their burst error minimum distance are subsequently determined.
Random access codes are a type of communication task that is widely used in quantum information science. The optimal average success probability that can be achieved through classical strategies is known for any random access code. However, only a few cases are solved exactly for quantum random access codes. In this paper, we provide bounds for the fully general setting of n independent variables, each selected from a d-dimensional classical alphabet and encoded in a D -dimensional quantum system subject to an arbitrary quantum measurement. The bound recovers the exactly known special cases, and we demonstrate numerically that even though the bound is not tight overall, it can still yield a good approximation.
We review the use of binary hypothesis testing for the derivation of the sphere packing bound in channel coding, pointing out a key difference between the classical and the classical-quantum setting. In the first case, two ways of using the binary hypothesis testing are known, which lead to the same bound written in different analytical expressions. The first method historically compares output distributions induced by the codewords with an auxiliary fixed output distribution, and naturally leads to an expression using the Renyi divergence. The second method compares the given channel with an auxiliary one and leads to an expression using the Kullback–Leibler divergence. In the classical-quantum case, due to a fundamental difference in the quantum binary hypothesis testing, these two approaches lead to two different bounds, the first being the “right” one. We discuss the details of this phenomenon, which suggests the question of whether auxiliary channels are used in the optimal way in the second approach and whether recent results on the exact strong-converse exponent in classical-quantum channel coding might play a role in the considered problem.