Consistent Quantum Reasoning
Robert B. Griffiths (Carnegie-Mellon)

TL;DR
This paper develops a formal framework for quantum reasoning that parallels classical physics, introducing consistent quantum descriptions using frameworks and histories, and demonstrating applications like spin measurements and the quantum-classical transition.
Contribution
It introduces a new formalism for quantum reasoning based on frameworks and generalized histories, extending previous approaches without relying on density matrices or time directionality.
Findings
Formalism applies to spin measurements and diffraction experiments
Provides insights into the emergence of classicality from quantum mechanics
Defines consistency conditions for quantum histories
Abstract
Precise rules are developed in order to formalize the reasoning processes involved in standard non-relativistic quantum mechanics, with the help of analogies from classical physics. A classical or quantum description of a mechanical system involves a {\it framework}, often chosen implicitly, and a {\it statement} or assertion about the system which is either true or false within the framework with which it is associated. Quantum descriptions are no less ``objective'' than their classical counterparts, but differ from the latter in the following respects: (i) The framework employs a Hilbert space rather than a classical phase space. (ii) The rules for constructing meaningful statements require that the associated projectors commute with each other and, in the case of time-dependent quantum histories, that consistency conditions be satisfied. (iii) There are incompatible frameworks which…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Mechanics and Applications · Quantum Computing Algorithms and Architecture
