Recognition: unknown
Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
read the original abstract
Quantum Monte Carlo simulations, while being efficient for bosons, suffer from the "negative sign problem'' when applied to fermions - causing an exponential increase of the computing time with the number of particles. A polynomial time solution to the sign problem is highly desired since it would provide an unbiased and numerically exact method to simulate correlated quantum systems. Here we show, that such a solution is almost certainly unattainable by proving that the sign problem is NP-hard, implying that a generic solution of the sign problem would also solve all problems in the complexity class NP (nondeterministic polynomial) in polynomial time.
This paper has not been read by Pith yet.
Forward citations
Cited by 6 Pith papers
-
Tightening energy-based boson truncation bound using Monte Carlo-assisted methods
Monte Carlo-assisted tightening of the energy-based boson truncation bound substantially reduces volume dependence in (1+1)D scalar field theory and (2+1)D U(1) gauge theory.
-
Finite-density equation of state of hot QCD using the complex Langevin equation
Continuum-extrapolated lattice QCD simulations with complex Langevin produce the equation of state at high baryon chemical potentials above the crossover temperature at the physical point.
-
The massive Thirring / sine-Gordon model with non-zero current density
Optimal bounds from current-density calculations constrain the energy density versus number density in the massive Thirring/sine-Gordon model by a factor of two at high densities for any coupling, with the lower bound...
-
Chiral first order phase transition at finite baryon density and zero temperature from self-consistent pole masses in the linear sigma model with quarks
In the two-flavor linear sigma model with quarks, the chiral phase transition at T=0 is first order and occurs at a quark chemical potential equal to the vacuum quark mass.
-
Correctness criteria for complex Langevin
A comparison of prominent correctness criteria for complex Langevin dynamics on four simple models shows differences in applicability, ease of use, and predictive power.
-
Toward selective quantum advantage in hadronic tomography:explicit cases from Compton form factors, GPDs, TMDs, and GTMDs
Quantum advantage in hadronic tomography should be evaluated selectively for CFFs, GPDs, TMDs, and GTMDs because their light-front and real-time correlation functions create ill-posed inverse problems that quantum alg...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.