Nonadditive quantum error-correcting code
From MaRDI portal
Publication:3107641
DOI10.1103/PHYSREVLETT.101.090501zbMATH Open1228.81145arXiv0704.2122OpenAlexW1980903264WikidataQ59456267 ScholiaQ59456267MaRDI QIDQ3107641FDOQ3107641
Authors:
Publication date: 26 December 2011
Published in: Physical Review Letters (Search for Journal in Brave)
Abstract: We report the first nonadditive quantum error-correcting code, namely, a code which is a 12-dimensional subspace within a 9-qubit Hilbert space, that outperforms the optimal stabilizer code of the same length by encoding more levels while correcting arbitrary single-qubit errors.
Full work available at URL: https://arxiv.org/abs/0704.2122
Recommendations
Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Other types of codes (94B60)
Cites Work
- Error Correcting Codes in Quantum Theory
- Quantum Error Correction and Orthogonal Geometry
- Quantum error correction via codes over GF(4)
- Mixed-state entanglement and quantum error correction
- Multiparty entanglement in graph states
- Quantum weight enumerators
- Quantum codes of minimum distance two
- Simple Family of Nonadditive Quantum Codes
Cited In (10)
- Title not available (Why is that?)
- Quantum secret sharing with continuous variable graph state
- Nonlocal quantum information in bipartite quantum error correction
- Nonbinary quantum codes
- Quantum anonymous voting with unweighted continuous-variable graph states
- Codeword stabilized quantum codes: algorithm and structure
- Permutationally invariant codes for quantum error correction
- Non-Pauli observables for CWS codes
- Two Infinite Families of Nonadditive Quantum Error-Correcting Codes
- Simple Family of Nonadditive Quantum Codes
This page was built for publication: Nonadditive quantum error-correcting code
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107641)
