Probabilistic Logics in Quantum Computation

• Hector Freytes ^[1] ; Antonio Ledda ^[2] ; Giuseppe Sergioli ^[2] ; Roberto Giuntini ^[2]
  1. [1] Instituto Argentino de Matemática (IAM) Buenos Aires, Argentina
  2. [2] Faculty of EducationUniversity of Cagliari, Cagliari, Italy
• Localización: New challenges to philosophy of science / coord. por Hanne Andersen, Dennis Dieks, Wenceslao J. González Fernández, Thomas Uebel, Gregory Wheeler, 2013, ISBN 978-94-007-5844-5, págs. 49-57
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • 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.