Related papers: A Coalgebraic Model of Quantum Bisimulation
An extension of the conditional expectations (those under a given subalgebra of events and not the simple ones under a single event) from the classical to the quantum case is presented. In the classical case, the conditional expectations…
Bisimilarity is a central notion for coalgebras. In recent work, Geuvers and Jacobs suggest to focus on apartness, which they define by dualising coalgebraic bisimulations. This yields the possibility of finite proofs of distinguishability…
We present a general theory of quantum information processing devices, that can be applied to human decision makers, to atomic multimode registers, or to molecular high-spin registers. Our quantum decision theory is a generalization of the…
In the paper is discussed complete probabilistic description of quantum systems with application to multiqubit quantum computations. In simplest case it is a set of probabilities of transitions to some fixed set of states. The probabilities…
It is shown that quantum-type coherence, leading to indeterminism and interference of probabilities, may in principle exist in the absence of the Planck constant and a Hamiltonian. Such coherence is a combined effect of a symmetry (not…
Automata learning is a popular technique for inferring minimal automata through membership and equivalence queries. In this paper, we generalise learning to the theory of coalgebras. The approach relies on the use of logical formulas as…
We introduce a Geometry of Interaction model for higher-order quantum computation, and prove its adequacy for a full quantum programming language in which entanglement, duplication, and recursion are all available. Our model comes with a…
We provide a generic algorithm for constructing formulae that distinguish behaviourally inequivalent states in systems of various transition types such as nondeterministic, probabilistic or weighted; genericity over the transition type is…
We provide a systematic approach to quantum mechanics from an information-theoretic perspective using the language of tensor networks. Our formulation needs only a single kind of object, so-called positive *-tensors. Physical models…
This paper presents a quantum version of the Monty Hall problem based upon the quantum inferring acausal structures, which can be identified with generalization of Bayesian networks. Considered structures are expressed in formalism of…
A new class of stochastic variables, governed by a specifice set of rules, is introduced. These rules force them to loose some properties usually assumed for this kind of variables. We demonstrate that stochastic processes driven by these…
The failure of distributivity in quantum logic is motivated by the principle of quantum superposition. However, this principle can be encoded differently, i.e., in different logico-algebraic objects. As a result, the logic of experimental…
We explore further the suggestion to describe a pre- and post-selected system by a two-state, which is determined by two conditions. Starting with a formal definition of a two-state Hilbert space and basic operations, we systematically…
By viewing the non-equilibrium transport setup as a quantum open system, we propose a reduced-density-matrix based quantum transport formalism. At the level of self-consistent Born approximation, it can precisely account for the correlation…
Quantum operations are used to describe the observed probability distributions and conditional states of the measured system. In this paper, we address the problem of their joint measurability (coexistence). We derive two equivalent…
In categorical quantum mechanics, classical structures characterize the classical interfaces of quantum resources on one hand, while on the other hand giving rise to some quantum phenomena. In the standard Hilbert space model of quantum…
We explain the quantum structure as due to the presence of two effects, (a) a real change of state of the entity under influence of the measurement and, (b) a lack of knowledge about a deeper deterministic reality of the measurement…
Probabilistic automata (PA), also known as probabilistic nondeterministic labelled transition systems, combine probability and nondeterminism. They can be given different semantics, like strong bisimilarity, convex bisimilarity, or (more…
Algorithmic approach is based on the assumption that any quantum evolution of many particle system can be simulated on a classical computer with the polynomial time and memory cost. Algorithms play the central role here but not the…
Quantum mechanics can emerge from classical statistics. A typical quantum system describes an isolated subsystem of a classical statistical ensemble with infinitely many classical states. The state of this subsystem can be characterized by…