Dynamical localization simulated on a few-qubit quantum computer
- 28 May 2003
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 67 (5) , 052312
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 and then the localization length can be obtained with accuracy by means of order 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.
Keywords
All Related Versions
This publication has 33 references indexed in Scilit:
- Implementation of the Deutsch–Jozsa algorithm on an ion-trap quantum computerNature, 2003
- Experimental Implementation of the Quantum Baker’s MapPhysical Review Letters, 2002
- Manipulating the Quantum State of an Electrical CircuitScience, 2002
- Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonanceNature, 2001
- Implementation of the Quantum Fourier TransformPhysical Review Letters, 2001
- Implementation of a three-quantum-bit search algorithmApplied Physics Letters, 2000
- Using a quantum computer to investigate quantum chaosPhysical Review A, 1998
- The importance of resonances in microwave “ionization” of excited hydrogen atomsPhysics Reports, 1995
- Simple models of quantum chaos: Spectrum and eigenfunctionsPhysics Reports, 1990
- Chaos, Quantum Recurrences, and Anderson LocalizationPhysical Review Letters, 1982