Stable quantum computation of unstable classical chaos

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