On the computational complexity of curing non-stoquastic Hamiltonians. Marvian, M., Lidar, D. A., & Hen, I. Nature Communications, 10(1):1571, 2019. ![On the computational complexity of curing non-stoquastic Hamiltonians [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex Quantum many-body systems whose Hamiltonians are non-stoquastic, i.e., have positive off-diagonal matrix elements in a given basis, are known to pose severe limitations on the efficiency of Quantum Monte Carlo algorithms designed to simulate them, due to the infamous sign problem. We study the computational complexity associated with `curing'non-stoquastic Hamiltonians, i.e., transforming them into sign-problem-free ones. We prove that if such transformations are limited to single-qubit Clifford group elements or general single-qubit orthogonal matrices, finding the curing transformation is NP-complete. We discuss the implications of this result.
@article{marvianLidarHen,
Abstract = {Quantum many-body systems whose Hamiltonians are non-stoquastic, i.e., have positive off-diagonal matrix elements in a given basis, are known to pose severe limitations on the efficiency of Quantum Monte Carlo algorithms designed to simulate them, due to the infamous sign problem. We study the computational complexity associated with `curing'non-stoquastic Hamiltonians, i.e., transforming them into sign-problem-free ones. We prove that if such transformations are limited to single-qubit Clifford group elements or general single-qubit orthogonal matrices, finding the curing transformation is NP-complete. We discuss the implications of this result.},
Author = {Marvian, Milad and Lidar, Daniel A. and Hen, Itay},
Da = {2019/04/05},
Date-Added = {2020-05-11 17:23:21 -0700},
Date-Modified = {2020-05-11 17:23:21 -0700},
Doi = {10.1038/s41467-019-09501-6},
Id = {Marvian2019},
Isbn = {2041-1723},
Journal = {Nature Communications},
Number = {1},
Pages = {1571},
Title = {On the computational complexity of curing non-stoquastic Hamiltonians},
Ty = {JOUR},
Url = {https://doi.org/10.1038/s41467-019-09501-6},
Volume = {10},
Year = {2019},
Bdsk-Url-1 = {https://doi.org/10.1038/s41467-019-09501-6}}
Downloads: 0
{"_id":"QQwF2MaggCCGijqDM","bibbaseid":"marvian-lidar-hen-onthecomputationalcomplexityofcuringnonstoquastichamiltonians-2019","author_short":["Marvian, M.","Lidar, D. A.","Hen, I."],"bibdata":{"bibtype":"article","type":"article","abstract":"Quantum many-body systems whose Hamiltonians are non-stoquastic, i.e., have positive off-diagonal matrix elements in a given basis, are known to pose severe limitations on the efficiency of Quantum Monte Carlo algorithms designed to simulate them, due to the infamous sign problem. We study the computational complexity associated with `curing'non-stoquastic Hamiltonians, i.e., transforming them into sign-problem-free ones. We prove that if such transformations are limited to single-qubit Clifford group elements or general single-qubit orthogonal matrices, finding the curing transformation is NP-complete. We discuss the implications of this result.","author":[{"propositions":[],"lastnames":["Marvian"],"firstnames":["Milad"],"suffixes":[]},{"propositions":[],"lastnames":["Lidar"],"firstnames":["Daniel","A."],"suffixes":[]},{"propositions":[],"lastnames":["Hen"],"firstnames":["Itay"],"suffixes":[]}],"da":"2019/04/05","date-added":"2020-05-11 17:23:21 -0700","date-modified":"2020-05-11 17:23:21 -0700","doi":"10.1038/s41467-019-09501-6","id":"Marvian2019","isbn":"2041-1723","journal":"Nature Communications","number":"1","pages":"1571","title":"On the computational complexity of curing non-stoquastic Hamiltonians","ty":"JOUR","url":"https://doi.org/10.1038/s41467-019-09501-6","volume":"10","year":"2019","bdsk-url-1":"https://doi.org/10.1038/s41467-019-09501-6","bibtex":"@article{marvianLidarHen,\n\tAbstract = {Quantum many-body systems whose Hamiltonians are non-stoquastic, i.e., have positive off-diagonal matrix elements in a given basis, are known to pose severe limitations on the efficiency of Quantum Monte Carlo algorithms designed to simulate them, due to the infamous sign problem. We study the computational complexity associated with `curing'non-stoquastic Hamiltonians, i.e., transforming them into sign-problem-free ones. We prove that if such transformations are limited to single-qubit Clifford group elements or general single-qubit orthogonal matrices, finding the curing transformation is NP-complete. We discuss the implications of this result.},\n\tAuthor = {Marvian, Milad and Lidar, Daniel A. and Hen, Itay},\n\tDa = {2019/04/05},\n\tDate-Added = {2020-05-11 17:23:21 -0700},\n\tDate-Modified = {2020-05-11 17:23:21 -0700},\n\tDoi = {10.1038/s41467-019-09501-6},\n\tId = {Marvian2019},\n\tIsbn = {2041-1723},\n\tJournal = {Nature Communications},\n\tNumber = {1},\n\tPages = {1571},\n\tTitle = {On the computational complexity of curing non-stoquastic Hamiltonians},\n\tTy = {JOUR},\n\tUrl = {https://doi.org/10.1038/s41467-019-09501-6},\n\tVolume = {10},\n\tYear = {2019},\n\tBdsk-Url-1 = {https://doi.org/10.1038/s41467-019-09501-6}}\n\t\n\n\n\n\n\n\n\n","author_short":["Marvian, M.","Lidar, D. A.","Hen, I."],"bibbaseid":"marvian-lidar-hen-onthecomputationalcomplexityofcuringnonstoquastichamiltonians-2019","role":"author","urls":{"Paper":"https://doi.org/10.1038/s41467-019-09501-6"},"metadata":{"authorlinks":{}}},"bibtype":"article","biburl":"https://bibbase.org/f/6moQXZADybdshmwar/itayhen.bib","dataSources":["Z6jWac7o9Cbcwv4Kf","CSYFA7qwQGMgrz3JD"],"keywords":[],"search_terms":["computational","complexity","curing","non","stoquastic","hamiltonians","marvian","lidar","hen"],"title":"On the computational complexity of curing non-stoquastic Hamiltonians","year":2019}