A Logic for Probability in Quantum Systems

Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to describe quantum computation at an operational level by supporting reasoning about the probabilities associated to such measurements: measurement probabilities, and transition probabilities (a quantum analogue of conditional probabilities). We present two axiomatizations, one for the logic as a whole and one for the fragment dealing just with measurement probabilities. These axiomatizations are proved to be sound and complete. The logic is also shown to be decidable, and we provide results characterizing its complexity in a number of cases.

• Type: Conference
• Year: 2003
• Where: CSL
• Authors: Ron van der Meyden, Manas Patra
• Keywords: CSL 2003, Measurement Probabilities, Quantum Computation, Quantum Computation Deals