标题： 量子算法可积性：多边形弹球的隐喻 显示英文标题

标题： Quantum Algorithmic Integrability: The Metaphor of Polygonal Billiards

摘要： 算法复杂性理论在曲线弹球多边形逼近中的基本应用——可积与混沌——揭示了这个问题与经典系统量子化过程的等价性：符号轨迹的平均复杂性的标度关系在形式上与量子系统的半经典极限相同。 两种情况——圆和椭圆——被详细检查，并作为范例呈现。 显示英文摘要

摘要： 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.