Class of quantum error-correcting codes saturating the quantum Hamming bound.

  title={Class of quantum error-correcting codes saturating the quantum Hamming bound.},
  journal={Physical review. A, Atomic, molecular, and optical physics},
  volume={54 3},
  • Gottesman
  • Published 29 April 1996
  • Physics, Medicine
  • Physical review. A, Atomic, molecular, and optical physics
I develop methods for analyzing quantum error-correcting codes, and use these methods to construct an infinite class of codes saturating the quantum Hamming bound. These codes encode {ital k}={ital n}{minus}{ital j}{minus}2 quantum bits (qubits) in {ital n}=2{sup {ital j}} qubits and correct {ital t}=1 error. {copyright} {ital 1996 The American Physical Society.} 
Degenerate quantum codes and the quantum Hamming bound
The parameters of a nondegenerate quantum code must obey the Hamming bound. An important open problem in quantum coding theory is whether the parameters of a degenerate quantum code can violate this
Progress on Problem about Quantum Hamming Bound for Impure Quantum Codes
A famous open problem in the theory of quantum error-correcting codes is whether or not the parameters of an impure quantum code can violate the quantum Hamming bound for pure quantum codes. We
Efficient Quantum Circuits For Non-Qubit Quantum Error-Correcting Codes
Two methods for the construction of quantum circuits for quantum error- correcting codes (QECC) using tensor products of subsystems (qudits) of equal dimension which is a prime power.
Quantum Error Correction Beyond the Bounded Distance Decoding Limit
The proposed quantum error correcting codes are based on the binary quasi-cyclic Calderbank, Shor, and Steane (CSS) codes and outperform the best known quantum codes and surpass the performance limit of the bounded distance decoder.
Entanglement-assisted quantum codes achieving the quantum singleton bound but violating the quantum hamming bound
An infinite family of degenerate entanglement-assisted quantum error-correcting codes (EAQECCs) are given and it is proved that the EA-quantum Hamming bound does not asymptotically hold for degenerate EAZECCs.
Concatenated Quantum Codes Constructible in Polynomial Time: Efficient Decoding and Error Correction
  • M. Hamada
  • Computer Science, Physics
    IEEE Transactions on Information Theory
  • 2008
A method for concatenating quantum error-correcting codes known as Calderbank-Shor-Steane (CSS) codes is presented, and codes that achieve a high rate in the Shannon-theoretic sense and that are decodable in polynomial time are presented.
Quantum error-correcting codes associated with graphs
It is proved necessary and sufficient conditions for the graph such that the resulting code corrects a certain number of errors, which allows a simple verification of the one-error correcting property of codes of length 5 in any dimension.
Lower bound for the quantum capacity of a discrete memoryless quantum channel
We generalize the random coding argument of stabilizer codes and derive a lower bound on the quantum capacity of an arbitrary discrete memoryless quantum channel. For the depolarizing channel, our
Quantum Error Correction Via Codes Over GF(4)
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.