Feynman checkers: towards algorithmic quantum theory
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2020
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915141703958528 |
|---|---|
| author | Skopenkov, M. Ustinov, A. |
| author_facet | Skopenkov, M. Ustinov, A. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2007_12879 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | Feynman checkers: towards algorithmic quantum theory Skopenkov, M. Ustinov, A. Mathematical Physics Combinatorics Number Theory 82B20, 11L03, 68Q12, 81P68, 81T25, 81T40, 05A17, 11P82, 33C45 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. |
| title | Feynman checkers: towards algorithmic quantum theory |
| topic | Mathematical Physics Combinatorics Number Theory 82B20, 11L03, 68Q12, 81P68, 81T25, 81T40, 05A17, 11P82, 33C45 |
| url | https://arxiv.org/abs/2007.12879 |