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.
Enregistré dans:
| Auteurs principaux: | , , |
|---|---|
| Format: | article |
| Langue: | EN |
| Publié: |
Nature Portfolio
2019
|
| Sujets: | |
| Accès en ligne: | https://doaj.org/article/96e743e627034c41bbc3b4c77ded3315 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|