Quantum Error Correction Via Codes Over GF(4)

  title={Quantum Error Correction Via Codes Over GF(4)},
  author={A. Robert Calderbank and Eric M. Rains and Peter W. Shor and N. J. A. Sloane},
  journal={IEEE Trans. Inf. Theory},
The unreasonable effectiveness of quantum computing is founded on coherent quantum superposition or entanglement which allows a large number of calculations to be performed simultaneously. This coherence is lost as a quantum system interacts with its environment. In the present paper the problem of finding quantum-error-correcting codes is transformed into one of finding additive codes over the field GF(4) which are self-orthogonal with respect to a certain trace inner product. Many new codes… 

Tables from this paper

Stabilizer Codes and Quantum Error Correction
An overview of the field of quantum error correction and the formalism of stabilizer codes is given and a number of known codes are discussed, the capacity of a quantum channel, bounds on quantum codes, and fault-tolerant quantum computation are discussed.
Application of Classical Codes over GF(4) on Quantum Error Correction Codes
This research studies the construction of classical linear code over Galois field 4, which is self-orthogonal with Hermitian product and quantum stabilizer codes have been explained in detail to show the practicality of this construction.
New Families of Quantum Cyclic and Subsystem Codes for Asymmetric Quantum Channels
This paper further develops this theory of quantum error control codes and establishes the connection between asymmetric quantum codes and subsystem codes and pr esent families of subsystem and asymmetric Quantum Error Control Codes from classical BCH and RS codes.
Quantum Block and Synchronizable Codes Derived from Certain Classes of Polynomials
This paper presents a construction of classical codes based on certain class of polynomials and gives a new class of quantum synchronizable codes with highest possible tolerance against misalignment from duadic codes.
Encoding entanglement-assisted quantum stabilizer codes
An iterative algorithm from which a quantum circuit composed of CNOT, H, and S gates can be derived directly with complexity O(n2) to encode the qubits being sent to design EA quantum error-correcting codes with low encoding complexity.
Some construction of entanglement-assisted quantum MDS codes
By employing generalized Reed–Solomon codes, several classes of entanglement-assisted quantum maximum distance separable (EAQMDS) codes are constructed, whose required number of maximally entangled states is more flexible.
Asymmetric Quantum Cyclic Codes
This paper presents two generic methods to derive asymmetric quantum cyclic codes using the generator polynomials and defining sets of classicalcyclic codes, which allow to construct several families of asymmetry quantum BCH, RS, and RM codes.
Quantum Decoding with Venn Diagrams
This work revisits the error correction in a noisy quantum channel so as to make it intelligible to engineers.
Quantum computing and error correction
In order to achieve the best noise tolerance in the presence of noise and imprecision throughout the computer, a hierarchical construction of a quantum computer is proposed.
New optimal quantum convolutional codes
This paper constructs some classes of quantum convolutional codes by employing classical constacyclic codes, and finds that these codes are optimal in the sense that they attain the Singleton bound for pure Convolutional stabilizer codes.


Error Correcting Codes in Quantum Theory.
  • Steane
  • Physics
    Physical review letters
  • 1996
It is shown that a pair of states which are, in a certain sense, “macroscopically different,” can form a superposition in which the interference phase between the two parts is measurable, providing a highly stabilized “Schrodinger cat” state.
Non-binary unitary error bases and quantum codes
Error operator bases for systems of any dimension are defined and natural generalizations of the bit-flip/ sign-change error basis for qubits are given. These bases allow generalizing the
Theory of fault-tolerant quantum computation
It is demonstrated that fault-tolerant universal computation is possible for any stabilizer code, including the five-quantum-bit code.
A nonadditive quantum code
This Letter presents the first example of a code that is better than any code of this type, which encodes six states in five qubits and can correct the erasure of any single qubit.
Perfect Quantum Error Correcting Code.
A quantum error correction code which protects a qubit of information against general one qubit errors and encode the original state by distributing quantum information over five qubits, the minimal number required for this task.
A Theory of Quantum Error-Correcting Codes
A general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions is developed and necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction are obtained.
Theory of quantum error-correcting codes
A general theory of quantum error correction based on encoding states into larger Hilbert spaces subject to known interactions is developed and necessary and sufficient conditions for the perfect recovery of an encoded state after its degradation by an interaction are obtained.
Fault-Tolerant Error Correction with Efficient Quantum Codes.
This work exhibits a simple, systematic procedure for detecting and correcting errors using any of the recently reported quantum error-correcting codes, derived using a recently introduced group-theoretic framework for unifying all known quantum codes.
Quantum stabilizer codes and classical linear codes
We show that within any quantum stabilizer code there lurks a classical binary linear code with similar error-correcting capabilities, thereby demonstrating new connections between quantum codes and
Eecient Computations of Encodings for Quantum Error Correction Typeset Using Revt E X
We show how, given any set of generators of the stabilizer of a quantum code, an eecient gate array that computes the codewords can be constructed. For an n-qubit code whose stabilizer has d