Maximum information and quantum prediction algorithms

Jim McElwaine
Phys. Rev. A 56, 1756 – Published 1 September 1997
PDFExport Citation

Abstract

This paper describes an algorithm for selecting a consistent set within the consistent histories approach to quantum mechanics and investigates its properties. The algorithm uses a maximum information principle to select from among the consistent sets formed by projections defined by the Schmidt decomposition. The algorithm unconditionally predicts the possible events in closed quantum systems and ascribes probabilities to these events. A simple spin model is described and a complete classification of all exactly consistent sets of histories formed from Schmidt projections in the model is proved. This result is used to show that for this example the algorithm selects a physically realistic set. Other tentative suggestions in the literature for set selection algorithms using ideas from information theory are discussed.

  • Received 2 December 1996

DOI:https://doi.org/10.1103/PhysRevA.56.1756

©1997 American Physical Society

Authors & Affiliations

Jim McElwaine

  • Department of Applied Mathematics and Theoretical Physics, University of Cambridge, Silver Street, Cambridge CB3 9EW, United Kingdom

References (Subscription Required)

Click to Expand
Issue

Vol. 56, Iss. 3 — September 1997

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×