|
| related topics |
| {classical, space, random} |
| {qubit, qubits, gate} |
| {time, wave, function} |
| {spin, pulse, spins} |
| {energy, state, states} |
| {state, algorithm, problem} |
| {error, code, errors} |
| {algorithm, log, probability} |
| {level, atom, field} |
| {measurement, state, measurements} |
| {time, decoherence, evolution} |
|
Dynamical localization simulated on a few qubits quantum computer
Giuliano Benenti, Giulio Casati, Simone Montangero, Dima L. Shepelyansky
abstract: We show that a quantum computer operating with a small number of qubits can
simulate the dynamical localization of classical chaos in a system described by
the quantum sawtooth map model. The dynamics of the system is computed
efficiently up to a time $t\geq \ell$, and then the localization length $\ell$
can be obtained with accuracy $\nu$ by means of order $1/\nu^2$ computer runs,
followed by coarse grained projective measurements on the computational basis.
We also show that in the presence of static imperfections a reliable
computation of the localization length is possible without error correction up
to an imperfection threshold which drops polynomially with the number of
qubits.
- oai_identifier:
- oai:arXiv.org:quant-ph/0210052
- categories:
- quant-ph cond-mat nlin.CD
- comments:
- 8 pages, 8 figures
- doi:
- 10.1103/PhysRevA.67.052312
- arxiv_id:
- quant-ph/0210052
- journal_ref:
- Phys. Rev. A 67, 052312 (2003)
- created:
- 2002-10-08
Full article ▸
|
|
| related documents |
| 0510037v1 |
| 0504224v1 |
| 0406109v1 |
| 0302161v1 |
| 9905051v1 |
| 0110109v1 |
| 0611265v1 |
| 9909085v3 |
| 0402010v1 |
| 0701128v1 |
| 0611191v1 |
| 0603212v1 |
| 0408183v3 |
| 0511108v2 |
| 0302169v1 |
| 0609112v2 |
| 0406039v2 |
| 0310125v1 |
| 0309192v1 |
| 0311009v1 |
| 0410103v2 |
| 0401142v2 |
| 0302192v2 |
| 0603261v2 |
| 0401103v1 |
|