Exponential Gain in Quantum Computing of Quantum Chaos and Localization
- 26 March 2001
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review Letters
- Vol. 86 (13) , 2890-2893
- https://doi.org/10.1103/physrevlett.86.2890
Abstract
We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization, and Anderson transition can be modeled efficiently on a quantum computer. We also show that a similar algorithm simulates efficiently classical chaos in certain area-preserving maps.All Related Versions
This publication has 22 references indexed in Scilit:
- Spin-Spin Interaction and Spin Squeezing in an Optical LatticePhysical Review Letters, 1999
- Quantum computingReports on Progress in Physics, 1998
- Quantum Mechanics Helps in Searching for a Needle in a HaystackPhysical Review Letters, 1997
- Universal Quantum SimulatorsScience, 1996
- Quantum computation and Shor's factoring algorithmReviews of Modern Physics, 1996
- Regular and Chaotic DynamicsPublished by Springer Nature ,1992
- Simple models of quantum chaos: Spectrum and eigenfunctionsPhysics Reports, 1990
- Quantum mechanical computersFoundations of Physics, 1986
- Chaos, Quantum Recurrences, and Anderson LocalizationPhysical Review Letters, 1982
- A universal instability of many-dimensional oscillator systemsPhysics Reports, 1979