Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations · HackerPapers discussions

Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations — mentioned by acqq

Sun, 01 Dec 2019 22:43:58 GMT

Thanks for mentioning the term that I was able to find: https://en.wikipedia.org/wiki/Numerical_sign_problem https://journals.aps.org/prl/abstract/10.1103/PhysRevLett.94... "Computational Complexity and Fundamental Limitations to Fermionic Quantum Monte Carlo Simulations, Matthias Troyer and Uwe-Jens Wiese, Phys. Rev. Lett. 94, 170201, 4 May 2005" "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…

Paper and discussion history. A mention is not an endorsement.

Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations — mentioned by jhrmnn

Sat, 22 Jun 2019 06:58:53 GMT

Here’s one example. Though it’s probably different from what you had in mind https://arxiv.org/abs/cond-mat/0408370

Paper and discussion history. A mention is not an endorsement.

Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations — mentioned by balsam

Fri, 23 May 2014 04:38:31 GMT

Maybe you mean subexponential time? Which is not much of an improvement. This is a question which I would like someone like Scott Aaronson to answer. The sign problem is NP-hard[1]. So it's not currently believed that quantum computers can actually help with the sign problem [2]. On the other hand, we have papers that seem to say they could [3]. "today it seems extremely unlikely that quantum computers can solve NP-complete problems in polynomial time" -- Scott Aaronson [1] http://arxiv.org/pdf/cond-mat/0408370.pdf [2] http://www.scottaaronson.com/papers/bqpph.pdf [3]…

Paper and discussion history. A mention is not an endorsement.