pith. machine review for the scientific record. sign in

arxiv: quant-ph/9610042 · v2 · submitted 1996-10-28 · 🪐 quant-ph

Recognition: unknown

Codes for the Quantum Erasure Channel

Authors on Pith no claims yet
classification 🪐 quant-ph
keywords codesquantumerasurechannelcorrectpositionsqubitsarbitrary
0
0 comments X
read the original abstract

The quantum erasure channel (QEC) is considered. Codes for the QEC have to correct for erasures, i. e., arbitrary errors at known positions. We show that four qubits are necessary and sufficient to encode one qubit and correct one erasure, in contrast to five qubits for unknown positions. Moreover, a family of quantum codes for the QEC, the quantum BCH codes, that can be efficiently decoded is introduced.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Stabilizer Codes and Quantum Error Correction

    quant-ph 1997-05 accept novelty 9.0

    The stabilizer code formalism is presented as a powerful group-theoretic tool for quantum error correction, enabling code construction, analysis of quantum channel capacity, bounds on codes, and fault-tolerant computation.

  2. The Heisenberg Representation of Quantum Computers

    quant-ph 1998-07 accept novelty 8.0

    Quantum states for error correction are described by their stabilizer, a commuting group of tensor products of Pauli matrices, enabling analysis of a rich class of quantum effects short of full quantum computation.