arXiv · 2208.13744
A Solution to the Sign Problem Using a Sum of Controlled Few-Fermions
Abstract
A restricted path integral method is proposed to simulate a type of quantum system or Hamiltonian called a sum of controlled few-fermions on a classical computer using Monte Carlo without a numerical sign problem. Then a universality is proven to assert that any bounded-error quantum polynomial time (BQP) algorithm can be encoded into a sum of controlled few-fermions and simulated efficiently using classical Monte Carlo. Therefore, BQP is precisely the same as the class of bounded-error probabilistic polynomial time (BPP), namely, BPP = BQP.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
David H. Wei. 2022-06-08. A Solution to the Sign Problem Using a Sum of Controlled Few-Fermions. https://arxiv.org/abs/2208.13744
Cite the original work for its findings. Save a collection to share your selection of sources.