Quantum Simulation of Gauge Theories for Particle and Nuclear Physics

• URL: http://arxiv.org/abs/2605.20417v1
• Date: Tue, 19 May 2026 19:12:11 GMT
• Title: Quantum Simulation of Gauge Theories for Particle and Nuclear Physics
• Abstract summary: Lattice field theory has been at the forefront of computational particle and nuclear physics.<n>It continues to deliver impressive results on the hadronic spectrum, structure, decays, and reactions.<n>I motivate the quantum-computational lattice-field-theory program.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• Quantum Annealing: Optimisation, Sampling, and Many-Body Dynamics [0.10195618602298682]
  Quantum annealers realise programmable spin systems with thousands ofbits.<n>Modern quantum annealers function as experimental platforms for studying nonequilibrium manybody quantum dynamics.<n>We discuss applications ranging from optimisation and machine learning to quantum simulation and manybody physics.
  arXiv  Detail & Related papers  (2026-05-07T18:57:31Z)
• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Quantum Computing and Tensor Networks for Laminate Design: A Novel Approach to Stacking Sequence Retrieval [1.6421520075844793]
  A prime example is the weight optimization of laminated composite materials, which to this day remains a formidable problem. The rapidly developing field of quantum computation may offer novel approaches for addressing these intricate problems.
  arXiv  Detail & Related papers  (2024-02-09T15:01:56Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Near-Term Quantum Computing Techniques: Variational Quantum Algorithms, Error Mitigation, Circuit Compilation, Benchmarking and Classical Simulation [5.381727213688375]
  We are still a long way from reaching the maturity of a full-fledged quantum computer. An outstanding challenge is to come up with an application that can reliably carry out a nontrivial task. Several near-term quantum computing techniques have been proposed to characterize and mitigate errors.
  arXiv  Detail & Related papers  (2022-11-16T07:53:15Z)
• Variational Quantum Algorithms for Computational Fluid Dynamics [0.0]
  Variational quantum algorithms are particularly promising since they are comparatively noise tolerant. We show how variational quantum algorithms can be utilized in computational fluid dynamics. We argue that a quantum advantage over classical computing methods could be achieved by the end of this decade.
  arXiv  Detail & Related papers  (2022-09-11T18:49:22Z)
• Quantum Simulation on Noisy Superconducting Quantum Computers [0.0]
  Quantum simulation is a potentially powerful application of quantum computing. There is little introductory literature or demonstrations of the topic at a graduate or undergraduate student level. This artificially raises the barrier to entry into the field which already has a limited workforce.
  arXiv  Detail & Related papers  (2022-09-06T19:44:18Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Electronic structure with direct diagonalization on a D-Wave quantum annealer [62.997667081978825]
  This work implements the general Quantum Annealer Eigensolver (QAE) algorithm to solve the molecular electronic Hamiltonian eigenvalue-eigenvector problem on a D-Wave 2000Q quantum annealer. We demonstrate the use of D-Wave hardware for obtaining ground and electronically excited states across a variety of small molecular systems.
  arXiv  Detail & Related papers  (2020-09-02T22:46:47Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.