Probabilistic logics in quantum computation

Hector Freytes

Antonio Ledda

Giuseppe Sergioli

Roberto Giuntini

pp. 49-57

in: Hanne Andersen, Dennis Dieks, Thomas Uebel, Wenceslao J. Gonzalez, Gregory Wheeler (eds), New challenges to philosophy of science, Berlin, Springer, 2013

Abstract

The quantum computation process may be summarized as follows: first an initial state of a physical system is provided as the input. Then, it evolves according to the elementary operations (quantum gates) that are performed on it. Finally, the access to the information content of the resulting state is possible via the measurement operation that provides one of the possible results. In this note we describe probabilistic-type semantics for propositional logics designed to describe effective procedure based on measurement processes.