arXiv · chao-dyn/9906018
Quantum Algorithmic Integrability: The Metaphor of Polygonal Billiards
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Giorgio Mantica. 1999-06-10. Quantum Algorithmic Integrability: The Metaphor of Polygonal Billiards. https://doi.org/10.1103/physreve.61.6434
Cite the original work for its findings. Save a collection to share your selection of sources.