On the computational complexity of curing non-stoquastic Hamiltonians
Non-stoquastic Hamiltonians are known to be hard to simulate due to the infamous sign problem. Here, the authors study the computational complexity of transforming such Hamiltonians into stoquastic ones and prove that the task is NP-complete even for the simplest class of transformations.
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | article |
| Language: | EN |
| Published: |
Nature Portfolio
2019
|
| Subjects: | |
| Online Access: | https://doaj.org/article/96e743e627034c41bbc3b4c77ded3315 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|