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: | Andrew Arrasmith, Lukasz Cincio, Andrew T. Sornborger, Wojciech H. Zurek, Patrick J. Coles |
---|---|
Format: | Article |
Language: | English |
Published: |
Nature Portfolio
2019-07-01
|
Series: | Nature Communications |
Online Access: | https://doi.org/10.1038/s41467-019-11417-0 |
Similar Items
-
Learning the quantum algorithm for state overlap
by: Lukasz Cincio, et al.
Published: (2018-01-01) -
Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
by: Samson Wang, et al.
Published: (2024-03-01) -
Long-time simulations for fixed input states on quantum hardware
by: Joe Gibbs, et al.
Published: (2022-11-01) -
Error mitigation with Clifford quantum-circuit data
by: Piotr Czarnik, et al.
Published: (2021-11-01) -
Quantum-assisted quantum compiling
by: Sumeet Khatri, et al.
Published: (2019-05-01)