|
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 probabilities assosciated to such measurements: measurement probabilities and transition probabilities ( a quantum analogue of conditonal probabilities). We present two axiomatisations, one for the logic as a whole and one for the fragment dealing with measurement probabilities. These axiomatisations are proved to be sound and complete. The logic is shown to be decidable and we provide results characterising its complexity in a number of cases.
© 2002-2003 Kurt Gödel Society, Norbert Preining. |
2003-06-04
| |