|
| related topics |
| {classical, space, random} |
| {trap, ion, state} |
| {qubit, qubits, gate} |
| {algorithm, log, probability} |
| {state, algorithm, problem} |
| {measurement, state, measurements} |
| {state, phys, rev} |
| {state, states, coherent} |
|
Implementing the quantum random walk
B. C. Travaglione, G. J. Milburn
abstract: Recently, several groups have investigated quantum analogues of random walk
algorithms, both on a line and on a circle. It has been found that the quantum
versions have markedly different features to the classical versions. Namely,
the variance on the line, and the mixing time on the circle increase
quadratically faster in the quantum versions as compared to the classical
versions. Here, we propose a scheme to implement the quantum random walk on a
line and on a circle in an ion trap quantum computer. With current ion trap
technology, the number of steps that could be experimentally implemented will
be relatively small. However, we show how the enhanced features of these walks
could be observed experimentally. In the limit of strong decoherence, the
quantum random walk tends to the classical random walk. By measuring the degree
to which the walk remains `quantum', this algorithm could serve as an important
benchmarking protocol for ion trap quantum computers.
- oai_identifier:
- oai:arXiv.org:quant-ph/0109076
- categories:
- quant-ph
- comments:
- 5 pages, 4 figures (1 large)
- doi:
- 10.1103/PhysRevA.65.032310
- arxiv_id:
- quant-ph/0109076
- journal_ref:
- Physical Review A, Vol 65, 032310 (2002)
- created:
- 2001-09-16
Full article ▸
|
|
| related documents |
| 0602007v1 |
| 0102032v1 |
| 0401142v2 |
| 0108054v1 |
| 0407128v1 |
| 0309192v1 |
| 0509141v2 |
| 9706014v1 |
| 0112100v1 |
| 0308164v2 |
| 0406039v2 |
| 0311009v1 |
| 0302192v2 |
| 0508057v2 |
| 9910068v2 |
| 0206103v5 |
| 0302169v1 |
| 0410103v2 |
| 0609112v2 |
| 0511108v2 |
| 0703200v3 |
| 0307119v1 |
| 0003005v1 |
| 0403154v1 |
| 0406072v1 |
|