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...
Main Authors: | , , , , |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2019-07-01
|
Series: | Nature Communications |
Online Access: | https://doi.org/10.1038/s41467-019-11417-0 |
_version_ | 1819194599227260928 |
---|---|
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 |
collection | DOAJ |
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. |
first_indexed | 2024-12-23T01:59:25Z |
format | Article |
id | doaj.art-0da7364c2f174e9780ba65748e13d5a6 |
institution | Directory Open Access Journal |
issn | 2041-1723 |
language | English |
last_indexed | 2024-12-23T01:59:25Z |
publishDate | 2019-07-01 |
publisher | Nature Portfolio |
record_format | Article |
series | Nature Communications |
spelling | doaj.art-0da7364c2f174e9780ba65748e13d5a62022-12-21T18:04:02ZengNature PortfolioNature Communications2041-17232019-07-011011710.1038/s41467-019-11417-0Variational consistent histories as a hybrid algorithm for quantum foundationsAndrew Arrasmith0Lukasz Cincio1Andrew T. Sornborger2Wojciech H. Zurek3Patrick J. Coles4Theoretical Division, MS 213, Los Alamos National LaboratoryTheoretical Division, MS 213, Los Alamos National LaboratoryInformation Sciences, MS 256, Los Alamos National LaboratoryTheoretical Division, MS 213, Los Alamos National LaboratoryTheoretical Division, MS 213, Los Alamos National LaboratoryThe 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.https://doi.org/10.1038/s41467-019-11417-0 |
spellingShingle | Andrew Arrasmith Lukasz Cincio Andrew T. Sornborger Wojciech H. Zurek Patrick J. Coles Variational consistent histories as a hybrid algorithm for quantum foundations Nature Communications |
title | 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_short | Variational consistent histories as a hybrid algorithm for quantum foundations |
title_sort | variational consistent histories as a hybrid algorithm for quantum foundations |
url | https://doi.org/10.1038/s41467-019-11417-0 |
work_keys_str_mv | AT andrewarrasmith variationalconsistenthistoriesasahybridalgorithmforquantumfoundations AT lukaszcincio variationalconsistenthistoriesasahybridalgorithmforquantumfoundations AT andrewtsornborger variationalconsistenthistoriesasahybridalgorithmforquantumfoundations AT wojciechhzurek variationalconsistenthistoriesasahybridalgorithmforquantumfoundations AT patrickjcoles variationalconsistenthistoriesasahybridalgorithmforquantumfoundations |