Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2006.03683

Sign Problems in Quantum Field Theory: Classical and Quantum Approaches

Lawrence, Scott

Published Jun 5, 2020• 12 citations
arXivHTMLPDF

Abstract

Monte Carlo calculations in the framework of lattice field theory provide non-perturbative access to the equilibrium physics of quantum fields. When applied to certain fermionic systems, or to the calculation of out-of-equilibrium physics, these methods encounter the so-called sign problem, and computational resource requirements become impractically large. These difficulties prevent the calculation from first principles of the equation of state of quantum chromodynamics, as well as the computation of transport coefficients in quantum field theories, among other things. This thesis details two methods for mitigating or avoiding the sign problem. First, via the complexification of the field variables and the application of Cauchy's integral theorem, the difficulty of the sign problem can be changed. This requires searching for a suitable contour of integration. Several methods of finding such a contour are discussed, as well as the procedure for integrating on it. Two notable examples are highlighted: in one case, a contour exists which entirely removes the sign problem, and in another, there is provably no contour available to improve the sign problem by more than a (parametrically) small amount. As an alternative, physical simulations can be performed with the aid of a quantum computer. The formal elements underlying a quantum computation - that is, a Hilbert space, unitary operators acting on it, and Hermitian observables to be measured - can be matched to those of a quantum field theory. In this way an error-corrected quantum computer may be made to serve as a well controlled laboratory. Precise algorithms for this task are presented, specifically in the context of quantum chromodynamics.

DOI
10.48550/arxiv.2006.03683

Related papers

Sign Problems in Quantum Field Theory: Classical and Quantum Approaches

Scott Ross Lawrence

Monte Carlo calculations in the framework of lattice field theory provide non- perturbative access to the equilibrium physics of quantum fields. When applied to certain fermionic systems, or to the calculation of out-of-equilibrium physics, these methods encounter the so-called sign problem, and computational resource require- ments become impractically large. These difficulties prevent the calculation from first principles of the equation of state of quantum chromodynamics, as well as the computation of transport coefficients in quantum field theories, among other things. This thesis details two methods for mitigating or avoiding the sign problem. First, via the complexification of the field variables and the application of Cauchy’s integral theorem, the difficulty of the sign problem can be changed. This requires searching for a suitable contour of integration. Several methods of finding such a contour are discussed, as well as the procedure for integrating on it. Two notable examples are highlighted: in one case, a contour exists which entirely removes the sign problem, and in another, there is provably no contour available to improve the sign problem by more than a (parametrically) small amount. As an alternative, physical simulations can be performed with the aid of a quantum computer. The formal elements underlying a quantum computation — that is, a Hilbert space, unitary operators acting on it, and Hermitian observables to be measured — can be matched to those of a quantum field theory. In this way an error-corrected quantum computer may be made to serve as a well controlled laboratory. Precise algorithms for this task are presented, specifically in the context of quantum chromodynamics.

•Jan 1, 2020•7 citations

Fermionic sign problem minimization by constant path integral contour shifts

Christoph Gäntgen, Evan Berkowitz, Thomas Luu +2 more

The path integral formulation of quantum mechanical problems including fermions is often affected by a severe numerical sign problem. We show how such a sign problem can be alleviated by a judiciously chosen constant imaginary offset to the path integral. Such integration contour deformations introduce no additional computational cost to the Hamiltonian Monte Carlo algorithm, while its effective sample size is greatly increased. This makes otherwise unviable simulations efficient for a wide range of parameters. Applying our method to the Hubbard model, we find that the sign problem is significantly reduced. Furthermore, we prove that it vanishes completely for large chemical potentials, a regime where the sign problem is expected to be particularly severe without imaginary offsets. In addition to a numerical analysis of such optimized contour shifts, we analytically compute the shifts corresponding to the leading and next-to-leading order corrections to the action. We find that such simple approximations, free of significant computational cost, suffice in many cases. We present a simulation of ${\mathrm{C}}_{60}$ fullerenes (buckyballs) that are successful over a wide parameter range.

arXiv:2307.06785•Physical review. B./Physical review. B•May 20, 2024•12 citations

Reducing the Sign Problem in Auxiliary Field Monte Carlo Simulations

Gäntgen, Christoph

The numerical sign problem is a hindrance for various areas of research that rely on stochastic sampling methods. It occurs when the sign or phase of the weight function in a path integral is not positive-definite. This leads to cancellations in the Monte Carlo sampling, which can significantly slow down convergence and render the simulation infeasible. Calculations of the Hubbard model are affected by the sign problem when the chemical potential is non-zero or when the spatial lattice is not bipartite. The overall objective of this thesis is the reduction of the sign problem in the Hubbard model with methods that may be applied to other models as well. The approach is to deform the integration contour into complex space and find a transformation that efficiently improves the distribution of the complex phase. The first publication of this cumulative thesis explores the simplest case of such a transformation, which is a constant shift of the real plane in imaginary direction. This transformation showed surprising potential and had the numerical advantage of not requiring the calculation of a Jacobian determinant, as opposed to general transformations. However, it was not obvious which offset would yield the best results. We present an algorithm that numerically approaches the optimal offset iteratively. The drawback of this method is that it relies on Markov Chain Monte Carlo sampling, which comes at significant computational cost and is affected by the sign problem itself, leading to reduced reliability. Therefore, we also present two analytic approximations that can be used directly or as a starting point for the iterative algorithm. To test the method, we calculate single particle correlation functions and the charge expectation value of carbon nanostructures, such as graphene sheets and fullerenes. The second publication introduces a refinement of the iterative optimization algorithm, increasing the stability and convergence speed. This enhancement is achieved by fitting a Gaussian curve to the average phase and its first two derivatives. We again present the physical observables, now including a tetrahedron and a larger honeycomb lattice. Additionally we extract single particle energies from the correlation functions, achieving a good agreement with the exactly solvable tetrahedron. The third publication applies a group equivariant neural network as transformation. The goal was to surpass the limitations of the constant shift while keeping the model as efficient as possible. For this purpose, we encoded the physical symmetries into the model architecture. Results show the potential to reduce the sign problem further than the constant shift. A comparison with dense neural networks shows more efficient use of parameters and training data. Tests with transfer learning lead to mixed results, indicating situational applicability. Overall these developments allow for more efficient calculations of sign problem affected systems.

•Sep 29, 2025•0 citations

Review on Quantum Computing for Lattice Field Theory

Lena Funcke, Tobias Hartung, Karl Jansen +1 more

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.

arXiv:2302.00467•International Symposium on Lattice Field Theory (LATTICE)•Feb 1, 2023•84 citations

Review on novel methods for lattice gauge theories

Mari Carmen Bañuls, Krzysztof Cichy

Formulating gauge theories on a lattice offers a genuinely non-perturbative way of studying quantum field theories, and has led to impressive achievements. In particular, it significantly deepened our understanding of quantum chromodynamics. Yet, some very relevant problems remain inherently challenging, such as real time evolution, or the presence of a chemical potential, cases in which Monte Carlo simulations are hindered by a sign problem. In the last few years, a number of possible alternatives have been put forward, based on quantum information ideas, which could potentially open the access to areas of research that have so far eluded more standard methods. They include tensor network calculations, quantum simulations with different physical platforms and quantum computations, and constitute nowadays a vibrant research area. Experts from different fields, including experimental and theoretical high energy physics, condensed matter, and quantum information, are turning their attention to these interdisciplinary possibilities, and driving the progress of the field. The aim of this article is to review the status and perspectives of these new avenues for the exploration of lattice gauge theories.

arXiv:1910.00257•Reports on Progress in Physics•Dec 17, 2019•221 citations

Variational Monte Carlo algorithm for lattice gauge theories with continuous gauge groups: A study of ( 2 + 1 ) -dimensional compact QED with dynamical fermions at finite density

Julian Bender, Patrick Emonts, J. I. Cirac

Lattice gauge theories coupled to fermionic matter account for many interesting phenomena in both high-energy physics and condensed-matter physics. Certain regimes, e.g., at finite fermion density, are difficult to simulate with traditional Monte Carlo algorithms due to the so-called sign problem. We present a variational, sign-problem-free Monte Carlo method for lattice gauge theories with continuous gauge groups and apply it to $(2+1)$-dimensional compact QED with dynamical fermions at finite density. The variational ansatz is formulated in the full gauge-field basis, i.e., without having to resort to truncation schemes for the $\text{U}(1)$ gauge-field Hilbert space. The ansatz consists of two parts: first, a pure gauge part based on Jastrow-type ansatz states (which can be connected to certain neural-network ansatz states) and, second, a fermionic part based on gauge-field-dependent fermionic Gaussian states. These are designed in such a way that the gauge-field integral over all fermionic Gaussian states is gauge-invariant and at the same time still efficiently tractable. To ensure the validity of the method we benchmark the pure gauge part of the ansatz against another variational method and the full ansatz against an existing Monte Carlo simulation where the sign problem is absent. Moreover, in limiting cases where the exact ground state is known we show that our ansatz is able to capture this behavior. Finally, we study a sign-problem affected regime by probing density-induced phase transitions.

arXiv:2304.05916•Physical Review Research•Nov 7, 2023•16 citations
Monte Carlo calculations in the framework of lattice field theory provide non-perturbative access to the equilibrium physics of quantum fields. When applied to certain fermionic systems, or to the calculation of out-of-equilibrium physics, these methods encounter the so-called sign problem, and computational resource requirements become impractically large. These difficulties prevent the calculation from first principles of the equation of state of quantum chromodynamics, as well as the computation of transport coefficients in quantum field theories, among other things. This thesis details two methods for mitigating or avoiding the sign problem. First, via the complexification of the field variables and the application of Cauchy's integral theorem, the difficulty of the sign problem can be changed. This requires searching for a suitable contour of integration. Several methods of finding such a contour are discussed, as well as the procedure for integrating on it. Two notable examples are highlighted: in one case, a contour exists which entirely removes the sign problem, and in another, there is provably no contour available to improve the sign problem by more than a (parametrically) small amount. As an alternative, physical simulations can be performed with the aid of a quantum computer. The formal elements underlying a quantum computation - that is, a Hilbert space, unitary operators acting on it, and Hermitian observables to be measured - can be matched to those of a quantum field theory. In this way an error-corrected quantum computer may be made to serve as a well controlled laboratory. Precise algorithms for this task are presented, specifically in the context of quantum chromodynamics.
Monte Carlo calculations in the framework of lattice field theory provide non- perturbative access to the equilibrium physics of quantum fields. When applied to certain fermionic systems, or to the calculation of out-of-equilibrium physics, these methods encounter the so-called sign problem, and computational resource require- ments become impractically large. These difficulties prevent the calculation from first principles of the equation of state of quantum chromodynamics, as well as the computation of transport coefficients in quantum field theories, among other things. This thesis details two methods for mitigating or avoiding the sign problem. First, via the complexification of the field variables and the application of Cauchy’s integral theorem, the difficulty of the sign problem can be changed. This requires searching for a suitable contour of integration. Several methods of finding such a contour are discussed, as well as the procedure for integrating on it. Two notable examples are highlighted: in one case, a contour exists which entirely removes the sign problem, and in another, there is provably no contour available to improve the sign problem by more than a (parametrically) small amount. As an alternative, physical simulations can be performed with the aid of a quantum computer. The formal elements underlying a quantum computation — that is, a Hilbert space, unitary operators acting on it, and Hermitian observables to be measured — can be matched to those of a quantum field theory. In this way an error-corrected quantum computer may be made to serve as a well controlled laboratory. Precise algorithms for this task are presented, specifically in the context of quantum chromodynamics.
The path integral formulation of quantum mechanical problems including fermions is often affected by a severe numerical sign problem. We show how such a sign problem can be alleviated by a judiciously chosen constant imaginary offset to the path integral. Such integration contour deformations introduce no additional computational cost to the Hamiltonian Monte Carlo algorithm, while its effective sample size is greatly increased. This makes otherwise unviable simulations efficient for a wide range of parameters. Applying our method to the Hubbard model, we find that the sign problem is significantly reduced. Furthermore, we prove that it vanishes completely for large chemical potentials, a regime where the sign problem is expected to be particularly severe without imaginary offsets. In addition to a numerical analysis of such optimized contour shifts, we analytically compute the shifts corresponding to the leading and next-to-leading order corrections to the action. We find that such simple approximations, free of significant computational cost, suffice in many cases. We present a simulation of C60{\mathrm{C}}_{60}C60​ fullerenes (buckyballs) that are successful over a wide parameter range.
The numerical sign problem is a hindrance for various areas of research that rely on stochastic sampling methods. It occurs when the sign or phase of the weight function in a path integral is not positive-definite. This leads to cancellations in the Monte Carlo sampling, which can significantly slow down convergence and render the simulation infeasible. Calculations of the Hubbard model are affected by the sign problem when the chemical potential is non-zero or when the spatial lattice is not bipartite. The overall objective of this thesis is the reduction of the sign problem in the Hubbard model with methods that may be applied to other models as well. The approach is to deform the integration contour into complex space and find a transformation that efficiently improves the distribution of the complex phase. The first publication of this cumulative thesis explores the simplest case of such a transformation, which is a constant shift of the real plane in imaginary direction. This transformation showed surprising potential and had the numerical advantage of not requiring the calculation of a Jacobian determinant, as opposed to general transformations. However, it was not obvious which offset would yield the best results. We present an algorithm that numerically approaches the optimal offset iteratively. The drawback of this method is that it relies on Markov Chain Monte Carlo sampling, which comes at significant computational cost and is affected by the sign problem itself, leading to reduced reliability. Therefore, we also present two analytic approximations that can be used directly or as a starting point for the iterative algorithm. To test the method, we calculate single particle correlation functions and the charge expectation value of carbon nanostructures, such as graphene sheets and fullerenes. The second publication introduces a refinement of the iterative optimization algorithm, increasing the stability and convergence speed. This enhancement is achieved by fitting a Gaussian curve to the average phase and its first two derivatives. We again present the physical observables, now including a tetrahedron and a larger honeycomb lattice. Additionally we extract single particle energies from the correlation functions, achieving a good agreement with the exactly solvable tetrahedron. The third publication applies a group equivariant neural network as transformation. The goal was to surpass the limitations of the constant shift while keeping the model as efficient as possible. For this purpose, we encoded the physical symmetries into the model architecture. Results show the potential to reduce the sign problem further than the constant shift. A comparison with dense neural networks shows more efficient use of parameters and training data. Tests with transfer learning lead to mixed results, indicating situational applicability. Overall these developments allow for more efficient calculations of sign problem affected systems.
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.
Formulating gauge theories on a lattice offers a genuinely non-perturbative way of studying quantum field theories, and has led to impressive achievements. In particular, it significantly deepened our understanding of quantum chromodynamics. Yet, some very relevant problems remain inherently challenging, such as real time evolution, or the presence of a chemical potential, cases in which Monte Carlo simulations are hindered by a sign problem. In the last few years, a number of possible alternatives have been put forward, based on quantum information ideas, which could potentially open the access to areas of research that have so far eluded more standard methods. They include tensor network calculations, quantum simulations with different physical platforms and quantum computations, and constitute nowadays a vibrant research area. Experts from different fields, including experimental and theoretical high energy physics, condensed matter, and quantum information, are turning their attention to these interdisciplinary possibilities, and driving the progress of the field. The aim of this article is to review the status and perspectives of these new avenues for the exploration of lattice gauge theories.
Lattice gauge theories coupled to fermionic matter account for many interesting phenomena in both high-energy physics and condensed-matter physics. Certain regimes, e.g., at finite fermion density, are difficult to simulate with traditional Monte Carlo algorithms due to the so-called sign problem. We present a variational, sign-problem-free Monte Carlo method for lattice gauge theories with continuous gauge groups and apply it to (2+1)(2+1)(2+1)-dimensional compact QED with dynamical fermions at finite density. The variational ansatz is formulated in the full gauge-field basis, i.e., without having to resort to truncation schemes for the U(1)\text{U}(1)U(1) gauge-field Hilbert space. The ansatz consists of two parts: first, a pure gauge part based on Jastrow-type ansatz states (which can be connected to certain neural-network ansatz states) and, second, a fermionic part based on gauge-field-dependent fermionic Gaussian states. These are designed in such a way that the gauge-field integral over all fermionic Gaussian states is gauge-invariant and at the same time still efficiently tractable. To ensure the validity of the method we benchmark the pure gauge part of the ansatz against another variational method and the full ansatz against an existing Monte Carlo simulation where the sign problem is absent. Moreover, in limiting cases where the exact ground state is known we show that our ansatz is able to capture this behavior. Finally, we study a sign-problem affected regime by probing density-induced phase transitions.