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

Acta Physica Sinica

Error bases, group algebra and quantum codes

Zhuo Li, Lijuan Xing

Published Jan 1, 2013• 1 citation
Publisher

Abstract

We find a new approach to study nice error bases and quantum error-correcting codes, namely the group algebra which gives us an algebraic notation for nice error bases and quantum codes. From this algebraic notation we establish a series of linear programming bounds on the most general quantum error-correcting codes.
DOI
10.7498/aps.62.130306

Related papers

Universal Framework for Quantum Error-Correcting Codes

Zhuo Li, Lijuan Xing

We present a universal framework for quantum error-correcting codes, i.e., a framework that applies to the most general quantum error-correcting codes. This framework is based on the group algebra, an algebraic notation associated with nice error bases of quantum systems. The nicest thing about this framework is that we can characterize the properties of quantum codes by the properties of the group algebra. We show how it characterizes the properties of quantum codes as well as generates some new results about quantum codes.

arXiv:0901.0376•Entropy•Jul 23, 2021•5 citations

Beyond stabilizer codes .I. Nice error bases

Andreas Klappenecker, Martin Rötteler

Nice error bases have been introduced by Knill (1996) as a generalization of the Pauli basis. These bases are shown to be projective representations of finite groups. We classify all nice error bases of small degree, and all nice error bases with Abelian index groups. We show that, in general, an index group of a nice error basis is necessarily solvable.

IEEE Transactions on Information Theory•Aug 1, 2002•81 citations

Error Correcting Quantum Codes and Algebraic Curves

Artur Elezi

The goal of this paper is twofold. First, to provide a self contained, detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes and their connection to self-orthogonal linear codes. This has been done without venturing that much, if at all, into the world of physics. While most of the results presented are not new, it is not easy to extract a precise mathematical formulation of results and to provide their rigorous proofs by reading the vast number of papers in the field, quite a few of which are written by computer scientists or physicists. It is this formulation and proofs, some of which are new, that we present here. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed. The second goal is the construction of some stabilizer codes via self-orthogonal linear codes associated to algebraic curves.

NATO science for peace and security series. D, Information and communication security•Jan 1, 2015•0 citations

A Remark on Unitary Error Bases

Andreas Klappenecker, Martin Roetteler

Nice error bases have been introduced by Knill as a generalization of the Pauli basis. These bases are shown to be projective representations of finite groups. We classify all nice error bases of small degree, and all nice error bases with abelian index groups. We show that in general an index group of a nice error basis is necessarily solvable.

arXiv:quant-ph/0010082•Oct 23, 2000•2 citations

Duadic Group Algebra Codes

Salah A. Aly, Andreas Klappenecker, Pradeep Kiran Sarvepalli

Duadic group algebra codes are a generalization of quadratic residue codes. This paper addresses an open problem raised by Zhu concerning the existence of duadic group algebra codes. These codes can be used to construct degenerate quantum stabilizer codes that have the nice feature that many errors of small weight do not need error correction.

arXiv:cs/0701060•IEEE International Symposium on Information Theory (ISIT)•Jun 1, 2007•13 citations

Algebraic Quantum Error-Correction Codes

Ming-Chung Tsai, Pochung Chen, Kuan-Peng Chen +1 more

Based on the group structure of a unitary Lie algebra, a scheme is provided to systematically and exhaustively generate quantum error correction codes, including the additive and nonadditive codes. The syndromes in the process of error-correction distinguished by different orthogonal vector subspaces, the coset subspaces. Moreover, the generated codes can be classified into four types with respect to the spinors in the unitary Lie algebra and a chosen initial quantum state.

arXiv:1310.7514•Oct 28, 2013•0 citations
We present a universal framework for quantum error-correcting codes, i.e., a framework that applies to the most general quantum error-correcting codes. This framework is based on the group algebra, an algebraic notation associated with nice error bases of quantum systems. The nicest thing about this framework is that we can characterize the properties of quantum codes by the properties of the group algebra. We show how it characterizes the properties of quantum codes as well as generates some new results about quantum codes.
The goal of this paper is twofold. First, to provide a self contained, detailed and rigorous mathematical introduction to some aspects of the quantum error-correcting codes and especially quantum stabilizer codes and their connection to self-orthogonal linear codes. This has been done without venturing that much, if at all, into the world of physics. While most of the results presented are not new, it is not easy to extract a precise mathematical formulation of results and to provide their rigorous proofs by reading the vast number of papers in the field, quite a few of which are written by computer scientists or physicists. It is this formulation and proofs, some of which are new, that we present here. Techniques from algebra of finite fields as well as representations of finite abelian groups have been employed. The second goal is the construction of some stabilizer codes via self-orthogonal linear codes associated to algebraic curves.