Exponential gain in quantum computing of quantum chaos and localization.

Area of Science:

• Quantum Computing
• Quantum Simulation
• Chaos Theory

Background:

• Classical algorithms struggle with simulating complex quantum systems like the quantum kicked rotator.
• Understanding quantum chaos, localization, and Anderson transitions is crucial in condensed matter physics.

Purpose of the Study:

• To present a quantum algorithm for simulating the quantum kicked rotator model.
• To demonstrate the potential of quantum computers for efficiently modeling physical problems.
• To explore quantum algorithms for simulating classical chaos.

Main Methods:

• Development of a novel quantum algorithm.
• Application of the algorithm to the quantum kicked rotator model.
• Adaptation of the algorithm for simulating classical chaos in area-preserving maps.

Main Results:

• The quantum algorithm achieves exponential speedup over classical algorithms for the quantum kicked rotator model.
• Efficient simulation of quantum chaos, localization, and Anderson transitions is demonstrated.
• The algorithm also efficiently simulates classical chaos in certain area-preserving maps.

Conclusions:

• Quantum computers can efficiently model complex quantum phenomena.
• The developed algorithm offers a powerful tool for studying quantum chaos and related physical problems.
• This work highlights the broader applicability of quantum algorithms in simulating both quantum and classical chaotic systems.