Dynamical localization simulated on a few qubits quantum computer

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\ge \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.

8 pages, 8 figures

References in corpus (1)

• Statistical properties of eigenvalues for an operating quantum computer with static imperfections

Cited by in corpus (9)

• Simulating noisy quantum protocols with quantum trajectories
• Quantum Computation of a Complex System : the Kicked Harper Model
• Quantum computation of the Anderson transition in presence of imperfections
• Quantum computation and analysis of Wigner and Husimi functions: toward a quantum image treatment
• Classical versus quantum errors in quantum computation of dynamical systems
• Intermediate quantum maps for quantum computation
• Entanglement Echoes in Quantum Computation
• Quantum computing and information extraction for a dynamical quantum system
• Suppressing decoherence of quantum algorithms by jump codes