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

Series on knots and everything

Discrete physics and the Dirac equation

Louis Hirsch Kauffman, H. Pierre Noyes

Published Sep 1, 2001• 0 citations
Publisher

Abstract

We rewrite the 1 + 1 Dirac equation in light cone coordinates in two significant forms, and solve them exactly using the classical calculus of finite differences. The complex form yields “Feynman's checkerboard” - a weighted sum over lattice paths. The rational, real form can also be interpreted in terms of bit-strings.
DOI
10.1142/9789812810090_0013

Related papers

Notes on The Feynman Checkerboard Problem

Keith A. Earle

The Feynman checkerboard problem is an interesting path integral approach to the Dirac equation in `1+1' dimensions. I compare two approaches reported in the literature and show how they may be reconciled. Some physical insights may be gleaned from this approach.

arXiv:1012.1564•Dec 7, 2010•3 citations

De la combinatoire du modèle de l'échiquier de Feynman et des fonctions spéciales

J. G. Williams

The exact solution of the Feynman checkerboard model is given both in terms of the hypergeometric series and in terms of Jacobi polynomials. It is shown how this leads, in the continuous limit, to the Dirac equation in two-dimensional space-time.

Canadian Journal of Physics•Jul 1, 1984•0 citations

Discretizing the one-dimensional Dirac equation

P. P. F Wessels, W.J. Caspers, F.W. Wiegel

We suggest a discretization of the Dirac equation based on time symmetry. This iterative scheme is correct to second order in ε, the lattice distance in time, and can therefore be considered as an improvement to the master equation suggested implicitly by Gaveau et al. ( Phys. Rev. Lett. 53 (1984) 419), which generates the Feynman checkerboard propagator. Due to time symmetry this new scheme automatically conserves probability density.

Europhysics Letters (EPL)•Apr 15, 1999•5 citations

Feynman Checkerboard as a Model of Discrete Space-Time

Hanna, Edward

In 1965, Feynman wrote of using a lattice containing one dimension of space and one dimension of time to derive aspects of quantum mechanics. Instead of summing the behavior of all possible paths as he did, this paper will consider the motion of single particles within this discrete Space-Time lattice, sometimes called Feynman's Checkerboard. This empirical approach yielded several predicted emergent properties for a discrete Space-Time lattice, one of which is novel and testable.

arXiv:cs/0607018•Jul 6, 2006•1 citation

Quantum lattice algorithms: similarities and connections to some classic finite difference algorithms

Paul J. Dellar

Quantum lattice algorithms originated with the Feynman checkerboard model for the one-dimensional Dirac equation. They offer discrete models of quantum mechanics in which the complex numbers representing wavefunction values on a discrete spatial lattice evolve through discrete unitary operations. This paper draws together some of the identical, or at least unitarily equivalent, algorithms that have appeared in three largely disconnected strands of research. Treated as conventional numerical algorithms, they are all only first order accurate under refinement of the discrete space/time grid, but may be raised to second order by a unitary change of variables. Much more efficient implementations arise from replacing the evolution through a sequence of unitary intermediate steps with a short path integral formulation that expresses the wavefunction at each spatial point on the most recent time level as a linear combination of values at immediately preceding time levels and neighbouring spatial points. In one dimension, a particularly elegant reformulation replaces two variables at two time levels with a single variable over three time levels. The resulting algorithm is a variational integrator arising from a discrete action principle, and coincides with the Ablowitz–Kruskal–Ladik finite difference scheme for the Klein–Gordon equation.

ESAIM Proceedings and Surveys•Dec 1, 2015•3 citations

Feynman path integral for the Dirac equation

Rosalba Mendoza Suárez

The evolution operator for the Dirac equation is expressed as a sequential Feynman path integral. The usual approximations in terms of integrals over finite-dimensional spaces have been explicitly calculated and written in terms of translation operators. This expression should lend itself well to numerical approximations.

Journal of Physics A Mathematical and General•Apr 1, 1984•7 citations
Quantum lattice algorithms originated with the Feynman checkerboard model for the one-dimensional Dirac equation. They offer discrete models of quantum mechanics in which the complex numbers representing wavefunction values on a discrete spatial lattice evolve through discrete unitary operations. This paper draws together some of the identical, or at least unitarily equivalent, algorithms that have appeared in three largely disconnected strands of research. Treated as conventional numerical algorithms, they are all only first order accurate under refinement of the discrete space/time grid, but may be raised to second order by a unitary change of variables. Much more efficient implementations arise from replacing the evolution through a sequence of unitary intermediate steps with a short path integral formulation that expresses the wavefunction at each spatial point on the most recent time level as a linear combination of values at immediately preceding time levels and neighbouring spatial points. In one dimension, a particularly elegant reformulation replaces two variables at two time levels with a single variable over three time levels. The resulting algorithm is a variational integrator arising from a discrete action principle, and coincides with the Ablowitz–Kruskal–Ladik finite difference scheme for the Klein–Gordon equation.