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

QUANTUM ERROR-CORRECTING CODES

Manabu Hagiwara

Published Apr 1, 2008• 1 citation
Publisher

Abstract

In this review, we discuss quantum error-correcting codes by emphasizing the generalization of classical error-correcting codes. Starting with the explanations of general notions of classical error-correcting codes, we finish the discussion with the construction of quantum codes which are constructed by a pair of practical and trendy classical codes.

DOI
10.1142/9789812814487_0006

Related papers

QUANTUM ERROR-CORRECTING CODES

Keqin Feng

Quantum error correction is one of the important requirements in both quantum computing and quantum communication. The mathematical theory of quantum codes (QC) has been formulated in 1996-1998 and developed rapidly since then. In these lecture notes we introduce the basic concepts on QC, mathematical methods to construct good QC and some related topics.

Lecture notes series, Institute For Mathematical Sciences•Dec 1, 2002•29 citations

Error Correcting Codes

Peter M Kosek

Error correcting codes is an area of mathematics that combines many theoretical concepts with a wide variety of applications.In this expository thesis, we will begin by introducing many of the fundamental ideas in classical error correcting codes.The goal of this is to introduce the reader to the field of coding theory and discuss a few of the wide range of classical codes that have been studied.The second section will discuss the recent findings in error correcting codes, namely their use in quantum error correcting codes.This section uses much more theoretical areas of math, when compared to the classical section, in the construction of quantum error correcting codes.Most of the research discussed in this section has been completed within the past six years.All of the research discoveries presented in this thesis have been previously known.

•Jan 1, 2014•0 citations

Algorithmic aspects of quantum error-correcting codes

Markus Grassl

Abstract We show how quantum algorithms for encoding and decoding of quantum error-correcting codes (QECC) can be derived from the underlying mathematical structure. For this, we first characterize general quantum error-correcting codes, followed by the discussion of CSS codes and additive quantum error-correcting codes. For the last two families, examples are given that illustrate the constructions.

Chapman & Hall/CRC eBooks•Feb 14, 2002•10 citations

Constructing quantum error-correcting codes for p^m-state systems from classical error-correcting codes

Ryutaroh Matsumoto, Tomohiko Uyematsu

We generalize the construction of quantum error-correcting codes from GF(4)-linear codes by Calderbank et al. to p^m-state systems. Then we show how to determine the error from a syndrome. Finally we discuss a systematic construction of quantum codes with efficient decoding algorithms.

arXiv:quant-ph/9911011•Nov 4, 1999•23 citations

Quantum error correction: an introductory guide

Joschka Roffe

Quantum error correction protocols will play a central role in the realisation of quantum computing; the choice of error correction code will influence the full quantum computing stack, from the layout of qubits at the physical level to gate compilation strategies at the software level. As such, familiarity with quantum coding is an essential prerequisite for the understanding of current and future quantum computing architectures. In this review, we provide an introductory guide to the theory and implementation of quantum error correction codes. Where possible, fundamental concepts are described using the simplest examples of detection and correction codes, the working of which can be verified by hand. We outline the construction and operation of the surface code, the most widely pursued error correction protocol for experiment. Finally, we discuss issues that arise in the practical implementation of the surface code and other quantum error correction codes.

arXiv:1907.11157•Contemporary Physics•Jul 3, 2019•470 citations

Nonbinary Stabilizer Codes

Pradeep Kiran Sarvepalli, Andreas Klappenecker, Salah A. Aly

Recently, the field of quantum error-correcting codes has rapidly emerged as an important discipline. As quantum information is extremely sensitive to noise, it seems unlikely that any large scale quantum computation is feasible without quantum error-correction. In this paper we give a brief exposition of the theory of quantum stabilizer codes. We review the stabilizer formalism of quantum codes, establish the connection between classical codes and stabilizer codes and the main methods for constructing quantum codes from classical codes. In addition to the expository part, we include new results that cannot be found elsewhere. Specifically, after reviewing some important bounds for quantum codes, we prove the nonexistence of pure perfect quantum stabilizer codes with minimum distance greater than 3. Finally, we illustrate the general methods of constructing quantum codes from classical codes by explicitly constructing two new families of quantum codes and conclude by showing how to construct new quantum codes by shortening.

Chapman & Hall/CRC applied mathematics and nonlinear science series•Sep 19, 2007•7 citations
In this review, we discuss quantum error-correcting codes by emphasizing the generalization of classical error-correcting codes. Starting with the explanations of general notions of classical error-correcting codes, we finish the discussion with the construction of quantum codes which are constructed by a pair of practical and trendy classical codes.
Error correcting codes is an area of mathematics that combines many theoretical concepts with a wide variety of applications.In this expository thesis, we will begin by introducing many of the fundamental ideas in classical error correcting codes.The goal of this is to introduce the reader to the field of coding theory and discuss a few of the wide range of classical codes that have been studied.The second section will discuss the recent findings in error correcting codes, namely their use in quantum error correcting codes.This section uses much more theoretical areas of math, when compared to the classical section, in the construction of quantum error correcting codes.Most of the research discussed in this section has been completed within the past six years.All of the research discoveries presented in this thesis have been previously known.
Quantum error correction protocols will play a central role in the realisation of quantum computing; the choice of error correction code will influence the full quantum computing stack, from the layout of qubits at the physical level to gate compilation strategies at the software level. As such, familiarity with quantum coding is an essential prerequisite for the understanding of current and future quantum computing architectures. In this review, we provide an introductory guide to the theory and implementation of quantum error correction codes. Where possible, fundamental concepts are described using the simplest examples of detection and correction codes, the working of which can be verified by hand. We outline the construction and operation of the surface code, the most widely pursued error correction protocol for experiment. Finally, we discuss issues that arise in the practical implementation of the surface code and other quantum error correction codes.
Recently, the field of quantum error-correcting codes has rapidly emerged as an important discipline. As quantum information is extremely sensitive to noise, it seems unlikely that any large scale quantum computation is feasible without quantum error-correction. In this paper we give a brief exposition of the theory of quantum stabilizer codes. We review the stabilizer formalism of quantum codes, establish the connection between classical codes and stabilizer codes and the main methods for constructing quantum codes from classical codes. In addition to the expository part, we include new results that cannot be found elsewhere. Specifically, after reviewing some important bounds for quantum codes, we prove the nonexistence of pure perfect quantum stabilizer codes with minimum distance greater than 3. Finally, we illustrate the general methods of constructing quantum codes from classical codes by explicitly constructing two new families of quantum codes and conclude by showing how to construct new quantum codes by shortening.