On the computational complexity of curing non-stoquastic Hamiltonians
Crossref DOI link: https://doi.org/10.1038/s41467-019-09501-6
Published Online: 2019-04-05
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Marvian, Milad
Lidar, Daniel A.
Hen, Itay http://orcid.org/0000-0002-7009-7739
Text and Data Mining valid from 2019-04-05
Version of Record valid from 2019-04-05
Article History
Received: 17 August 2018
Accepted: 14 March 2019
First Online: 5 April 2019
Competing interests
: The authors declare no competing interests.