Maximum Information and Quantum Prediction Algorithms

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.

30 pages, RevTeX with LaTeX, submitted to Phys. Rev. A

References in corpus (9)

• On the Consistent Histories Approach to Quantum Mechanics
• Quantum Logic and the Histories Approach to Quantum Theory
• Properties of Consistent Histories
• The Classification of Decoherence Functionals: An Analogue of Gleason's Theorem
• Linearly Positive Histories: Probabilities for a Robust Family of Sequences of Quantum Events
• Following a "Collapsing" Wavefunction
• Quantum Prediction Algorithms
• Spacetime Information
• Approximate and Exact Consistency of Histories