We present an infinite number of construction schemes for quantum structures, including unitary error bases, Hadamard matrices, quantum Latin squares and controlled families, many of which have not previously been described. Our results rely on the type structure of biunitary connections, 2-categorical structures which play a central role in the theory of planar algebras. They have an attractive graphical calculus which allows simple correctness proofs for the constructions we present. We apply these techniques to construct a unitary error basis that cannot be built using any previously known method.
We present an infinite number of construction schemes for quantum structures, including unitary error bases, Hadamard matrices, quantum Latin squares and controlled families, many of which have not previously been described. Our results rely on the type structure of biunitary connections, 2-categorical structures which play a central role in the theory of planar algebras. They have an attractive graphical calculus which allows simple correctness proofs for the constructions we present. We apply these techniques to construct a unitary error basis that cannot be built using any previously known method.
We present an infinite number of construction schemes involving unitary error bases, Hadamard matrices, quantum Latin squares and controlled families, many of which have not previously been described. Our results rely on biunitary connections, algebraic objects which play a central role in the theory of planar algebras. They have an attractive graphical calculus which allows simple correctness proofs for the constructions we present. We apply these techniques to construct a unitary error basis that cannot be built using any previously known method.
Unitary error bases have a great number of applications across quantum information and quantum computation, and are fundamentally linked to quantum teleportation, dense coding and quantum error correction. Werner's combinatorial construction builds a unitary error basis from a family of Hadamard matrices and a Latin square. In this dissertation, I give a new categorical axiomatisation of Latin squares, and use this to give a fully graphical presentation and proof of the correctness of Werner's construction. The categorical approach makes clear that some of the Latin square axioms are unnecessary for the construction to go through, and I propose a generalised construction scheme with the potential to create new classes of unitary error bases.
A central theme of this thesis is the quantization and generalization of objects from areas of mathematics such as set theory and combinatorics with application to quantum information. We represent mathematical objects such as Latin squares or functions as string diagrams over the category of finite-dimensional Hilbert spaces obeying various diagrammatic axioms. This leads to a direct understanding of how these objects arise in quantum mechanics and gives insight into how quantum analogues can be defined. In Part I of this thesis we introduce quantum Latin squares (QLS), quantum objects which generalize the classical Latin squares from combinatorics. We present a new method for constructing a unitary error basis (UEB) from a quantum Latin square equipped with extra data, which we show simultaneously generalizes the existing shift-and-multiply and Hadamard methods. We introduce two different notions of orthogonality for QLS which we use to construct families of mutually unbiased bases and perfect tensors respectively. We also introduce a further generalization of Latin squares called quantum Latin isometry squares. We use these to produce quantum error codes and to give a new way of characterizing UEBs. In Part II we show that maximal families of mutually unbiased bases (MUBs) are characterized in all dimensions by partitioned UEBs, up to a choice of a family of Hadamards. Furthermore, we give a new construction of partitioned UEBs, and thus maximal families of MUBs, from a finite field, which is simpler and more direct than previous proposals. We introduce new tensor diagrammatic characterizations of maximal families of MUBs, partitioned UEBs, and finite fields as algebraic structures defined over Hilbert spaces. In Part III we introduce quantum functions and quantum sets, which quantize the classical notions. We show that these structures form a 2-category QSet. We extend this framework to introduce quantum graphs and quantum homomorphisms which form a 2-category QGraph. We show that these 2-categories capture several different notions of quantum morphism and noncommutative graph from various previous papers in noncommutative topology, quantum non-local games and quantum information. We later use the correspondence between our quantum graph morphisms and those from quantum non-local games to show that pairs of quantum isomorphic graphs with multiple connected components are built up of quantum isomorphisms on those components.
Quantum Latin Squares have emerged as mathematical structures of interest in quantum information theory. This paper provides a comprehensive overview of quantum Latin squares. We aim to synthesize the current knowledge for the benefit of researchers in quantum information theory. We begin by establishing the theoretical foundation linking classical Latin squares with their quantum counterparts. This provides insight into their potential applications, particularly in the realm of quantum error correction. Through a detailed examination, we outline known constructions and elucidate the properties of quantum Latin squares, highlighting their role within quantum computing frameworks. We then explore the relationships of quantum Latin squares with mutually unbiased bases and unitary error bases. This underscores their importance in the construction of quantum error correcting codes using mutually orthogonal quantum Latin squares. We give significant focus to a comparative analysis between classical and quantum Latin squares, particularly in their applications to error correcting codes. The applications are analogous to the application of classical Latin squares to classical error correcting codes. This overview aims to not only compile existing research but also to inspire further exploration into Quantum Latin squares and their applications in quantum information theory.
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.
Abstract Monoidal category theory serves as a powerful framework for describing logical aspects of quantum theory, giving an abstract language for parallel and sequential composition and a conceptual way to understand many high-level quantum phenomena. Here, we lay the foundations for this categorical quantum mechanics, with an emphasis on the graphical calculus that makes computation intuitive. We describe superposition and entanglement using biproducts and dual objects, and show how quantum teleportation can be studied abstractly using these structures. We investigate monoids, Frobenius structures and Hopf algebras, showing how they can be used to model classical information and complementary observables. We describe the CP construction, a categorical tool to describe probabilistic quantum systems. The last chapter introduces higher categories, surface diagrams and 2-Hilbert spaces, and shows how the language of duality in monoidal 2-categories can be used to reason about quantum protocols, including quantum teleportation and dense coding. Previous knowledge of linear algebra, quantum information or category theory would give an ideal background for studying this text, but it is not assumed, with essential background material given in a self-contained introductory chapter. Throughout the text, we point out links with many other areas, such as representation theory, topology, quantum algebra, knot theory and probability theory, and present nonstandard models including sets and relations. All results are stated rigorously and full proofs are given as far as possible, making this book an invaluable reference for modern techniques in quantum logic, with much of the material not available in any other textbook.