|
| related topics |
| {error, code, errors} |
| {let, theorem, proof} |
| {group, space, representation} |
| {equation, function, exp} |
| {information, entropy, channel} |
| {algorithm, log, probability} |
| {vol, operators, histories} |
|
Asymptotically Good Quantum Codes
A. Ashikhmin, S. Litsyn, M. A. Tsfasman
abstract: Using algebraic geometry codes we give a polynomial construction of quantum
codes with asymptotically non-zero rate and relative distance.
- oai_identifier:
- oai:arXiv.org:quant-ph/0006061
- categories:
- quant-ph
- comments:
- 15 pages, 1 figure
- doi:
- 10.1103/PhysRevA.63.032311
- arxiv_id:
- quant-ph/0006061
- created:
- 2000-06-13
Full article ▸
|
|
| related documents |
| 0312164v1 |
| 9611001v2 |
| 0412136v2 |
| 0701065v2 |
| 0101106v3 |
| 9711021v1 |
| 0405183v1 |
| 0606077v1 |
| 0603206v1 |
| 0208130v1 |
| 0107111v2 |
| 0304013v1 |
| 0211003v1 |
| 0406226v1 |
| 0411027v1 |
| 0509066v1 |
| 0305005v1 |
| 0308034v1 |
| 9912114v2 |
| 0305031v1 |
| 0211034v2 |
| 0211014v1 |
| 0402060v2 |
| 0208167v1 |
| 0607143v3 |
|