In these proceedings, we review recent advances in applying quantum computing to lattice field theory. Quantum computing offers the prospect to simulate lattice field theories in parameter regimes that are largely inaccessible with the conventional Monte Carlo approach, such as the sign-problem afflicted regimes of finite baryon density, topological terms, and out-of-equilibrium dynamics. First proof-of-concept quantum computations of lattice gauge theories in (1+1) dimensions have been accomplished, and first resource-efficient quantum algorithms for lattice gauge theories in (1+1) and (2+1) dimensions have been developed. The path towards quantum computations of (3+1)-dimensional lattice gauge theories, including Lattice QCD, requires many incremental steps of improving both quantum hardware and quantum algorithms. After reviewing these requirements and recent advances, we discuss the main challenges and future directions.
[1]
Quantum supremacy?
,
2019,
New Scientist.
[2]
Thomas F. Wenisch,et al.
Proceedings of the 52nd Annual IEEE/ACM International Symposium on Microarchitecture
,
2019,
MICRO.
[3]
W. Hager,et al.
and s
,
2019,
Shallow Water Hydraulics.
[4]
W. Marsden.
I and J
,
2012
.
[5]
J. von Neumann,et al.
Probabilistic Logic and the Synthesis of Reliable Organisms from Unreliable Components
,
1956
.