Maximum information and quantum prediction algorithms.

McElwaine, J.N.

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.

Citation

McElwaine, J. (1997). Maximum information and quantum prediction algorithms. Physical Review A, 56(3), 1756-1766. https://doi.org/10.1103/physreva.56.1756

• Journal Article Type: Article
• Publication Date: 1997-09
• Deposit Date: May 23, 2013
• Journal: Physical Review A - Atomic, Molecular, and Optical Physics
• Print ISSN: 1050-2947
• Electronic ISSN: 1094-1622
• Publisher: American Physical Society
• Peer Reviewed: Peer Reviewed
• Volume: 56
• Issue: 3
• Pages: 1756-1766
• DOI: https://doi.org/10.1103/physreva.56.1756
• Public URL: https://durham-repository.worktribe.com/output/1454971