Quantum Simulation of Gauge Theories for Particle and Nuclear Physics

TL;DR

This paper discusses how quantum simulation can revolutionize lattice gauge theories in particle and nuclear physics by overcoming classical computational limitations through polynomially efficient quantum algorithms.

Contribution

It introduces the quantum-computational lattice-field-theory program, highlighting recent progress, strategies, and future challenges in leveraging quantum computing for gauge theories.

Findings

Quantum algorithms offer polynomial efficiency over classical methods.

Progress in theory, algorithms, and hardware implementations has been achieved.

Quantum simulation can address problems involving dense matter and dynamical phenomena.

Abstract

Lattice field theory, along with its algorithmic and hardware ecosystems, has been at the forefront of computational particle and nuclear physics. It continues to deliver impressive results on the hadronic spectrum, structure, decays, and reactions. Yet, this vigorous campaign has fallen short in addressing a range of problems involving dense matter and general dynamical phenomena. The reason is that such problems require an exponential scaling of computing time and space in system size. Quantum simulation, enabled by quantum-computing algorithms and hardware technology, promises a way forward by offering several polynomially efficient algorithms compared with their inefficient classical counterparts. Lattice gauge theorists have engaged in a multi-pronged program to leverage such new possibilities, and have steadily advanced the state of theory, algorithm, and hardware implementations and co-design. In this talk, I motivate the quantum-computational lattice-field-theory program; introduce the questions such a program is expected to address and the strategies it involves; report on recent progress; and end with a note on challenges and opportunities ahead.