Feynman checkers: towards algorithmic quantum theory

DOI10.1070/rm10025zbMath1526.82005arXiv2007.12879OpenAlexW3045354808MaRDI QIDQ6137292

Unnamed Author, Alexey Ustinov

Publication date: 1 September 2023

Published in: Russian Mathematical Surveys (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2007.12879

zbMATH Keywords

Young diagramIsing modelDirac equationquantum walkstationary phase methodFeynman checkerboard

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Two-dimensional field theories, conformal field theories, etc. in quantum mechanics (81T40) Quantum computation (81P68) Orthogonal polynomials and functions of hypergeometric type (Jacobi, Laguerre, Hermite, Askey scheme, etc.) (33C45) Quantum field theory on lattices (81T25) Phase transitions (general) in equilibrium statistical mechanics (82B26) Lattice systems (Ising, dimer, Potts, etc.) and systems on graphs arising in equilibrium statistical mechanics (82B20) Trigonometric and exponential sums (general theory) (11L03) Analytic theory of partitions (11P82) Time-dependent Schrödinger equations and Dirac equations (35Q41) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (3)

Feynman checkers: Number-theoretic properties ⋮ Discrete field theory: symmetries and conservation laws ⋮ Lattice equations and semiclassical asymptotics

This page was built for publication: Feynman checkers: towards algorithmic quantum theory