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.

Guardado en:

Detalles Bibliográficos
Autores principales:	Milad Marvian, Daniel A. Lidar, Itay Hen
Formato:	article
Lenguaje:	EN
Publicado:	Nature Portfolio 2019
Materias:	Science Q
Acceso en línea:	https://doaj.org/article/96e743e627034c41bbc3b4c77ded3315
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:96e743e627034c41bbc3b4c77ded3315
record_format	dspace
spelling	oai:doaj.org-article:96e743e627034c41bbc3b4c77ded33152021-12-02T16:57:40ZOn the computational complexity of curing non-stoquastic Hamiltonians10.1038/s41467-019-09501-62041-1723https://doaj.org/article/96e743e627034c41bbc3b4c77ded33152019-04-01T00:00:00Zhttps://doi.org/10.1038/s41467-019-09501-6https://doaj.org/toc/2041-1723Non-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.Milad MarvianDaniel A. LidarItay HenNature PortfolioarticleScienceQENNature Communications, Vol 10, Iss 1, Pp 1-9 (2019)
institution	DOAJ
collection	DOAJ
language	EN
topic	Science Q
spellingShingle	Science Q Milad Marvian Daniel A. Lidar Itay Hen On the computational complexity of curing non-stoquastic Hamiltonians
description	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.
format	article
author	Milad Marvian Daniel A. Lidar Itay Hen
author_facet	Milad Marvian Daniel A. Lidar Itay Hen
author_sort	Milad Marvian
title	On the computational complexity of curing non-stoquastic Hamiltonians
title_short	On the computational complexity of curing non-stoquastic Hamiltonians
title_full	On the computational complexity of curing non-stoquastic Hamiltonians
title_fullStr	On the computational complexity of curing non-stoquastic Hamiltonians
title_full_unstemmed	On the computational complexity of curing non-stoquastic Hamiltonians
title_sort	on the computational complexity of curing non-stoquastic hamiltonians
publisher	Nature Portfolio
publishDate	2019
url	https://doaj.org/article/96e743e627034c41bbc3b4c77ded3315
work_keys_str_mv	AT miladmarvian onthecomputationalcomplexityofcuringnonstoquastichamiltonians AT danielalidar onthecomputationalcomplexityofcuringnonstoquastichamiltonians AT itayhen onthecomputationalcomplexityofcuringnonstoquastichamiltonians
_version_	1718382515380551680

On the computational complexity of curing non-stoquastic Hamiltonians

Ejemplares similares