1,987 research outputs found
A Diagrammatic Axiomatisation for Qubit Entanglement
Diagrammatic techniques for reasoning about monoidal categories provide an
intuitive understanding of the symmetries and connections of interacting
computational processes. In the context of categorical quantum mechanics,
Coecke and Kissinger suggested that two 3-qubit states, GHZ and W, may be used
as the building blocks of a new graphical calculus, aimed at a diagrammatic
classification of multipartite qubit entanglement that would highlight the
communicational properties of quantum states, and their potential uses in
cryptographic schemes.
In this paper, we present a full graphical axiomatisation of the relations
between GHZ and W: the ZW calculus. This refines a version of the preexisting
ZX calculus, while keeping its most desirable characteristics: undirectedness,
a large degree of symmetry, and an algebraic underpinning. We prove that the ZW
calculus is complete for the category of free abelian groups on a power of two
generators - "qubits with integer coefficients" - and provide an explicit
normalisation procedure.Comment: 12 page
ZH: A Complete Graphical Calculus for Quantum Computations Involving Classical Non-linearity
We present a new graphical calculus that is sound and complete for a
universal family of quantum circuits, which can be seen as the natural
string-diagrammatic extension of the approximately (real-valued) universal
family of Hadamard+CCZ circuits. The diagrammatic language is generated by two
kinds of nodes: the so-called 'spider' associated with the computational basis,
as well as a new arity-N generalisation of the Hadamard gate, which satisfies a
variation of the spider fusion law. Unlike previous graphical calculi, this
admits compact encodings of non-linear classical functions. For example, the
AND gate can be depicted as a diagram of just 2 generators, compared to ~25 in
the ZX-calculus. Consequently, N-controlled gates, hypergraph states,
Hadamard+Toffoli circuits, and diagonal circuits at arbitrary levels of the
Clifford hierarchy also enjoy encodings with low constant overhead. This
suggests that this calculus will be significantly more convenient for reasoning
about the interplay between classical non-linear behaviour (e.g. in an oracle)
and purely quantum operations. After presenting the calculus, we will prove it
is sound and complete for universal quantum computation by demonstrating the
reduction of any diagram to an easily describable normal form.Comment: In Proceedings QPL 2018, arXiv:1901.0947
Depicting qudit quantum mechanics and mutually unbiased qudit theories
We generalize the ZX calculus to quantum systems of dimension higher than
two. The resulting calculus is sound and universal for quantum mechanics. We
define the notion of a mutually unbiased qudit theory and study two particular
instances of these theories in detail: qudit stabilizer quantum mechanics and
Spekkens-Schreiber toy theory for dits. The calculus allows us to analyze the
structure of qudit stabilizer quantum mechanics and provides a geometrical
picture of qudit stabilizer theory using D-toruses, which generalizes the Bloch
sphere picture for qubit stabilizer quantum mechanics. We also use our
framework to describe generalizations of Spekkens toy theory to higher
dimensional systems. This gives a novel proof that qudit stabilizer quantum
mechanics and Spekkens-Schreiber toy theory for dits are operationally
equivalent in three dimensions. The qudit pictorial calculus is a useful tool
to study quantum foundations, understand the relationship between qubit and
qudit quantum mechanics, and provide a novel, high level description of quantum
information protocols.Comment: In Proceedings QPL 2014, arXiv:1412.810
Presenting Finite Posets
We introduce a monoidal category whose morphisms are finite partial orders,
with chosen minimal and maximal elements as source and target respectively.
After recalling the notion of presentation of a monoidal category by the means
of generators and relations, we construct a presentation of our category, which
corresponds to a variant of the notion of bialgebra.Comment: In Proceedings TERMGRAPH 2014, arXiv:1505.0681
Pictures of Processes: Automated Graph Rewriting for Monoidal Categories and Applications to Quantum Computing
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.
[...] 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. [...] 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. [...]
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.Comment: PhD Thesis. Passed examination. Minor corrections made and one
theorem added at the end of Chapter 5. 182 pages, ~300 figures. See full text
for unabridged abstrac
DisCoPy: the Hierarchy of Graphical Languages in Python
DisCoPy is a Python toolkit for computing with monoidal categories. It comes
with two flexible data structures for string diagrams: the first one for planar
monoidal categories based on lists of layers, the second one for symmetric
monoidal categories based on cospans of hypergraphs. Algorithms for functor
application then allow to translate string diagrams into code for numerical
computation, be it differentiable, probabilistic or quantum. This report gives
an overview of the library and the new developments released in its version
1.0. In particular, we showcase the implementation of diagram equality for a
large fragment of the hierarchy of graphical languages for monoidal categories,
as well as a new syntax for defining string diagrams as Python functions.Comment: 14 pages, 10 figure
Light-matter interaction in the ZXW calculus
In this paper, we develop a graphical calculus to rewrite photonic circuits
involving light-matter interactions and non-linear optical effects. We
introduce the infinite ZW calculus, a graphical language for linear operators
on the bosonic Fock space which captures both linear and non-linear photonic
circuits. This calculus is obtained by combining the QPath calculus, a
diagrammatic language for linear optics, and the recently developed qudit ZXW
calculus, a complete axiomatisation of linear maps between qudits. It comes
with a 'lifting' theorem allowing to prove equalities between infinite
operators by rewriting in the ZXW calculus. We give a method for representing
bosonic and fermionic Hamiltonians in the infinite ZW calculus. This allows us
to derive their exponentials by diagrammatic reasoning. Examples include phase
shifts and beam splitters, as well as non-linear Kerr media and Jaynes-Cummings
light-matter interaction.Comment: 27 pages, lots of figures, a previous version accepted to QPL 202
- …