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.
- Received 2 October 2000
DOI:https://doi.org/10.1103/PhysRevLett.86.2890
©2001 American Physical Society