|
related topics |
{error, code, errors} |
{let, theorem, proof} |
{equation, function, exp} |
{group, space, representation} |
{states, state, optimal} |
{time, systems, information} |
{algorithm, log, probability} |
{information, entropy, channel} |
|
Quantum error-correcting codes associated with graphs
D. Schlingemann, R. F. Werner
abstract: We present a construction scheme for quantum error correcting codes. The
basic ingredients are a graph and a finite abelian group, from which the code
can explicitly be obtained. We prove necessary and sufficient conditions for
the graph such that the resulting code corrects a certain number of errors.
This allows a simple verification of the 1-error correcting property of
fivefold codes in any dimension. As new examples we construct a large class of
codes saturating the singleton bound, as well as a tenfold code detecting 3
errors.
- oai_identifier:
- oai:arXiv.org:quant-ph/0012111
- categories:
- quant-ph cs.IT math-ph math.IT math.MP
- comments:
- 8 pages revtex, 5 figures
- arxiv_id:
- quant-ph/0012111
- created:
- 2000-12-20
Full article ▸
|
|
related documents |
0701037v2 |
0312164v1 |
9612048v1 |
9603022v2 |
0405183v1 |
0201140v1 |
9610043v1 |
0610084v1 |
0211014v1 |
0412136v2 |
0607143v3 |
0701065v2 |
0510107v1 |
0206169v2 |
0101106v3 |
0309057v1 |
0603206v1 |
0308151v2 |
0305031v1 |
0101030v3 |
0305005v1 |
0509066v1 |
0411027v1 |
0107111v2 |
0406072v1 |
|