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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Nature communications Ročník 10; číslo 1; s. 1571 - 9
Hlavní autori:	Marvian, Milad, Lidar, Daniel A., Hen, Itay
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	London Nature Publishing Group UK 05.04.2019 Nature Publishing Group Nature Portfolio
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!