Classical block designs are important combinatorial structures with a wide range of applications in Computer Science and Statistics. Here we give a new abstract description of block designs based on the arrow category construction. We show that models of this structure in the category of matrices and natural numbers recover the traditional classical combinatorial objects, while models in the category of completely positive maps yield a new definition of quantum designs. We show that this generalizes both a previous notion of quantum designs given by Zauner and the traditional description of block designs. Furthermore, we demonstrate that there exists a functor which relates every categorical block design to a quantum one.
Classical block designs are important combinatorial structures with a wide range of applications in Computer Science and Statistics. Here we give a new abstract description of block designs based on the arrow category construction. We show that models of this structure in the category of matrices and natural numbers recover the traditional classical combinatorial objects, while models in the category of completely positive maps yield a new definition of quantum designs. We show that this generalizes both a previous notion of quantum designs given by Zauner and the traditional description of block designs. Furthermore, we demonstrate that there exists a functor which relates every categorical block design to a quantum one.
This dissertation investigates well-known (quantum) combinatorial structures, such as (quantum) designs and (quantum) orthogonal Latin squares through the lenses of matrix algebras, group theory, and category theory. A central focus is placed on perfect tensors that are examined using representation theory and quasi-orthogonal subalgebras of matrix algebras. In particular, it is shown that the existence of a 2-unitary in dimension d-square is equivalent to the existence of four mutually quasi-orthogonal subalgebras of a d-square dimensional matrix algebra that are each isomorphic to a d-dimensional matrix algebra. This correspondence is further interpreted in terms of groups and their representations, relating the existence of perfect tensors to the existence of a group with a d-square dimensional irreducible representation and four subgroups on which the respective character “factorises“. A search algorithm implemented in the algebra software GAP is presented that was used to find examples of such groups. Furthermore, additional construction schemes for other dimensions, leading to 2-unitary complex Hadamard matrices, are developed using doubly perfect bi-unimodular sequences. Using the same ansatz, an analytical resolution of Euler’s 36 officers problem is provided, which differs from the earlier constructions of perfect tensors in dimension 36 via computer-assisted methods. Beyond this, the thesis introduces an abstract notion of categorical designs formulated via arrow categories. When applied to the categories Mat(N) and CP[FHilb], this framework produces a category-theoretic description of balanced incomplete block designs and of quantum designs, respectively. The construction generalises earlier definitions of quantum designs and extends it to a broader concept that can also be interpreted as combinatorial superoperators. These new concepts are used to define a category of mutually unbiased bases and a category of so-called combinatorial quantum channels.
We introduce the CP*-construction on a dagger compact closed category as a generalisation of Selinger's CPM-construction. While the latter takes a dagger compact closed category and forms its category of "abstract matrix algebras" and completely positive maps, the CP*-construction forms its category of "abstract C*-algebras" and completely positive maps. This analogy is justified by the case of finite-dimensional Hilbert spaces, where the CP*-construction yields the category of finite-dimensional C*-algebras and completely positive maps. The CP*-construction fully embeds Selinger's CPM-construction in such a way that the objects in the image of the embedding can be thought of as "purely quantum" state spaces. It also embeds the category of classical stochastic maps, whose image consists of "purely classical" state spaces. By allowing classical and quantum data to coexist, this provides elegant abstract notions of preparation, measurement, and more general quantum channels.
We propose a new 'quantum domain theory' in which Scott-continuous functions are replaced by Scott-continuous natural transformations. Completely positive maps are widely accepted as a model of first-order quantum computation. We begin by establishing a categorical characterization of completely positive maps as natural families of positive maps. We explore this categorical characterization by building various representations of quantum computation based on different structures: affine maps between cones of positive elements, morphisms of algebras of effects, and affine maps of convex sets of states. By focusing on convex dcpos, we develop a quantum domain theory and show that it supports some important constructions such as tensor products by quantum data, and lifting.
The paper is the contribution to quantum toposophy focusing on the abstract orthomodular structures (following Dunn-Moss-Wang terminology). Early quantum toposophical approach to "abstract quantum logic" was proposed based on the topos of functors [E,Sets] where E is a so-called orthomodular preorder category – a modification of categorically rewritten orthomodular lattice (taking into account that like any lattice it will be a finite co-complete preorder category). In the paper another kind of categorical semantics of quantum logic is discussed which is based on the modification of the topos construction itself – so called quantos – which would be evaluated as a non-classical modification of topos with some extra structure allowing to take into consideration the peculiarity of negation in orthomodular quantum logic. The algebra of subobjects of quantos is not the Heyting algebra but an orthomodular lattice. Quantoses might be apprehended as an abstract reflection of Landsman's proposal of "Bohrification", i.e., the mathematical interpretation of Bohr's classical concepts by commutative C∗-algebras, which in turn are studied in their quantum habitat of noncommutative C∗-algebras – more fundamental structures than commutative C∗-algebras. The Bohrification suggests that topos-theoretic approach also should be modified. Since topos by its nature is an intuitionistic construction then Bohrification in abstract case should be transformed in an application of categorical structure based on an orthomodular lattice which is more general construction than Heyting algebra – orthomodular lattices are non-distributive while Heyting algebras are distributive ones. Toposes thus should be studied in their quantum habitat of "orthomodular" categories i.e. of quntoses. Also an interpretation of some well-known systems of orthomodular quantum logic in quantos of functors [E,QSets] is constructed where QSets is a quantos (not a topos) of quantum sets. The completeness of those systems in respect to the semantics proposed is proved.
Quantum mechanics exhibits many counter-intuitive features, which challenge our classical understanding of the world. This makes the theory simultaneously difficult to grasp, and a source of great potential for new technologies. We study various characteristics of classical and quantum mechanics and their respective roles in computation. This is interesting from a philosophical perspective, as it brings us a small step closer to understanding the nature of quantum mechanics. Furthermore, it leads us to discover scenarios where quantum resources provide a genuine advantage over classical resources, as well as more intuitive ways to model quantum protocols. Firstly, we explore the concept of quantum contextuality, which distinguishes uniquely-quantum experimental outcomes from outcomes that can be realised classically. In pursuit of a universal theory of contextuality, we unify two abstract frameworks: the sheaf-theoretic approach to contextuality by Abramsky and Brandenburger and the equivalence-based approach by Spekkens. We apply the sheaf-theoretic formalism to the field of communication complexity. We derive a bound on the success probability of a communication complexity protocol, based on the amount of contextuality present in its quantum resource. We provide a set of necessary conditions for distributed functions that allow a contextual advantage. Secondly, we consider a family of bicategorical models to describe the interaction of classical and quantum information in quantum protocols. We prove that this family is symmetric monoidal, and therefore suitable for describing compound and parallel protocols. This family serves as a mathematical foundation for the planar language for quantum protocols by Vi- cary. Important examples of this family are the bicategories 2Hilb and 2Vect. Additionally, we introduce the structure 2[CP∗[FHilb]], which contains a symmetric monoidal bicategory of mixed states and completely positive maps. This allows a unified description of quantum teleportation and classical encryption in a single 2-category, as well as a universal security proof applicable simultaneously to both scenarios. As part of the process, we develop extensive categorical machinery for constructing symmetric monoidal structures of bicategories, pseudo functors, pseudo transformations and modifications. We consider a method of constructing symmetric monoidal bicategories from symmetric monoidal double categories. We show that this method can be generalised to a functor from the locally cubical bicategory of monoidal double categories to the locally cubical bicategory of monoidal bicategories.