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.
Codes for the quan tum erasure channel
3 Pith papers cite this work. Polarity classification is still indexing.
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.
citation-role summary
citation-polarity summary
fields
quant-ph 3verdicts
ACCEPT 3roles
background 1polarities
background 1representative citing papers
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.
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.
citing papers explorer
-
Stabilizer Codes and Quantum Error Correction
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.
-
The Heisenberg Representation of Quantum Computers
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.
-
Fault-tolerant quantum computation with a neutral atom processor
A 256-atom neutral ytterbium processor demonstrates fault-tolerant entanglement of 24 logical qubits and runs Bernstein-Vazirani on 28 logical qubits with better-than-physical error rates using erasure conversion.