费曼跳棋:迈向算法量子理论
Feynman checkers: towards algorithmic quantum theory
AI总结:
本文系统研究费曼跳棋模型,解决了费曼1965年提出的离散与连续模型一致性问题,改进了前人渐近结果,并首次证明小步长极限下的测度集中现象,同时完成模型的二次量子化。
摘要:
我们综述并发展了 R. Feynman 引入的最基本的电子运动模型。在这个游戏中,一个跳棋按照简单规则在棋盘上移动,我们统计其转向次数。费曼跳棋也被称为一维量子行走或虚温度下的伊辛模型。我们从数学上解决了 R. Feynman 于 1965 年提出的一个问题,即证明该离散模型(在大时间、小平均速度和小晶格步长条件下)与连续模型一致。我们研究了该模型的渐近性质(针对小晶格步长和大时间),改进了 J. Narlikar 于 1972 年以及 T. Sunada 和 T. Tate 于 2012 年的结果。我们首次观察并证明了小晶格步长极限下的测度集中现象。我们还对该模型进行了二次量子化。
英文摘要:
We survey and develop the most elementary model of electron motion introduced by R$.$Feynman. In this game, a checker moves on a checkerboard by simple rules, and we count the turns. Feynman checkers are also known as a one-dimensional quantum walk or an Ising model at imaginary temperature. We solve mathematically a problem by R$.$Feynman from 1965, which was to prove that the discrete model (for large time, small average velocity, and small lattice step) is consistent with the continuum one. We study asymptotic properties of the model (for small lattice step and large time) improving the results by J$.$Narlikar from 1972 and by T$.$Sunada-T$.$Tate from 2012. For the first time we observe and prove concentration of measure in the small-lattice-step limit. We perform the second quantization of the model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。