Simple Family of Nonadditive Quantum Codes

DOI10.1103/PHYSREVLETT.99.130505zbMATH Open1228.81139arXivquant-ph/0701065OpenAlexW2592557401WikidataQ81426194 ScholiaQ81426194MaRDI QIDQ3107752FDOQ3107752

Authors: John A. Smolin, Graeme Smith, S. Wehner 

Publication date: 26 December 2011

Published in: Physical Review Letters (Search for Journal in Brave)

Abstract: Most known quantum codes are additive, meaning the codespace can be described as the simultaneous eigenspace of an abelian subgroup of the Pauli group. While in some scenarios such codes are strictly suboptimal, very little is understood about how to construct nonadditive codes with good performance. Here we present a family of nonadditive quantum codes for all odd blocklengths, n, that has a particularly simple form. Our codes correct single qubit erasures while encoding a higher dimensional space than is possible with an additive code or, for n of 11 or greater, any previous codes.

Full work available at URL: https://arxiv.org/abs/quant-ph/0701065

Recommendations

• Two Infinite Families of Nonadditive Quantum Error-Correcting Codes
• Publication:4939165
• Nonadditive quantum error-correcting code
• A new description of the additive quantum codes
• Some families of quantum BCH codes
• Nonbinary quantum codes
• Nonbinary quantum stabilizer codes
• Nonbinary quantum Reed-Solomon codes
• Some families of optimal quantum codes derived from constacyclic codes
• New quantum codes from constacyclic and additive constacyclic codes

Mathematics Subject Classification ID

Cryptography (94A60) Quantum computation (81P68) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94)

Cites Work

• Quantum error correction via codes over GF(4)
• Mixed-state entanglement and quantum error correction
• Quantum codes of minimum distance two

Cited In (8)

• Title not available (Why is that?)
• Inhomogeneous quantum codes. II: Non-additive case
• Non-stabilizer quantum codes from Abelian subgroups of the error group
• 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
• Nonadditive quantum error-correcting code

This page was built for publication: Simple Family of Nonadditive Quantum Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3107752)