Quantum Algorithms for Fermionic Quantum Field Theories
Stephen P. Jordan, Keith S. M. Lee, and John Preskill
TL;DR
This paper presents a quantum algorithm for simulating fermionic quantum field theories, specifically the Gross-Neveu model, achieving polynomial runtime in precision and energy, advancing quantum simulation of particle physics.
Contribution
It introduces novel techniques to handle fermionic fields in quantum algorithms, extending previous scalar field work to more complex fermionic theories.
Findings
Developed a polynomial-time quantum algorithm for fermionic scattering amplitudes.
Applied the algorithm to the massive Gross-Neveu model in two dimensions.
Progress towards efficient quantum simulation of the Standard Model.
Abstract
Extending previous work on scalar field theories, we develop a quantum algorithm to compute relativistic scattering amplitudes in fermionic field theories, exemplified by the massive Gross-Neveu model, a theory in two spacetime dimensions with quartic interactions. The algorithm introduces new techniques to meet the additional challenges posed by the characteristics of fermionic fields, and its run time is polynomial in the desired precision and the energy. Thus, it constitutes further progress towards an efficient quantum algorithm for simulating the Standard Model of particle physics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParticle physics theoretical and experimental studies · Quantum Chromodynamics and Particle Interactions · Quantum Computing Algorithms and Architecture