Variational consistent histories as a hybrid algorithm for quantum foundations

40Citations
Citations of this article
49Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Although quantum computers are predicted to have many commercial applications, less attention has been given to their potential for resolving foundational issues in quantum mechanics. Here we focus on quantum computers’ utility for the Consistent Histories formalism, which has previously been employed to study quantum cosmology, quantum paradoxes, and the quantum-to-classical transition. We present a variational hybrid quantum-classical algorithm for finding consistent histories, which should revitalize interest in this formalism by allowing classically impossible calculations to be performed. In our algorithm, the quantum computer evaluates the decoherence functional (with exponential speedup in both the number of qubits and the number of times in the history) and a classical optimizer adjusts the history parameters to improve consistency. We implement our algorithm on a cloud quantum computer to find consistent histories for a spin in a magnetic field and on a simulator to observe the emergence of classicality for a chiral molecule.

Cite

CITATION STYLE

APA

Arrasmith, A., Cincio, L., Sornborger, A. T., Zurek, W. H., & Coles, P. J. (2019). Variational consistent histories as a hybrid algorithm for quantum foundations. Nature Communications, 10(1). https://doi.org/10.1038/s41467-019-11417-0

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free