On subsystem codes beating the quantum Hamming or Singleton bound
From MaRDI portal
Publication:5443627
DOI10.1098/rspa.2007.0028zbMath1133.81009arXivquant-ph/0703213OpenAlexW2044740152MaRDI QIDQ5443627
Andreas Klappenecker, Pradeep Kiran Sarvepalli
Publication date: 21 February 2008
Published in: Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0703213
Related Items (8)
Encoding classical information in gauge subsystems of quantum codes ⋮ New MDS operator quantum error-correcting codes derived from constacyclic codes over \(\mathbb{F}_{q^2} + v\mathbb{F}_{q^2}\) ⋮ Theory behind quantum error correcting codes: an overview ⋮ Decoherence mitigation by embedding a logical qubit in a qudit ⋮ Generalized multiplicative domains and quantum error correction ⋮ Quantum Serial Turbo Codes ⋮ CONSTRUCTIONS OF SUBSYSTEM CODES OVER FINITE FIELDS ⋮ Some constructions of optimal subsystem codes derived from GRS codes
Cites Work
- Unnamed Item
- Unnamed Item
- Noiseless subsystems for collective rotation channels in quantum information theory
- Nonbinary Stabilizer Codes Over Finite Fields
- Clifford Code Constructions of Operator Quantum Error-Correcting Codes
- Nonbinary quantum codes
- Upper bounds on the size of quantum codes
- EFFICIENT QUANTUM CIRCUITS FOR NON-QUBIT QUANTUM ERROR-CORRECTING CODES
This page was built for publication: On subsystem codes beating the quantum Hamming or Singleton bound