Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger Cat

Abstract

We show on the example of the Arnold cat map that classical chaotic systems can be simulated with exponential efficiency on a quantum computer. Although classical computer errors grow exponentially with time, the quantum algorithm with moderate imperfections is able to simulate accurately the unstable chaotic classical dynamics for long times. The algorithm can be easily implemented on systems of a few qubits.