|
| related topics |
| {error, code, errors} |
| {qubit, qubits, gate} |
| {let, theorem, proof} |
| {group, space, representation} |
| {algorithm, log, probability} |
| {states, state, optimal} |
| {state, states, entangled} |
| {entanglement, phys, rev} |
|
Efficient Quantum Circuits for Non-Qubit Quantum Error-Correcting Codes
Markus Grassl, Martin Roetteler, Thomas Beth
abstract: We present two methods for the construction of quantum circuits for quantum
error-correcting codes (QECC). The underlying quantum systems are tensor
products of subsystems (qudits) of equal dimension which is a prime power. For
a QECC encoding k qudits into n qudits, the resulting quantum circuit has
O(n(n-k)) gates. The running time of the classical algorithm to compute the
quantum circuit is O(n(n-k)^2).
- oai_identifier:
- oai:arXiv.org:quant-ph/0211014
- categories:
- quant-ph
- comments:
- 18 pages, submitted to special issue of IJFCS
- doi:
- 10.1142/S0129054103002011
- arxiv_id:
- quant-ph/0211014
- journal_ref:
- International Journal of Foundations of Computer Science (IJFCS),
Vol. 14, No. 5 (2003), pp. 757-775
- created:
- 2002-11-04
Full article ▸
|
|
| related documents |
| 9608028v1 |
| 0405183v1 |
| 0006061v1 |
| 9704002v1 |
| 0510107v1 |
| 0701065v2 |
| 0412136v2 |
| 0312164v1 |
| 0607143v3 |
| 0507036v3 |
| 0201140v1 |
| 0509066v1 |
| 0504197v1 |
| 0505009v4 |
| 0408064v1 |
| 0610214v3 |
| 0411027v1 |
| 0601183v1 |
| 0211085v2 |
| 0308034v1 |
| 0505122v2 |
| 0512058v3 |
| 0411058v1 |
| 0410145v2 |
| 0606077v1 |
|