Exponential gain in quantum computing of quantum chaos and localization.
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.
Georgeot
B
B
Laboratoire de Physique Quantique, UMR 5626 du CNRS, Université Paul Sabatier, F-31062 Toulouse Cedex 4, France.
Shepelyansky
D L
DL