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

Graduate studies in mathematics

Classical and quantum codes

Alexei Kitaev, Alexander Khanievich Shen', M. Vyalyi

Published May 31, 2002• 12 citations
Publisher
DOI
10.1090/gsm/047/18

Related papers

Quantum codes from trace codes

Pavan Kumar, Noor Mohammad Khan

Journal of Applied Mathematics and Computing•Oct 23, 2022•0 citations

Revisiting the Classical to Quantum Coding Evolution

Zunaira Babar, Daryus Chandra, Soon Xin Ng +1 more

The classical-to-quantum coding evolution is characterized by formalizing the isomorphism between classical linear block codes and quantum stabilizer codes. We commence with a review of classical block code constructions and decoding principles, including repetition codes and parity-check matrices. The chapter introduces the stabilizer formalism and demonstrates how classical codes can be transformed into quantum codes using Pauli-to-binary and Pauli-to-quaternary isomorphisms. We discuss the classification of quantum errors and the specific conditions under which classical codes lend themselves to quantum code construction. The chapter also details the design of quantum convolutional codes and entanglement-assisted quantum stabilizer codes, which facilitate the use of arbitrary classical codes in quantum settings. These concepts collectively establish a generalized framework for designing quantum codes from classical codes.

Wiley eBooks•Dec 18, 2025•0 citations

A construction of quantum codes via a class of classical polynomial codes

Lingfei Jin, Chaoping Xing

There have been various constructions of classical codes from polynomial valuations in literature [2], [7], [8], [10], [11]. In this paper, we present a construction of classical codes based on polynomial construction again. One of the features of this construction is that not only the classical codes arisen from the construction have good parameters, but also quantum codes with reasonably good parameters can be produced from these classical codes. In particular, some new quantum codes are constructed (see Examples V.5 and V.6).

arXiv:1308.3577•IEEE International Symposium on Information Theory (ISIT)•Jul 1, 2012•1 citation

Constructing quantum codes

Hao Chen

Frontiers of Computer Science in China•Jun 1, 2008•0 citations

Universal Classical-Quantum Superposition Coding and Universal Classical-Quantum Multiple Access Channel Coding

Masahito Hayashi, Ning Cai

We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets. Our universal classical-quantum multiple access channel codes have two types of codes. One is a code with joint decoding and the other is a code with separate decoding. It is not so easy to construct a former code that universally achieves general points of the capacity region beyond corner points. First, we construct the latter code that universally achieves general points of the capacity region. Then, converting the latter code to the former coder, we construct the above desired code with the former type.

arXiv:2011.00410•IEEE Transactions on Information Theory•Nov 30, 2021•6 citations

Quantum Codes

Gabriele Nebe, Eric M. Rains, Neil J.A. Sloane

Springer eBooks•May 19, 2006•0 citations
The classical-to-quantum coding evolution is characterized by formalizing the isomorphism between classical linear block codes and quantum stabilizer codes. We commence with a review of classical block code constructions and decoding principles, including repetition codes and parity-check matrices. The chapter introduces the stabilizer formalism and demonstrates how classical codes can be transformed into quantum codes using Pauli-to-binary and Pauli-to-quaternary isomorphisms. We discuss the classification of quantum errors and the specific conditions under which classical codes lend themselves to quantum code construction. The chapter also details the design of quantum convolutional codes and entanglement-assisted quantum stabilizer codes, which facilitate the use of arbitrary classical codes in quantum settings. These concepts collectively establish a generalized framework for designing quantum codes from classical codes.
There have been various constructions of classical codes from polynomial valuations in literature [2], [7], [8], [10], [11]. In this paper, we present a construction of classical codes based on polynomial construction again. One of the features of this construction is that not only the classical codes arisen from the construction have good parameters, but also quantum codes with reasonably good parameters can be produced from these classical codes. In particular, some new quantum codes are constructed (see Examples V.5 and V.6).
We derive universal classical-quantum superposition coding and universal classical-quantum multiple access channel coding by using generalized packing lemmas for the type method. Using our classical-quantum universal superposition code, we establish the capacity region of a classical-quantum compound broadcast channel with degraded message sets. Our universal classical-quantum multiple access channel codes have two types of codes. One is a code with joint decoding and the other is a code with separate decoding. It is not so easy to construct a former code that universally achieves general points of the capacity region beyond corner points. First, we construct the latter code that universally achieves general points of the capacity region. Then, converting the latter code to the former coder, we construct the above desired code with the former type.