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

IEEE International Conference on Quantum Computing and Engineering (QCE)

Quantum Error Correction for Kids

Richard A. Wolf

Published Sep 15, 2024• 1 citation
Publisher

Abstract

This extended abstract presents an intuitive gamified approach to one of the core concepts in quantum error correction: the stabiliser formalism. The game gradually builds up complexity and takes the players from classical repetition codes to Calderbank-Shor-Steane (CSS) codes. Through its lightweight mechanics, the game offers a glimpse into the notions of communication channel, noise and encoding as well as decoding. It is designed to be inclusive of a wide range of ages and abilities.

DOI
10.1109/qce60285.2024.20452

Related papers

Quantum Error Correction for Kids

R. A. Wolf

No one should wait until college to get acquainted with core concepts of quantum information. Given the human bias of favouring the familiar over the unknown, early exposure to concepts of quantum information helps learners build stronger appetence for the field, as well as allowing them to develop an intuitive approach to it. In this work, I present an intuitive gamified approach to one of the core concepts in quantum error correction: the stabiliser formalism.

arXiv:2405.06795•May 10, 2024•0 citations

Quantum error correction

E. Desurvire

This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.

Cambridge University Press eBooks•Feb 19, 2009•0 citations

Semiclassical grounds of the Calderbank-Shor-Steane quantum error correction codes

Manuél Ávila

A valid Calderbank-Shor-Steane (CSS) error correction code requires two classical linear codes for the preparation of the initial state (codewords). This code allow to correct for certain errors caused by an unwanted interaction which produces a degraded quantum state. However, this initial seven qubits encoding can be obtained from a maximally entangled Bell state (0000000>+|1111111)/√ through an operation Hint whose explicit expression is derived in the present work. The price the CSS syndrome has to pay due to its classical grounds is that the operator Hint is not unitary. In other words, Hint is not a valid quantum gate i. e. this does not represent a logical operation. Consequently, the final state is not completely robust for the standard cryptography of Quantum Computation. Besides to be a non unitary operator, Hint, is not reversible introducing with this dissipative effects that destroy the coherence in the quantum computer. Additionally, this operator is not invariant under rotations of the protector qubits inducing then preferred directions of the propagation of the logical information. These are indeed the reasons that prompt us for extending the semi classical CSS quantum error correction codes formalism to a pure quantum Hamming codes.

Journal of Computer Science and Technology•Jan 1, 2009•0 citations

Decoding general error correcting codes and the role of complementarity

Yoshifumi Nakata, Takaya Matsuura, Masato Koashi

Among various classes of quantum error correcting codes (QECCs), non-stabilizer codes have rich properties and are of theoretical and practical interest. Decoding non-stabilizer codes is, however, a highly non-trivial task. In this paper, we show that a decoding circuit for Calderbank-Shor-Steane (CSS) codes can be straightforwardly extended to handle general QECCs. The key to the extension lies in the use of a pair of classical-quantum (CQ) codes associated with the QECC to be decoded. The decoding error of the proposed decoding circuit depends on the classical decoding errors of the CQ codes and their degree of complementarity. We demonstrate the power of the decoding circuit in a toy model of the black hole information paradox, improving decoding errors compared to previous results. In addition, we reveal that black hole dynamics may optimally encode quantum information but poorly encode classical information.

arXiv:2210.06661•npj Quantum Information•Jan 10, 2025•8 citations

Error‐Correction Code in Quantum Noise

Kuldeep Singh Kaswan, Jagjit Singh Dhatterwal, Anupam Baliyan +1 more

Error-correcting codes are the primary method of transmitting data in the classical world. The effects of contact with the atmosphere are expected to be so widespread in any quantum system utilized to do quantum learning and memory that quantum error correction will always be needed. Group theory is used extensively in both conventional and quantum error correction. For linear quantum error-correcting codes, this chapter outlines a nonconstructive framework that specifies requirements for every code in the category. CSS codes (Calderbank-Shor-Steane), which belong to the larger category of stabilizer codes, have an advantage over other stabilizer codes since they may be built from pairs of classical codes that are coupled in a novel way. The chapter describes how to design a CSS code stabilizer. The stabilizer perspective is described as an alternative to the CSS code architecture described.

Wiley eBooks•Jul 14, 2023•0 citations

Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction

Mitsuru Hamada

A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.

arXiv:quant-ph/0610195•IEEE Transactions on Information Theory•Dec 1, 2008•54 citations
This extended abstract presents an intuitive gamified approach to one of the core concepts in quantum error correction: the stabiliser formalism. The game gradually builds up complexity and takes the players from classical repetition codes to Calderbank-Shor-Steane (CSS) codes. Through its lightweight mechanics, the game offers a glimpse into the notions of communication channel, noise and encoding as well as decoding. It is designed to be inclusive of a wide range of ages and abilities.
This chapter deals with the subject of quantum error correction and the related codes (QECC), which can be applied to noisy quantum channels and quantum memories with the purpose of preserving or protecting the information integrity. I first describe the basics of quantum repetition codes , as applicable to bit-flip and phase-flip quantum channels. Then I consider the 9-qubit Shor code , which has the capability of diagnosing and correcting any combination of bit-flip and phase-flip errors, up to one error of each type. Furthermore, it is shown that the Shor code is, in fact, capable of fully restoring qubit integrity under a continuum of bit or phase errors, a property that has no counterpart in the classical world of error-correction codes. But the exploration of QECC does not stop here! We shall discover the elegant Calderbank–Shor–Steane (CSS) codes, which have the capability of correcting any number of errors t , both bit-flip and phase-flip. As an application of the CSS code, I then describe the 7-qubit Hadamard–Steane code , which can correct up to one error on single qubits. A corresponding quantum circuit, based on an original generator-matrix example, is presented. Quantum repetition code In Chapter 11, we saw that the simplest form of error-correction code (ECC) is the repetition code , based on the principle of majority logic . The background assumption is that in a given message sequence, or bit string, the probability of a bit error is sufficiently small for the majority of bits to be correctly transmitted through the channel.
A valid Calderbank-Shor-Steane (CSS) error correction code requires two classical linear codes for the preparation of the initial state (codewords). This code allow to correct for certain errors caused by an unwanted interaction which produces a degraded quantum state. However, this initial seven qubits encoding can be obtained from a maximally entangled Bell state (0000000>+|1111111)/√ through an operation Hint whose explicit expression is derived in the present work. The price the CSS syndrome has to pay due to its classical grounds is that the operator Hint is not unitary. In other words, Hint is not a valid quantum gate i. e. this does not represent a logical operation. Consequently, the final state is not completely robust for the standard cryptography of Quantum Computation. Besides to be a non unitary operator, Hint, is not reversible introducing with this dissipative effects that destroy the coherence in the quantum computer. Additionally, this operator is not invariant under rotations of the protector qubits inducing then preferred directions of the propagation of the logical information. These are indeed the reasons that prompt us for extending the semi classical CSS quantum error correction codes formalism to a pure quantum Hamming codes.
Among various classes of quantum error correcting codes (QECCs), non-stabilizer codes have rich properties and are of theoretical and practical interest. Decoding non-stabilizer codes is, however, a highly non-trivial task. In this paper, we show that a decoding circuit for Calderbank-Shor-Steane (CSS) codes can be straightforwardly extended to handle general QECCs. The key to the extension lies in the use of a pair of classical-quantum (CQ) codes associated with the QECC to be decoded. The decoding error of the proposed decoding circuit depends on the classical decoding errors of the CQ codes and their degree of complementarity. We demonstrate the power of the decoding circuit in a toy model of the black hole information paradox, improving decoding errors compared to previous results. In addition, we reveal that black hole dynamics may optimally encode quantum information but poorly encode classical information.
Error-correcting codes are the primary method of transmitting data in the classical world. The effects of contact with the atmosphere are expected to be so widespread in any quantum system utilized to do quantum learning and memory that quantum error correction will always be needed. Group theory is used extensively in both conventional and quantum error correction. For linear quantum error-correcting codes, this chapter outlines a nonconstructive framework that specifies requirements for every code in the category. CSS codes (Calderbank-Shor-Steane), which belong to the larger category of stabilizer codes, have an advantage over other stabilizer codes since they may be built from pairs of classical codes that are coupled in a novel way. The chapter describes how to design a CSS code stabilizer. The stabilizer perspective is described as an alternative to the CSS code architecture described.
A method for concatenating quantum error-correcting codes is presented. The method is applicable to a wide class of quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes. As a result, codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented. The rate is the highest among those known to be achievable by CSS codes. Moreover, the best known lower bound on the greatest minimum distance of codes constructible in polynomial time is improved for a wide range.