We present a topological bicategorical syntax for the interaction between public and private information in classical information theory. This allows high-level graphical definitions of encrypted communication and secret sharing, including a characterization of their security properties, which are automatically satisfied with no extra axioms required. This analysis shows that these protocols have an identical abstract form to the quantum teleportation and dense coding procedures, giving a concrete mathematical analogy between quantum and classical computing. Specific implementations of these protocols as nondeterministic classical procedures are recovered by applying our formalism in a symmetric monoidal bicategory of matrices of relations. http://www.elsevier.nl/locate/entcs.
We present a topological bicategorical syntax for the interaction between public and private information in classical information theory. This allows high-level graphical definitions of encrypted communication and secret sharing, including a characterization of their security properties, which are automatically satisfied with no extra axioms required. This analysis shows that these protocols have an identical abstract form to the quantum teleportation and dense coding procedures, giving a concrete mathematical analogy between quantum and classical computing. Specific implementations of these protocols as nondeterministic classical procedures are recovered by applying our formalism in a symmetric monoidal bicategory of matrices of relations. http://www.elsevier.nl/locate/entcs.
We outline a bicategorical syntax for the interaction between public and private information in classical information theory. We use this to give high-level graphical definitions of encrypted communication and secret sharing protocols, including a characterization of their security properties. Remarkably, this makes it clear that the protocols have an identical abstract form to the quantum teleportation and dense coding procedures, yielding evidence of a deep connection between classical and quantum information processing. We also formulate public-key cryptography using our scheme. Specific implementations of these protocols as nondeterministic classical procedures are recovered by applying our formalism in a symmetric monoidal bicategory of matrices of relations.
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.
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 the 2-category of 2-Hilbert spaces recovers ordinary quantum theory. The formalism gives a simple, graphical way to describe the specification and implementation of certain quantum procedures, which we use to investigate quantum teleportation, dense coding, complementarity and quantum erasure, verifying our results computationally using a software package.
We propose a higher semantics for the description of quantum protocols, which deals with quantum and classical information in a unified way. Central to our approach is the modelling of classical data by information transfer to the environment, and the use of 2-category theory to formalize the resulting framework. This 2-categorical semantics has a graphical calculus, the diagrams of which correspond exactly to physically-implementable quantum procedures. Quantum teleportation in its most general sense is reformulated as the ability to remove correlations between a quantum system and its environment, and is represented by an elegant graphical identity. We use this new formalism to describe two new families of quantum protocols.
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.
Topological quantum computation offers a paradigm shift for fault-tolerant quantum computation. It proposes encoding qubits in the mutual states of quasiparticles (called anyons) of 2-dimensional topologically ordered matter. Unitary ribbon fusion categories describe the algebraic theory of anyons. Although the category of an anyonic theory specifies suitable computational spaces, qubits, and quantum gates, it does not precisely formalise the category of topological quantum computation (TQC). We describe the TQC category using the elements of categorical quantum mechanics (CQM). Given the qubit-based graphical calculus accompanying CQM, called the ZX-calculus, we present the details of the ZX-representation of Fibonacci and Ising anyons. Finally, we propose a bicategorical approach to convene anyonic theory and TQC in one (bi)category. In the second part of the thesis, we discuss how the bicategory of module categories formalises boundary types and their excitations. We show theorems that reduce the data to physically meaningful data. A 2-category capable of describing topological quantum computation with point-like and string-like excitations is speculated to be a fusion 2-category. We discuss the available definition in the literature. The paper particularly lacks a rigorous definition for additive 2-categories; in this thesis, we give a definition. We propose the idea of typing higher-ranked matrices in additive 2-categories. Lastly, we overview the complete definition of monoidal 2-categories and recover Kapranov and Voevodsky's definition from the algebraic definition of tricategory by Gurski. This definition and the detailed list of data are the complete ingredients physicists need for quantum computation with higher dimensional excitations.