| | |
| | |
Stat |
Members: 3667 Articles: 2'599'751 Articles rated: 2609
09 February 2025 |
|
| | | |
|
Article overview
| |
|
A Solution to the Sign Problem Using a Sum-of-Few-Fermions Hamiltonian | David H. Wei
; | Date: |
8 Jun 2022 | Abstract: | A 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 |
|
|
No review found.
Did you like this article?
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.
|
| |
|
|
|