Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 14 of 14 for “"graphical calculus"”.

  1. A graphical calculus for shifted symmetric functions

    … Olshanski [OO97]. This isomorphism lends us a graphical description of some important bases of the algebra of shifted symmetric functions. Conversely, we are also able to describe some important generators of the centre of the Heisenberg category in the language of shifted symmetric functions. …

    anu Repository record for A graphical calculus for shifted symmetric functions (opens in a new tab)

  2. PreVIEW: An untyped graphical calculus for resource-aware programming

    … due to a subtle but fundamental mismatch between graphical and textual representations of programs, semantic concepts established in the textual setting cannot be mapped to the graphical setting without a careful analysis of the connection between the two representations. Focusing on operational …

    rice Repository record for PreVIEW: An untyped graphical calculus for resource-aware programming (opens in a new tab)

  3. Thinking of (1,1) knots using elastic bands on peg-boards and combed glazing on the mille-feuille

    … Hanselman, J. Rasmussen and L. Watson, using a graphical calculus they developed for working with the bordered Floer theory. We relate these two perspectives, by providing in the final chapter a novel proof of Greene et al.’s criterion using the graphical calculus, recently expanded by A. …

    ubc Repository record for Thinking of (1,1) knots using elastic bands on peg-boards and combed glazing on the mille-feuille (opens in a new tab) Download PDF for Thinking of (1,1) knots using elastic bands on peg-boards and combed glazing on the mille-feuille (opens in a new tab)

  4. Manifold diagrams for higher categories

    We develop a graphical calculus of manifold diagrams which generalises string and surface dia- grams to arbitrary dimensions. Manifold diagrams are pasting diagrams for (∞,n)-categories that admit a semi-strict composition operation for which associativity and unitality is strict. The weak …

    oxford Repository record for Manifold diagrams for higher categories (opens in a new tab)

  5. Causal structure in categorical quantum mechanics

    … categorical quantum mechanics provides a graphical calculus that exposes the information flow of such protocols in an intuitive way. However, the graphical calculus also reveals surprising features of these protocols; for example, in the quantum teleportation protocol, information appears …

    oxford Repository record for Causal structure in categorical quantum mechanics (opens in a new tab)

  6. Global Vertex Algebras on Riemann Surfaces

    … In order to define this structure a formal calculus of fields on Riemann surfaces is constructed. The basic objects in vertex algebra theory are fields. They are defined as formal Laurent series with possibly infinite principal part. The coefficients are endomorphisms. As an example for such …

    lmu-germany Repository record for Global Vertex Algebras on Riemann Surfaces (opens in a new tab)

  7. Category-theoretic data structures and algorithms for learning polynomial circuits

    … from millions of generators. Finally, we give a graphical calculus allowing terms of non-strict monoidal categories to be represented by our data structure, which in turn yields novel proofs of Mac Lane’s strictness and coherence theorems.

    soton Download PDF for Category-theoretic data structures and algorithms for learning polynomial circuits (opens in a new tab)

  8. Coherence for 3-dualizable objects

    … theorems. The proofs rely on extensive use of a graphical calculus for strict monoidal 3-categories.</p>

    oxford Repository record for Coherence for 3-dualizable objects (opens in a new tab)

  9. Bicategorical aspects of topological quantum computation

    … 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.</p> <p>In …

    oxford Repository record for Bicategorical aspects of topological quantum computation (opens in a new tab)

  10. Category theory for quantum natural language processing

    … the notion of diagrammatic differentiation: a graphical calculus for computing the gradients of parameterised diagrams.</p>

    oxford Repository record for Category theory for quantum natural language processing (opens in a new tab)

  11. Completeness and the ZX-calculus

    <p>Graphical languages offer intuitive and rigorous formalisms for quantum physics. They can be used to simplify expressions, derive equalities, and do computations. Yet in order to replace conventional formalisms, rigour alone is not sufficient: the new formalisms also need to have equivalent …

    oxford Repository record for Completeness and the ZX-calculus (opens in a new tab)

  12. Synchronous and quantum games: Graphical and algebraic methods

    … games, strategies, and correlations using a graphical calculus for symmetric monoidal categories applied to the category of finite dimensional Hilbert spaces. This approach follows the overall program of categorical quantum mechanics. To this generalized setting of quantum games, we extend …

    waterloo Repository record for Synchronous and quantum games: Graphical and algebraic methods (opens in a new tab)

  13. Initialization and characterization of open quantum systems

    … of an open quantum system. We develop a graphical calculus for open quantum systems and use it to review the operational representation and characterization of noisy evolution using completely-positive maps, or quantum channels. These graphical techniques facilitate an intuitive …

    waterloo Repository record for Initialization and characterization of open quantum systems (opens in a new tab)

  14. !-Logic

    <p>Equational reasoning with string diagrams provides an intuitive method for proving equations between morphisms in various forms of monoidal category. !-Graphs were introduced with the intention of reasoning with infinite families of string diagrams by allowing repetition of sub-diagrams. …

    oxford Repository record for !-Logic (opens in a new tab)