Variational consistent histories as a hybrid algorithm for quantum foundations

The Consistent Histories formalism can solve paradoxes in quantum mechanics, but finding such consistent sets of histories requires a computational overhead which is exponential in the problem’s size. Here, the authors report a variational hybrid algorithm solving this problem using polynomial resou...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autores principales:	Andrew Arrasmith, Lukasz Cincio, Andrew T. Sornborger, Wojciech H. Zurek, Patrick J. Coles
Formato:	article
Lenguaje:	EN
Publicado:	Nature Portfolio 2019
Materias:	Science Q
Acceso en línea:	https://doaj.org/article/0da7364c2f174e9780ba65748e13d5a6
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

id	oai:doaj.org-article:0da7364c2f174e9780ba65748e13d5a6
record_format	dspace
spelling	oai:doaj.org-article:0da7364c2f174e9780ba65748e13d5a62021-12-02T16:57:50ZVariational consistent histories as a hybrid algorithm for quantum foundations10.1038/s41467-019-11417-02041-1723https://doaj.org/article/0da7364c2f174e9780ba65748e13d5a62019-07-01T00:00:00Zhttps://doi.org/10.1038/s41467-019-11417-0https://doaj.org/toc/2041-1723The Consistent Histories formalism can solve paradoxes in quantum mechanics, but finding such consistent sets of histories requires a computational overhead which is exponential in the problem’s size. Here, the authors report a variational hybrid algorithm solving this problem using polynomial resources.Andrew ArrasmithLukasz CincioAndrew T. SornborgerWojciech H. ZurekPatrick J. ColesNature PortfolioarticleScienceQENNature Communications, Vol 10, Iss 1, Pp 1-7 (2019)
institution	DOAJ
collection	DOAJ
language	EN
topic	Science Q
spellingShingle	Science Q Andrew Arrasmith Lukasz Cincio Andrew T. Sornborger Wojciech H. Zurek Patrick J. Coles Variational consistent histories as a hybrid algorithm for quantum foundations
description	The Consistent Histories formalism can solve paradoxes in quantum mechanics, but finding such consistent sets of histories requires a computational overhead which is exponential in the problem’s size. Here, the authors report a variational hybrid algorithm solving this problem using polynomial resources.
format	article
author	Andrew Arrasmith Lukasz Cincio Andrew T. Sornborger Wojciech H. Zurek Patrick J. Coles
author_facet	Andrew Arrasmith Lukasz Cincio Andrew T. Sornborger Wojciech H. Zurek Patrick J. Coles
author_sort	Andrew Arrasmith
title	Variational consistent histories as a hybrid algorithm for quantum foundations
title_short	Variational consistent histories as a hybrid algorithm for quantum foundations
title_full	Variational consistent histories as a hybrid algorithm for quantum foundations
title_fullStr	Variational consistent histories as a hybrid algorithm for quantum foundations
title_full_unstemmed	Variational consistent histories as a hybrid algorithm for quantum foundations
title_sort	variational consistent histories as a hybrid algorithm for quantum foundations
publisher	Nature Portfolio
publishDate	2019
url	https://doaj.org/article/0da7364c2f174e9780ba65748e13d5a6
work_keys_str_mv	AT andrewarrasmith variationalconsistenthistoriesasahybridalgorithmforquantumfoundations AT lukaszcincio variationalconsistenthistoriesasahybridalgorithmforquantumfoundations AT andrewtsornborger variationalconsistenthistoriesasahybridalgorithmforquantumfoundations AT wojciechhzurek variationalconsistenthistoriesasahybridalgorithmforquantumfoundations AT patrickjcoles variationalconsistenthistoriesasahybridalgorithmforquantumfoundations
_version_	1718382428690579456

Variational consistent histories as a hybrid algorithm for quantum foundations

Ejemplares similares