Non-locality and contextuality are key features of quantum mechanics that distinguish it from classical physics. We aim to develop a deeper, more structural understanding of these phenomena, underpinned by robust and elegant mathematical theory with a view to providing clarity and new perspectives on conceptual and foundational issues. A general framework for logical non-locality is introduced and used to prove that 'Hardy's paradox' is complete for logical non-locality in all (2,2,l) and (2,k,2) Bell scenarios, a consequence of which is that Bell states are the only entangled two-qubit states that are not logically non-local, and that Hardy non-locality can be witnessed with certainty in a tripartite quantum system. A number of developments of the unified sheaf-theoretic approach to non-locality and contextuality are considered, including the first application of cohomology as a tool for studying the phenomena: we find cohomological witnesses corresponding to many of the classic no-go results, and completely characterise contextuality for large families of Kochen-Specker-like models. A connection with the problem of the existence of perfect matchings in k-uniform hypergraphs is explored, leading to new results on the complexity of deciding contextuality. A refinement of the sheaf-theoretic approach is found that captures partial approximations to locality/non-contextuality and can allow Bell models to be constructed from models of more general kinds which are equivalent in terms of non-locality/contextuality. Progress is made on bringing recent results on the nature of the wavefunction within the scope of the logical and sheaf-theoretic methods. Computational tools are developed for quantifying contextuality and finding generalised Bell inequalities for any measurement scenario which complement the research programme. This also leads to a proof that local ontological models with `negative probabilities' generate the no-signalling polytopes for all Bell scenarios.

This thesis contains four related papers which study different aspects of double constructions for braided Hopf algebras. The main result is a categorical action of a braided version of the Drinfeld center on a Heisenberg analogue, called the Hopf center. Moreover, an application of this action to the representation theory of rational Cherednik algebras is considered. Chapter 1 : In this chapter, the Drinfeld center of a monoidal category is generalized to a class of mixed Drinfeld centers. This gives a unified picture for the Drinfeld center and a natural Heisenberg analogue. Further, there is an action of the former on the latter. This picture is translated to a description in terms of Yetter-Drinfeld and Hopf modules over quasi-bialgebras in a braided monoidal category. Via braided reconstruction theory, intrinsic definitions of braided Drinfeld and Heisenberg doubles are obtained, together with a generalization of the result of Lu (1994) that the Heisenberg double is a 2-cocycle twist of the Drinfeld double for general braided Hopf algebras. Chapter 2 : In this chapter, we present an approach to the definition of multiparameter quantum groups by studying Hopf algebras with triangular decomposition. Classifying all of these Hopf algebras which are of what we call weakly separable type, we obtain a class of pointed Hopf algebras which can be viewed as natural generalizations of multiparameter deformations of universal enveloping algebras of Lie algebras. These Hopf algebras are instances of a new version of braided Drinfeld doubles, which we call asymmetric braided Drinfeld doubles. This is a generalization of an earlier result by Benkart and Witherspoon (2004) who showed that two-parameter quantum groups are Drinfeld doubles. It is possible to recover a Lie algebra from these doubles in the case where the group is free and the parameters are generic. The Lie algebras arising are generated by Lie subalgebras isomorphic to sl2. Chapter 3 : The universal enveloping algebra <i>U</i>(tr_n) of a Lie algebra associated to the classical Yang-Baxter equation was introduced in 2006 by Bartholdi-Enriquez-Etingof-Rains where it was shown to be Koszul. This algebra appears as the A_<i>n</i>-1 case in a general class of braided Hopf algebras in work of Bazlov-Berenstein (2009) for any complex reection group. In this chapter, we show that the algebras corresponding to the series <i>B_n</i> and <i>D_n</i>, which are again universal enveloping algebras, are Koszul. This is done by constructing a PBW-basis for the quadratic dual. We further show how results of Bazlov-Berenstein can be used to produce pairs of adjoint functors between categories of rational Cherednik algebra representations of different rank and type for the classical series of Coxeter groups. Chapter 4 : Quantum groups can be understood as braided Drinfeld doubles over the group algebra of a lattice. The main objects of this chapter are certain braided Drinfeld doubles over the Drinfeld double of an irreducible complex reflection group. We argue that these algebras are analogues of the Drinfeld-Jimbo quantum enveloping algebras in a setting relevant for rational Cherednik algebra. This analogy manifests itself in terms of categorical actions, related to the general Drinfeld-Heisenberg double picture developed in Chapter 2, using embeddings of Bazlov and Berenstein (2009). In particular, this work provides a class of quasitriangular Hopf algebras associated to any complex reflection group which are in some cases finite-dimensional.

This thesis studies the categorical formalisation of quantum computing, through the prism of type theory, in a three-tier process. The first stage of our investigation involves the creation of the dagger lambda calculus, a lambda calculus for dagger compact categories. Our second contribution lifts the expressive power of the dagger lambda calculus, to that of a quantum programming language, by adding classical control in the form of complementary classical structures and dualisers. Finally, our third contribution demonstrates how our lambda calculus can be applied to various well known problems in quantum computation: Quantum Key Distribution, the quantum Fourier transform, and the teleportation protocol.

Models of geometry that are intrinsically quantum-mechanical in nature arise from the recoupling theory of space-time symmetry groups. Roger Penrose constructed such a model from SU(2) recoupling in his theory of spin networks; he showed that spin measurements in a classical limit are necessarily consistent with a three-dimensional Euclidian vector space. T. Regge and G. Ponzano expressed the semi-classical limit of this spin model in a form resembling a path integral of the Einstein-Hilbert action in three Euclidian dimensions. This thesis gives new proofs of the Penrose spin geometry theorem and of the Regge-Ponzano decomposition theorem. We then consider how to generalize these two approaches to other groups that give rise to new models of quantum geometries. In particular, we show how to construct quantum models of four-dimensional relativistic space-time from the re-coupling theory of the Poincare group.

This work is about diagrammatic languages, how they can be represented, and what they in turn can be used to represent. More specifically, it focuses on representations and applications of string diagrams. String diagrams are used to represent a collection of processes, depicted as "boxes" with multiple (typed) inputs and outputs, depicted as "wires". If we allow plugging input and output wires together, we can intuitively represent complex compositions of processes, formalised as morphisms in a monoidal category. While string diagrams are very intuitive, existing methods for defining them rigorously rely on topological notions that do not extend naturally to automated computation. The first major contribution of this dissertation is the introduction of a discretised version of a string diagram called a string graph. String graphs form a partial adhesive category, so they can be manipulated using double-pushout graph rewriting. Furthermore, we show how string graphs modulo a rewrite system can be used to construct free symmetric traced and compact closed categories on a monoidal signature. The second contribution is in the application of graphical languages to quantum information theory. We use a mixture of diagrammatic and algebraic techniques to prove a new classification result for strongly complementary observables. Namely, maximal sets of strongly complementary observables of dimension D must be of size no larger than 2, and are in 1-to-1 correspondence with the Abelian groups of order D. We also introduce a graphical language for multipartite entanglement and illustrate a simple graphical axiom that distinguishes the two maximally-entangled tripartite qubit states: GHZ and W. Notably, we illustrate how the algebraic structures induced by these operations correspond to the (partial) arithmetic operations of addition and multiplication on the complex projective line. The third contribution is a description of two software tools developed in part by the author to implement much of the theoretical content described here. The first tool is Quantomatic, a desktop application for building string graphs and graphical theories, as well as performing automated graph rewriting visually. The second is QuantoCoSy, which performs fully automated, model-driven theory creation using a procedure called conjecture synthesis.

A measurement-independent formulation of quantum mechanics called ‘regular histories’ (RH) is presented, able to reproduce the predictions of the standard formalism without the need to for a quantum-classical divide or the presence of an observer. It applies to closed systems and features no wave-function collapse. Weights are assigned only to histories satisfying a criterion called ‘regularity’. As the set of regular histories is not closed under the Boolean operations this requires a new con- cept of weight, called ‘likelihood’. Remarkably, this single change is enough to overcome many of the well-known obstacles to a sensible interpretation of quantum mechanics. For example, Bell’s theorem, which makes essential use of probabilities, places no constraints on the locality properties of a theory based on likelihoods. Indeed, RH is both counter- factually definite and free from action-at-a-distance. Moreover, in RH the meaningful histories are exactly those that can be witnessed at least in principle. Since it is especially difficult to make sense of the concept of probability for histories whose occurrence is intrinsically indeterminable, this makes likelihoods easier to justify than probabilities. Interaction with the environment causes the kinds of histories relevant at the macroscopic scale of human experience to be witnessable and indeed to generate Boolean algebras of witnessable histories, on which likelihoods reduce to ordinary probabilities. Further- more, a formal notion of inference defined on regular histories satisfies, when restricted to such Boolean algebras, the classical axioms of implication, explaining our perception of a largely classical world. Even in the context of general quantum histories the rules of reasoning in RH are remark- ably intuitive. Classical logic must only be amended to reflect the fundamental premise that one cannot meaningfully talk about the occurrence of unwitnessable histories. Crucially, different histories with the same ‘physical content’ can be interpreted in the same way and independently of the family in which they are expressed. RH thereby rectifies a critical flaw of its inspiration, the consistent histories (CH) approach, which requires either an as yet unknown set selection rule or a paradigm shift towards an un- conventional picture of reality whose elements are histories-with-respect-to-a-framework. It can be argued that RH compares favourably with other proposed interpretations of quantum mechanics in that it resolves the measurement problem while retaining an essentially classical worldview without parallel universes, a framework-dependent reality or action-at-a-distance.

The aim of this thesis is to present an extension to the string graphs of Dixon, Duncan and Kissinger that allows the finite representation of certain infinite families of graphs and graph rewrite rules, and to demonstrate that a logic can be built on this to allow the formalisation of inductive proofs in the string diagrams of compact closed and traced symmetric monoidal categories. String diagrams provide an intuitive method for reasoning about monoidal categories. However, this does not negate the ability for those using them to make mistakes in proofs. To this end, there is a project (Quantomatic) to build a proof assistant for string diagrams, at least for those based on categories with a notion of trace. The development of string graphs has provided a combinatorial formalisation of string diagrams, laying the foundations for this project. The prevalence of commutative Frobenius algebras (CFAs) in quantum information theory, a major application area of these diagrams, has led to the use of variable-arity nodes as a shorthand for normalised networks of Frobenius algebra morphisms, so-called "spider notation". This notation greatly eases reasoning with CFAs, but string graphs are inadequate to properly encode this reasoning. This dissertation firstly extends string graphs to allow for variable-arity nodes to be represented at all, and then introduces !-box notation – and structures to encode it – to represent string graph equations containing repeated subgraphs, where the number of repetitions is abitrary. This can be used to represent, for example, the "spider law" of CFAs, allowing two spiders to be merged, as well as the much more complex generalised bialgebra law that can arise from two interacting CFAs. This work then demonstrates how we can reason directly about !-graphs, viewed as (typically infinite) families of string graphs. Of particular note is the presentation of a form of graph-based induction, allowing the formal encoding of proofs that previously could only be represented as a mix of string diagrams and explanatory text.

Many problems in applied mathematics and physics are formulated most naturally in terms of matrices, and can be solved by computing functions of these matrices. For example, in quantum mechanics, the coherent dynamics of physical systems is described by the matrix exponential of their Hamiltonian. In state of the art experiments, one can now observe such unitary evolution of many-body systems, which is of fundamental interest in the study of many-body quantum phenomena. On the other hand the theoretical simulation of such non-equilibrium many-body dynamics is very challenging. In this thesis, we develop a symbolic approach to matrix functions and quantum dynamics based on a novel algebraic structure we identify for sets of walks on graphs. We begin by establishing the graph theoretic equivalent to the fundamental theorem of arithmetic: all the walks on any finite digraph uniquely factorise into products of prime elements. These are the simple paths and simple cycles, walks forbidden from visiting any vertex more than once. We give an algorithm that efficiently factorises individual walks and obtain a recursive formula to factorise sets of walks. This yields a universal continued fraction representation for the formal series of all walks on digraphs. It only involves simple paths and simple cycles and is thus called a path-sum. In the second part, we recast matrix functions into path-sums. We present explicit results for a matrix raised to a complex power, the matrix exponential, matrix inverse, and matrix logarithm. We introduce generalised matrix powers which extend desirable properties of the Drazin inverse to all powers of a matrix. In the third part, we derive an intermediary form of path-sum, called walk-sum, relying solely on physical considerations. Walk-sum describes the dynamics of a quantum system as resulting from the coherent superposition of its histories, a discrete analogue to the Feynman path-integrals. Using walk-sum we simulate the dynamics of quantum random walks and of Rydberg-excited Mott insulators. Using path-sum, we demonstrate many-body Anderson localisation in an interacting disordered spin system. We give two observable signatures of this phenomenon: localisation of the system magnetisation and of the linear magnetic response function. Lastly we return to the study of sets of walks. We show that one can construct as many representations of series of walks as there are ways to define a walk product such that the factorisation of a walk always exist and is unique. Illustrating this result we briefly present three further methods to evaluate functions of matrices. Regardless of the method used, we show that graphs are uniquely characterised, up to an isomorphism, by the prime walks they sustain.

In this thesis I discuss the nature of ‘measurement’ in quantum theory. ‘Measurement’ is associated with several different processes: the gradual imprinting of information about one system onto another, which is well understood; the collapse of the wavefunction, which is ill-defined and troublesome; and finally, the means by which inferences about unknown experimental parameters are made. I present a theoretical extension to an experimental proposal from Leggett and Garg, who suggested that the quantum-or-classical reality of a macroscopic system may be probed with successive measurements arrayed in time. The extension allows for a finite level of imperfection in the protocol, and makes use of Leggett’s ‘null result’ measurement scheme. I present the results of an experiment conducted in Oxford that, up to certain loopholes, defies a non-quantum interpretation of the dynamics of phosphorous nuclei embedded in silicon. I also present the theory of statistical parameter estimation, and discover that a recent trend to employ time symmetric ‘postselected’ measurements offers no true advantage over standard methods. The technique, known as weak-value amplification, combines a weak transfer of quantum information from system to meter with conditional data rejection, to surprising effect. The Fisher information is a powerful tool for evaluating the performance of any parameter estimation model, and it reveals the technique to be worse than ordinary, preselected only measurements. That this is true despite the presence of noise (including magnetic field fluctuations causing deco- herence, poor resolution detection, and random displacements), casts serious doubt on the utility of the method.

The provision of compositionality in distributional models of meaning, where a word is represented as a vector of co-occurrence counts with every other word in the vocabulary, offers a solution to the fact that no text corpus, regardless of its size, is capable of providing reliable co-occurrence statistics for anything but very short text constituents. The purpose of a compositional distributional model is to provide a function that composes the vectors for the words within a sentence, in order to create a vectorial representation that re ects its meaning. Using the abstract mathematical framework of category theory, Coecke, Sadrzadeh and Clark showed that this function can directly depend on the grammatical structure of the sentence, providing an elegant mathematical counterpart of the formal semantics view. The framework is general and compositional but stays abstract to a large extent. This thesis contributes to ongoing research related to the above categorical model in three ways: Firstly, I propose a concrete instantiation of the abstract framework based on Frobenius algebras (joint work with Sadrzadeh). The theory improves shortcomings of previous proposals, extends the coverage of the language, and is supported by experimental work that improves existing results. The proposed framework describes a new class of compositional models thatfind intuitive interpretations for a number of linguistic phenomena. Secondly, I propose and evaluate in practice a new compositional methodology which explicitly deals with the different levels of lexical ambiguity (joint work with Pulman). A concrete algorithm is presented, based on the separation of vector disambiguation from composition in an explicit prior step. Extensive experimental work shows that the proposed methodology indeed results in more accurate composite representations for the framework of Coecke et al. in particular and every other class of compositional models in general. As a last contribution, I formalize the explicit treatment of lexical ambiguity in the context of the categorical framework by resorting to categorical quantum mechanics (joint work with Coecke). In the proposed extension, the concept of a distributional vector is replaced with that of a density matrix, which compactly represents a probability distribution over the potential different meanings of the specific word. Composition takes the form of quantum measurements, leading to interesting analogies between quantum physics and linguistics.