Quantum Algorithmic Integrability: The Metaphor of Polygonal Billiards
Giorgio Mantica
Abstract
An elementary application of Algorithmic Complexity Theory to the polygonal approximations of curved billiards-integrable and chaotic-unveils the equivalence of this problem to the procedure of quantization of classical systems: the scaling relations for the average complexity of symbolic trajectories are formally the same as those governing the semi-classical limit of quantum systems. Two cases-the circle, and the stadium-are examined in detail, and are presented as paradigms.
Create a lesson
Related papers
Chaotic eigenfunctions in phase space
S. Nonnenmacher, A. Voros
Improved control of delayed measured systems
Jens Christian Claussen, Heinz Georg Schuster
The accurate and comprehensive model of thin fluid flows with inertia on curved substrates
A. J. Roberts, Zhenquan Li
On periodic solutions of a Hamilton-Jacobi equation with periodic forcing
Andrei Sobolevskii
Drifters dispersion in the Adriatic Sea: Lagrangian data and chaotic model
Guglielmo Lacorata, Erik Aurell, Angelo Vulpiani
Generalized multibaker maps for open dissipative systems
Z. Kaufmann, P. Szépfalusy