Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer eBooks

Feynman's checkerboard and other games

Ted Jacobson A

Published Apr 6, 2008• 10 citations
Publisher
DOI
10.1007/3-540-15213-x_88

Related papers

Feynman's checkerboard

Pierre Cartier, Cécile DeWitt-Morette

Cambridge University Press eBooks•Nov 30, 2006•0 citations

Feynman checkers: towards algorithmic quantum theory

Михаил Борисович Скопенков, A. Ustinov

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.

arXiv:2007.12879•Jul 25, 2020•7 citations

Feynman checkers: towards algorithmic quantum theory

Mihail Borisovich Skopenkov, Alexey Vladimirovich Ustinov

We survey and develop the most elementary model of electron motion introduced by 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 Feynman problem 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 due to Narlikar from 1972 and to Sunada and 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. We also present a survey of known results on Feynman checkers. Bibliography: 53 titles.

Russian Mathematical Surveys•Jan 1, 2022•10 citations

A reformulation of the Feynman chessboard model

Garnet N. Ord

Journal of Statistical Physics•Jan 1, 1992•32 citations

Feynman checkers: the probability of direction reversal

Il'ya Igorevich Bogdanov

We study the most elementary model of electron motion introduced by R.Feynman in 1965. It is a game, in which a checker moves on a checkerboard by simple rules, and we count the turnings. The model is also known as one-dimensional quantum walk. In his publication, R.Feynman introduces a discrete version of path integral and poses the problem of computing the limit of the model when the lattice step and the average velocity tend to zero and time tends to infinity. We get a nontrivial advance in the problem on the mathematical level of rigor in a simple particular case; even this case requires methods not known before. We also prove a conjecture by I.Gaidai-Turlov, T.Kovalev, and A.Lvov on the limit probability of direction reversal in the model generalizing a recent result by A.Ustinov.

arXiv:2010.04583•Oct 9, 2020•5 citations

Quantum games

Παναγιώτης Αποστολίδης, Εύαγγελος Κ. Κοντονικολάου

•Jan 1, 2025•0 citations
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.
We survey and develop the most elementary model of electron motion introduced by 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 Feynman problem 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 due to Narlikar from 1972 and to Sunada and 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. We also present a survey of known results on Feynman checkers. Bibliography: 53 titles.
We study the most elementary model of electron motion introduced by R.Feynman in 1965. It is a game, in which a checker moves on a checkerboard by simple rules, and we count the turnings. The model is also known as one-dimensional quantum walk. In his publication, R.Feynman introduces a discrete version of path integral and poses the problem of computing the limit of the model when the lattice step and the average velocity tend to zero and time tends to infinity. We get a nontrivial advance in the problem on the mathematical level of rigor in a simple particular case; even this case requires methods not known before. We also prove a conjecture by I.Gaidai-Turlov, T.Kovalev, and A.Lvov on the limit probability of direction reversal in the model generalizing a recent result by A.Ustinov.