Related papers: A compositional approach to quantum functions
In a recent paper of Bhowmick, Skalski and So{\l}tan the notion of a quantum group of automorphisms of a finite quantum group was introduced and, for a given finite quantum group G, existence of the universal quantum group acting on G by…
We provide a new characterisation of quantum supermaps in terms of an axiom that refers only to sequential and parallel composition. Consequently, we generalize quantum supermaps to arbitrary monoidal categories and operational…
We describe the notion of a quantum family of maps of a quantum space and that of a quantum commutant of such a family. Quantum commutants are quantum semigroups defined by a certain universal property. We give a few examples of these…
We analyze the recent examples of quantum semigroups defined by M.M. Sadr who also brought up several open problems concerning these objects. These are defined as quantum families of maps from finite sets to a fixed compact quantum…
We clarify the correspondence between the two approaches to quantum graphs: via quantum adjacency matrices and via quantum relations. We show how the choice of a (possibly non-tracial) weight manifests itself on the quantum relation side…
Quantum algorithms are sequences of abstract operations, performed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contributions of Abramsky, Coecke…
This is a presentation of recent work on quantum permutation groups. Contains: a short introduction to operator algebras and Hopf algebras; quantum permutation groups, and their basic properties; diagrams, integration formulae, asymptotic…
This dissertation builds a compositional cyber-physical systems theory to develop concrete semantics relating the above diverse views necessary for safety and security assurance. In this sense, composition can take two forms. The first is…
This thesis provides an introduction to the various category theory ideas employed in topological quantum field theory. These theories are viewed as symmetric monoidal functors from topological cobordism categories into the category of…
The problem of finding graph structure of functions commuting with a given function in terms of their functional graphs is considered. Structure of functional graphs of commuting functions is described. The problem is reduced to describing…
This paper explores the use of 2-categorical technology for describing and reasoning about complex quantum procedures. We give syntactic definitions of a family of complementary measurements, and of quantum key distribution, and show that…
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in…
In Part I of this series we presented the general ideas of applying group-algebraic methods for describing quantum systems. The treatment was there very "ascetic" in that only the structure of a locally compact topological group was used.…
We show that the C*-algebras associated with synchronous games give rise to certain quantum families of maps between the input and output sets of the game. In particular situations (e.g. for graph endomorphism games) these quantum families…
We propose a 2-categorical formalism for describing classical information, quantum systems, and their interactions, based on the principle that classical information can be encoded as correlations between quantum systems. Applying this in…
We study quantum field theories which have quantum groups as global internal symmetries. We show that in such theories operators are generically non-local, and should be thought as living at the ends of topological lines. We describe the…
Expansion of the categorical point of view on many areas of the mathematics and mathematical physics will cause to deeper understanding of genuine features of these problems. New applications of categorical methods are connected with new…
In this work, we generalize the recently-introduced graph composition framework to the non-boolean setting. A quantum algorithm in this framework is represented by a hypergraph, where each hyperedge is adjacent to multiple vertices. The…
We begin with the characterization of quantum graphs as left ideals in $\mathcal M \otimes_{eh} \mathcal M$ (the extended Haagerup tensor product of $\mathcal M$ with itself) to avoid technicalities surrounding representation dependence of…
Associated to a finite graph $X$ is its quantum automorphism group $G$. The main problem is to compute the Poincar\'e series of $G$, meaning the series $f(z)=1+c_1z+c_2z^2+...$ whose coefficients are multiplicities of 1 into tensor powers…