Science-advisor
REGISTER info/FAQ
Login
username
password
     
forgot password?
register here
 
Research articles
  search articles
  reviews guidelines
  reviews
  articles index
My Pages
my alerts
  my messages
  my reviews
  my favorites
 
 
Stat
Members: 3667
Articles: 2'599'751
Articles rated: 2609

09 February 2025
 
  » arxiv » 2208.13744

 Article overview



A Solution to the Sign Problem Using a Sum-of-Few-Fermions Hamiltonian
David H. Wei ;
Date 8 Jun 2022
AbstractA restricted path integral method is proposed to efficiently simulate a class of quantum systems and Hamiltonians called sum-of-few-fermions (SFF) by Monte Carlo on a classical computer without a numerical sign problem. Then a universality is proven to assert that any bounded-error quantum polynomial time (BQP) algorithm can be mapped to the ground state of an SFF Hamiltonian and becomes efficiently simulatable. Therefore, the computational complexity class of bounded-error probabilistic polynomial time (BPP) is precisely the same as the class of BQP.
Source arXiv, 2208.13744
Services Forum | Review | PDF | Favorites   
 
Visitor rating: did you like this article? no 1   2   3   4   5   yes

No review found.
 Did you like this article?

This article or document is ...
important:
of broad interest:
readable:
new:
correct:
Global appreciation:

  Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.






ScienXe.org
» my Online CV
» Free

home  |  contact  |  terms of use  |  sitemap
Copyright © 2005-2025 - Scimetrica