2006/09/29 by Todd A. Brun, Todd Brun, Igor Devetak +1 · 7 citations
Computer Science · Physics and Astronomy · #Computer science #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum capacity #Quantum entanglement #Quantum mechanics #Quantum network #Quantum-Dot Cellular Automata #Theoretical computer science #quant-ph
paper · pdf · doi:10.1126/science.1131563
published as Science 314, 436-439 (2006). · 17 pages, no figure. To appear in Science
openalex publication_date 2006/09/29 · arxiv created 2006/10/11 · arxiv updated 2009/12/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We show how entanglement shared between encoder and decoder can simplify the theory of quantum error correction. The entanglement-assisted quantum codes we describe do not require the dual-containing constraint necessary for standard quantum error-correcting codes, thus allowing us to "quantize" all of classical linear coding theory. In particular, efficient modern classical codes that attain the Shannon capacity can be made into entanglement-assisted quantum codes attaining the hashing bound (closely related to the quantum capacity). For systems without large amounts of shared entanglement, these codes can also be used as catalytic codes, in which a small amount of initial entanglement enables quantum communication.