THE ARNOLD CAT - FAILURE OF THE CORRESPONDENCE PRINCIPLE

The classical Hamiltonian H = p2/2m + epsilon(q2/2)SIGMA-delta[s - (t/T)] has an integrable mapping of the plane, [q(n + 1), p(n + 1)] = [q(n) + p(n), q(n) + 2p(n)], as its equations of motion. But then by introducing periodic boundary conditions via (mod 1) applied to both q and p variables, the equations of motion become the Arnol'd cat map, [q(n + 1), p(n + 1) = [q(n) + p(n), q(n) + 2p(n)], (mod 1), revealing it to be one of the simplest fully chaotic systems which can be derived from a Hamiltonian and analyzed. Consequently, we here quantize the Arnol'd cat and examine its quantum motion for signs of chaos using algorithmic complexity as the litmus. Our analysis reveals that the quantum cat is not chaotic in the deep quantum domain nor does it become chaotic in the classical limit as required by the correspondence principle. We therefore conclude that the correspondence principle, as defined herein, fails for the quantum Arnol'd cat.