Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/9812051

Random Hamiltonian Models and Quantum Prediction Algorithms

Jim McElwaine

Published Dec 18, 1998• 0 citations
arXivHTMLPDF

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 select from among the consistent sets formed by projections defined by the Schmidt decomposition by making projections at the earliest possible time. The algorithm unconditionally predicts the possible events in closed quantum systems and ascribes probabilities to these events. A simple random Hamiltonian model is described and the results of applying the algorithm to this model using computer programs are discussed and compared with approximate analytic calculations.

DOI
10.48550/arxiv.quant-ph/9812051

Related papers

Maximum information and quantum prediction algorithms

Jim McElwaine

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.

arXiv:quant-ph/9611054•Physical Review A•Sep 1, 1997•2 citations

Approximate Consistency and Prediction Algorithms in Quantum Mechanics

Jim McElwaine

This dissertation investigates questions arising in the consistent histories formulation of the quantum mechanics of closed systems. Various criteria for approximate consistency are analysed. The connection between the Dowker-Halliwell criterion and sphere packing problems is shown and used to prove several new bounds on the violation of probability sum rules. The quantum Zeno effect is also analysed within the consistent histories formalism and used to demonstrate some of the difficulties involved in discussing approximate consistency. The complications associated with null histories and infinite sets are briefly discussed. The possibility of using the properties of the Schmidt decomposition to define an algorithm which selects a single, physically natural, consistent set for pure initial density matrices is investigated. The problems that arise are explained, and different possible algorithms discussed. Their properties are analysed with the aid of simple models. A set of computer programs is described which apply the algorithms to more complicated examples. Another algorithm is proposed that selects the consistent set (formed using Schmidt projections) with the highest Shannon information. This is applied to a simple model and shown to produce physically sensible histories. The theory is capable of unconditional probabilistic prediction for closed quantum systems, and is strong enough to be falsifiable. Ideas on applying the theory to more complicated examples are discussed.

arXiv:quant-ph/9707053•Jul 29, 1997•1 citation

Quantum prediction algorithms

Adrian Kent, Jim McElwaine

The consistent histories formulation of the quantum theory of a closed system with a pure initial state defines an infinite number of incompatible consistent sets, each of which gives a possible description of the physics. We investigate the possibility of using the properties of the Schmidt decomposition to define an algorithm which selects a single, physically natural, consistent set. We explain the problems which arise, set out some possible algorithms, and explain their properties with the aid of simple models. Though the discussion is framed in the language of the consistent histories approach, it is intended to highlight the difficulty in making any interpretation of quantum theory based on decoherence into a mathematically precise theory.

arXiv:gr-qc/9610028•Physical Review A•Mar 1, 1997•19 citations

Consistent Sets Contradict

Adrian Kent

In the consistent histories formulation of quantum theory, the probabilistic predictions and retrodictions made from observed data depend on the choice of a consistent set. We show that this freedom allows the formalism to retrodict several contradictory propositions which correspond to orthogonal commuting projections and which all have probability one. We also show that the formalism makes contradictory probability one predictions when applied to generalised time-symmetric quantum mechanics.

•Apr 4, 1996•8 citations

Consistent Sets Yield Contrary Inferences in Quantum Theory

Adrian Kent

In the consistent histories formulation of quantum theory, the probabilistic predictions and retrodictions made from observed data depend on the choice of a consistent set. We show that this freedom allows the formalism to retrodict contrary propositions which correspond to orthogonal commuting projections and which each have probability one. We also show that the formalism makes contrary probability one predictions when applied to Gell-Mann and Hartle's generalized time-neutral quantum mechanics.

arXiv:gr-qc/9604012•Physical Review Letters•Apr 14, 1997•114 citations

Quantum Histories

Adrian Kent

There are good motivations for considering some type of quantum histories formalism. Several possible formalisms are known, defined by different definitions of event and by different selection criteria for sets of histories. These formalisms have a natural interpretation, according to which nature somehow chooses one set of histories from among those allowed, and then randomly chooses to realise one history from that set; other interpretations are possible, but their scientific implications are essentially the same. The selection criteria proposed to date are reasonably natural, and certainly raise new questions. For example, the validity of ordering inferences which we normally take for granted – such as that a particle in one region is necessarily in a larger region containing it – depends on whether or not our history respects the criterion of ordered consistency, or merely consistency. However, the known selection criteria, including consistency and medium decoherence, are very weak. It is not possible to derive the predictions of classical mechanics or Copenhagen quantum mechanics from the theories they define, even given observational data in an extended time interval. Attempts to refine the consistent histories approach so as to solve this problem by finding a definition of quasiclassicality have so far not succeeded. On the other hand, it is shown that dynamical collapse models, of the type originally proposed by Ghirardi-Rimini-Weber, can be re-interpreted as set selection criteria within a quantum histories framework, in which context they appear as candidate solutions to the set selection problem. This suggests a new route to relativistic generalisation of these models, since covariant definitions of a quantum event are known.

arXiv:gr-qc/9809026•Physica Scripta•Jan 1, 1998•35 citations
This paper describes an algorithm for selecting a consistent set within the consistent histories approach to quantum mechanics and investigates its properties. The algorithm select from among the consistent sets formed by projections defined by the Schmidt decomposition by making projections at the earliest possible time. The algorithm unconditionally predicts the possible events in closed quantum systems and ascribes probabilities to these events. A simple random Hamiltonian model is described and the results of applying the algorithm to this model using computer programs are discussed and compared with approximate analytic calculations.
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.
This dissertation investigates questions arising in the consistent histories formulation of the quantum mechanics of closed systems. Various criteria for approximate consistency are analysed. The connection between the Dowker-Halliwell criterion and sphere packing problems is shown and used to prove several new bounds on the violation of probability sum rules. The quantum Zeno effect is also analysed within the consistent histories formalism and used to demonstrate some of the difficulties involved in discussing approximate consistency. The complications associated with null histories and infinite sets are briefly discussed. The possibility of using the properties of the Schmidt decomposition to define an algorithm which selects a single, physically natural, consistent set for pure initial density matrices is investigated. The problems that arise are explained, and different possible algorithms discussed. Their properties are analysed with the aid of simple models. A set of computer programs is described which apply the algorithms to more complicated examples. Another algorithm is proposed that selects the consistent set (formed using Schmidt projections) with the highest Shannon information. This is applied to a simple model and shown to produce physically sensible histories. The theory is capable of unconditional probabilistic prediction for closed quantum systems, and is strong enough to be falsifiable. Ideas on applying the theory to more complicated examples are discussed.
The consistent histories formulation of the quantum theory of a closed system with a pure initial state defines an infinite number of incompatible consistent sets, each of which gives a possible description of the physics. We investigate the possibility of using the properties of the Schmidt decomposition to define an algorithm which selects a single, physically natural, consistent set. We explain the problems which arise, set out some possible algorithms, and explain their properties with the aid of simple models. Though the discussion is framed in the language of the consistent histories approach, it is intended to highlight the difficulty in making any interpretation of quantum theory based on decoherence into a mathematically precise theory.
In the consistent histories formulation of quantum theory, the probabilistic predictions and retrodictions made from observed data depend on the choice of a consistent set. We show that this freedom allows the formalism to retrodict contrary propositions which correspond to orthogonal commuting projections and which each have probability one. We also show that the formalism makes contrary probability one predictions when applied to Gell-Mann and Hartle's generalized time-neutral quantum mechanics.
There are good motivations for considering some type of quantum histories formalism. Several possible formalisms are known, defined by different definitions of event and by different selection criteria for sets of histories. These formalisms have a natural interpretation, according to which nature somehow chooses one set of histories from among those allowed, and then randomly chooses to realise one history from that set; other interpretations are possible, but their scientific implications are essentially the same. The selection criteria proposed to date are reasonably natural, and certainly raise new questions. For example, the validity of ordering inferences which we normally take for granted – such as that a particle in one region is necessarily in a larger region containing it – depends on whether or not our history respects the criterion of ordered consistency, or merely consistency. However, the known selection criteria, including consistency and medium decoherence, are very weak. It is not possible to derive the predictions of classical mechanics or Copenhagen quantum mechanics from the theories they define, even given observational data in an extended time interval. Attempts to refine the consistent histories approach so as to solve this problem by finding a definition of quasiclassicality have so far not succeeded. On the other hand, it is shown that dynamical collapse models, of the type originally proposed by Ghirardi-Rimini-Weber, can be re-interpreted as set selection criteria within a quantum histories framework, in which context they appear as candidate solutions to the set selection problem. This suggests a new route to relativistic generalisation of these models, since covariant definitions of a quantum event are known.