The Distributed Temporal Logic DTL allows one to reason about temporal properties of a distributed system from the local point of view of the system’s agents, which are assumed to execute independently and to interact by means of event sharing. In this paper, we introduce the Quantum Branching Distributed Temporal Logic QBDTL, a variant of DTL able to represent (entanglement-free) quantum state transformations in an abstract, qualitative way. In QBDTL, each agent represents a distinct quantum bit (the unit of quantum information theory), which evolves by means of quantum trans- formations and possibly interacts with other agents, and n-ary quantum operators act as communication/synchronization points between agents. We endow QBDTL with a DTL-style semantics, which fits the intrinsically distributed nature of quantum comput- ing, we formalize a labeled deduction system for QBDTL, and we prove the soundness and completeness of this deduction system with respect to the given semantics. We give a number of examples and, finally, we discuss possible extensions of our logic in order to reason about entanglement phenomena.
A Branching Distributed Temporal Logic for Reasoning about Entanglement-Free Quantum State Transformations
VIGANO', Luca;VOLPE, Marco;ZORZI, Margherita
2017-01-01
Abstract
The Distributed Temporal Logic DTL allows one to reason about temporal properties of a distributed system from the local point of view of the system’s agents, which are assumed to execute independently and to interact by means of event sharing. In this paper, we introduce the Quantum Branching Distributed Temporal Logic QBDTL, a variant of DTL able to represent (entanglement-free) quantum state transformations in an abstract, qualitative way. In QBDTL, each agent represents a distinct quantum bit (the unit of quantum information theory), which evolves by means of quantum trans- formations and possibly interacts with other agents, and n-ary quantum operators act as communication/synchronization points between agents. We endow QBDTL with a DTL-style semantics, which fits the intrinsically distributed nature of quantum comput- ing, we formalize a labeled deduction system for QBDTL, and we prove the soundness and completeness of this deduction system with respect to the given semantics. We give a number of examples and, finally, we discuss possible extensions of our logic in order to reason about entanglement phenomena.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.