|
| related topics |
| {error, code, errors} |
| {let, theorem, proof} |
| {group, space, representation} |
| {states, state, optimal} |
| {qubit, qubits, gate} |
| {information, entropy, channel} |
|
A simple family of nonadditive quantum codes
John A. Smolin, Graeme Smith, Stephanie Wehner
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.
- oai_identifier:
- oai:arXiv.org:quant-ph/0701065
- categories:
- quant-ph
- comments:
- 3 pages, new version with slight clarifications, no results are
changed
- doi:
- 10.1103/PhysRevLett.99.130505
- arxiv_id:
- quant-ph/0701065
- journal_ref:
- Phys. Rev. Lett. 99, 130505 (2007)
- created:
- 2007-01-11
- updated:
- 2007-03-20
Full article ▸
|
|
| related documents |
| 0101106v3 |
| 9711021v1 |
| 9711049v1 |
| 9704002v1 |
| 0607143v3 |
| 0405183v1 |
| 0509066v1 |
| 0510107v1 |
| 9611001v2 |
| 9608028v1 |
| 0412136v2 |
| 0006061v1 |
| 0201140v1 |
| 0507036v3 |
| 0612033v1 |
| 0606242v3 |
| 0703193v2 |
| 0701198v1 |
| 0603155v1 |
| 0605132v1 |
| 0610251v1 |
| 0701079v1 |
| 0701054v1 |
| 0603096v1 |
| 0610258v1 |
|