Coalgebras generalize various kinds of dynamical systems occuring in mathematics and computer science. Examples of systems that can be modeled as coalgebras include automata and Markov chains. We will present a coalgebraic representation of systems occuring in the field of quantum computation, using convex sets of density matrices as state spaces. This will allow us to derive a method to convert quantum mechanical systems into simpler probabilistic systems with the same probabilistic behaviour.
Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantu...
Recently several authors paid attention to the extension of the classical notion of probability deve...
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show t...
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of c...
This paper introduces several new classes of mathematical structures that have close connections wit...
AbstractWe survey the work on both discrete and continuous-space probabilistic systems as coalgebras...
Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An...
We revisit our earlier work on the representation of quantum systems as Chu spaces, and investigate ...
Quantum computation and quantum computational logics give rise to some non-standard probability spac...
Abstract. Coalgebra is an abstract framework for the uniform study of different kinds of dynamical s...
We revisit our earlier work on the representation of quantum systems as Chu spaces, and investigate ...
Structured transition systems have been widely used in the formal specification of computing systems...
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show t...
The powerset construction is a standard method for converting a nondeterministic automaton into a de...
We discuss different formal frameworks for the description of generalized probabilities in statistic...
Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantu...
Recently several authors paid attention to the extension of the classical notion of probability deve...
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show t...
The paper investigates non-deterministic, probabilistic and quantum walks, from the perspective of c...
This paper introduces several new classes of mathematical structures that have close connections wit...
AbstractWe survey the work on both discrete and continuous-space probabilistic systems as coalgebras...
Coalgebra is an abstract framework for the uniform study of different kinds of dynamical systems. An...
We revisit our earlier work on the representation of quantum systems as Chu spaces, and investigate ...
Quantum computation and quantum computational logics give rise to some non-standard probability spac...
Abstract. Coalgebra is an abstract framework for the uniform study of different kinds of dynamical s...
We revisit our earlier work on the representation of quantum systems as Chu spaces, and investigate ...
Structured transition systems have been widely used in the formal specification of computing systems...
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show t...
The powerset construction is a standard method for converting a nondeterministic automaton into a de...
We discuss different formal frameworks for the description of generalized probabilities in statistic...
Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantu...
Recently several authors paid attention to the extension of the classical notion of probability deve...
We consider state-based systems modelled as coalgebras whose type incorporates branching, and show t...