We investigate the use of coalgebra to represent quantum systems, thus providing a basis for the use of coalgebraic methods in quantum information and computation. Coalgebras allow the dynamics of repeated measurement to be captured, and provide mathematical tools such as final coalgebras, bisimulation and coalgebraic logic. However, this application raises new challenges for coalgebra: how to accommodate the contravariance which arises naturally as we represent both the states and the properties of physical systems; and how to represent the symmetries of these systems, which account e.g. for their unitary dynamics. This motivates us to introduce a novel fibrational structure for coalgebra, and also to make new connections betwen coalgebras and Chu spaces.
We investigate the use of coalgebra to represent quantum systems, thus providing a basis for the use of coalgebraic methods in quantum information and computation. Coalgebras allow the dynamics of repeated measurement to be captured, and provide mathematical tools such as final coalgebras, bisimulation and coalgebraic logic. However, this application raises new challenges for coalgebra: how to accommodate the contravariance which arises naturally as we represent both the states and the properties of physical systems; and how to represent the symmetries of these systems, which account e.g. for their unitary dynamics. This motivates us to introduce a novel fibrational structure for coalgebra, and also to make new connections betwen coalgebras and Chu spaces.
We pursue a model-oriented rather than axiomatic approach to the foun- dations of Quantum Mechanics, with the idea that new models can often suggest new axioms. This approach has often been fruitful in Logic and Theoretical Computer Sci- ence. Rather than seeking to construct a simplified toy model, we aim for a 'big toy model', in which both quantum and classical systems can be faithfully represented— as well as, possibly, more exotic kinds of systems. To this end, we show how Chu spaces can be used to represent physical systems of various kinds. In particular, we show how quantum systems can be represented as Chu spaces over the unit interval in such a way that the Chu morphisms correspond exactly to the physically meaningful symmetries of the systems—the unitaries and antiunitaries. In this way we obtain a full and faithful functor from the groupoid of Hilbert spaces and their symmetries to Chu spaces. We also consider whether it is possible to use a finite value set rather than the unit interval; we show that three values suffice, while the two standard possibilistic reductions to two values both fail to preserve fullness.
As a quantum counterpart of labeled transition system (LTS), quantum labeled transition system (QLTS) is a powerful formalism for modeling quantum programs or protocols, and gives a categorical understanding for quantum computation. With the help of quantum branching monad, QLTS provides a framework extending some ideas in non-deterministic or probabilistic systems to quantum systems. On the other hand, quantum finite automata (QFA) emerged as a very elegant and simple model for resolving some quantum computational problems. In this paper, we propose the notion of reactive quantum system (RQS), a variant of QLTS capturing reactive system behavior, and develop a coalgebraic semantics for QLTS, RQS and QFA by an endofunctor on the category of convex sets, which has a final coalgebra. Such a coalgebraic semantics provides a unifying abstract interpretation for QLTS, RQS and QFA. The notions of bisimulation and simulation can be employed to compare the behavior of different types of quantum systems and judge whether a coalgebra can be behaviorally simulated by another.
Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprisingly difficult task.We explore coalgebras over distributions taking weights from a generic effect algebra, which subsumes probabilities and quantum effects, a physical formalism that represents the probabilistic behaviour of an open quantum system.To abide by the properties of quantum theory, we introduce monads graded on a partial commutative monoid, intuitively allowing composition of two processes only if they use different quantum resources, as prescribed by the no-cloning theorem.We investigate the relation between an open quantum system and its probabilistic counterparts obtained when instantiating the input with a specific quantum state.We consider Aczel-Mendler and kernel bisimilarities, advocating for the latter as it characterizes quantum systems that exhibit the same probabilistic behaviour for all input states.Finally, we propose operators on quantum effect labelled transition systems, paving the way for a process calculi semantics that is parametric over the quantum input.
Hilbert spaces provide the fundamental mathematical framework for describing quantum mechanical systems. Their structure, characterized by an inner product and completeness, allows for the representation of quantum states as vectors and physical observables as self-adjoint operators. Key quantum phenomena such as superposition and entanglement find natural expression within this formalism. Superposition, where a quantum system can exist in multiple states simultaneously, is represented by linear combinations of basis vectors in the Hilbert space. Entanglement, a non-classical correlation between quantum systems, is described by non-separable state vectors in a tensor product of Hilbert spaces. These concepts are pivotal in quantum computing, where the unit of information, the qubit, is a two-level quantum system whose state is a vector in a two-dimensional complex Hilbert space (ℂ²). Quantum gates, which perform operations on qubits, are represented by unitary operators acting on these state vectors. The power of quantum computation, particularly in algorithms like Shor's or Grover's, stems from the ability to exploit superposition and entanglement, processes intrinsically described within the Hilbert space framework. Thus, a thorough understanding of Hilbert spaces is indispensable for grasping the principles of quantum mechanics and for advancing the field of quantum information and computation [1, 7]. The transition from classical bits to quantum qubits, and from classical logic gates to quantum unitary operations, is entirely predicated on the mathematical properties endowed by Hilbert spaces.
Hilbert spaces provide the fundamental mathematical framework for describing quantum mechanical systems. Their structure, characterized by an inner product and completeness, allows for the representation of quantum states as vectors and physical observables as self-adjoint operators. Key quantum phenomena such as superposition and entanglement find natural expression within this formalism. Superposition, where a quantum system can exist in multiple states simultaneously, is represented by linear combinations of basis vectors in the Hilbert space. Entanglement, a non-classical correlation between quantum systems, is described by non-separable state vectors in a tensor product of Hilbert spaces. These concepts are pivotal in quantum computing, where the unit of information, the qubit, is a two-level quantum system whose state is a vector in a two-dimensional complex Hilbert space (ℂ²). Quantum gates, which perform operations on qubits, are represented by unitary operators acting on these state vectors. The power of quantum computation, particularly in algorithms like Shor's or Grover's, stems from the ability to exploit superposition and entanglement, processes intrinsically described within the Hilbert space framework. Thus, a thorough understanding of Hilbert spaces is indispensable for grasping the principles of quantum mechanics and for advancing the field of quantum information and computation [1, 7]. The transition from classical bits to quantum qubits, and from classical logic gates to quantum unitary operations, is entirely predicated on the mathematical properties endowed by Hilbert spaces.