On the computational complexity of curing non-stoquastic Hamiltonians

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 compu...

Full description

Saved in:

Bibliographic Details
Published in:	Nature communications Vol. 10; no. 1; pp. 1571 - 9
Main Authors:	Marvian, Milad, Lidar, Daniel A., Hen, Itay
Format:	Journal Article
Language:	English
Published:	London Nature Publishing Group UK 05.04.2019 Nature Publishing Group Nature Portfolio
Subjects:	639/766/483 639/766/483/3926 639/766/483/481 639/766/483/640 Algorithms Complexity Computation Computer applications Computer simulation Curing Decomposition Humanities and Social Sciences multidisciplinary Qubits (quantum computing) Science Science (multidisciplinary)
ISSN:	2041-1723, 2041-1723
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!