The quantum computation process may be summarized as follows: rst 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 probabilistictype semantics for propositional logics designed to describe eective procedure based on measurement processes
AbstractWe present a process algebra for specifying and reasoning about quantum security protocols. ...
We present a process algebra for specifying and reasoning about quantum security protocols. Since th...
Is it possible to give a logical characterization of entanglement and of entanglement-measures in t...
The quantum computation process may be summarized as follows: rst an initial state of a physical sys...
We present a logico-algebraic approach to probabilistic abstract interpretation based on the orthola...
AbstractWe present a logico-algebraic approach to probabilistic abstract interpretation based on the...
Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantu...
AbstractModeling and reasoning about concurrent quantum systems is very important for both distribut...
We introduce a new mathematical framework for the probabilistic description of an experiment on a sy...
Quantum computation theory has inspired new forms of quantum logic, called quantum computational log...
Is it possible to give a logical characterization of entanglement and of entanglementmeasures in ter...
International audienceWe consider a programming language that can manipulate both classical and quan...
In this paper we attempt to analyze the concept of quantum probability within quantum computation an...
This paper provides an overview of quantum dynamic logics, showing how they have been designed and i...
This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic c...
AbstractWe present a process algebra for specifying and reasoning about quantum security protocols. ...
We present a process algebra for specifying and reasoning about quantum security protocols. Since th...
Is it possible to give a logical characterization of entanglement and of entanglement-measures in t...
The quantum computation process may be summarized as follows: rst an initial state of a physical sys...
We present a logico-algebraic approach to probabilistic abstract interpretation based on the orthola...
AbstractWe present a logico-algebraic approach to probabilistic abstract interpretation based on the...
Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantu...
AbstractModeling and reasoning about concurrent quantum systems is very important for both distribut...
We introduce a new mathematical framework for the probabilistic description of an experiment on a sy...
Quantum computation theory has inspired new forms of quantum logic, called quantum computational log...
Is it possible to give a logical characterization of entanglement and of entanglementmeasures in ter...
International audienceWe consider a programming language that can manipulate both classical and quan...
In this paper we attempt to analyze the concept of quantum probability within quantum computation an...
This paper provides an overview of quantum dynamic logics, showing how they have been designed and i...
This work applies concepts from algorithmic probability to Boolean and quantum combinatorial logic c...
AbstractWe present a process algebra for specifying and reasoning about quantum security protocols. ...
We present a process algebra for specifying and reasoning about quantum security protocols. Since th...
Is it possible to give a logical characterization of entanglement and of entanglement-measures in t...