String diagrams are a formal graphical language for representing
morphisms
In mathematics, particularly in category theory, a morphism is a structure-preserving map from one mathematical structure to another one of the same type. The notion of morphism recurs in much of contemporary mathematics. In set theory, morphism ...
in
monoidal categories, or more generally 2-cells in
2-categories
In category theory, a strict 2-category is a category with "morphisms between morphisms", that is, where each hom-set itself carries the structure of a category. It can be formally defined as a category enriched over Cat (the category of categ ...
. They are a prominent tool in
applied category theory
Applied category theory is an academic discipline in which methods from category theory are used to study other fields including but not limited to computer science, physics (in particular quantum mechanics), natural language processing, control th ...
. When interpreted in the monoidal category of
vector spaces
In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called ''vectors'', may be added together and multiplied ("scaled") by numbers called '' scalars''. Scalars are often real numbers, but c ...
and
linear map
In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping V \to W between two vector spaces that pr ...
s with the
tensor product
In mathematics, the tensor product V \otimes W of two vector spaces and (over the same Field (mathematics), field) is a vector space to which is associated a bilinear map V\times W \to V\otimes W that maps a pair (v,w),\ v\in V, w\in W to an e ...
, string diagrams are called
tensor network
Tensor networks or tensor network states are a class of variational wave functions used in the study of many-body quantum systems. Tensor networks extend one-dimensional matrix product states to higher dimensions while preserving some of their use ...
s or
Penrose graphical notation
In mathematics and physics, Penrose graphical notation or tensor diagram notation is a (usually handwritten) visual depiction of multilinear functions or tensors proposed by Roger Penrose in 1971. A diagram in the notation consists of several sha ...
. This has led to the development of
categorical quantum mechanics
Categorical quantum mechanics is the study of quantum foundations and quantum information using paradigms from mathematics and computer science, notably monoidal category theory. The primitive objects of study are physical processes, and the diff ...
where the axioms of quantum theory are expressed in the language of monoidal categories.
History
Günter Hotz gave the first mathematical definition of string diagrams in order to formalise
electronic circuit
An electronic circuit is composed of individual electronic components, such as resistors, transistors, capacitors, inductors and diodes, connected by conductive wires or traces through which electric current can flow. It is a type of electri ...
s, but the article remained confidential because of the absence of an English translation. The invention of string diagrams is usually credited to
Roger Penrose
Sir Roger Penrose (born 8 August 1931) is an English mathematician, mathematical physicist, philosopher of science and Nobel Laureate in Physics. He is Emeritus Rouse Ball Professor of Mathematics in the University of Oxford, an emeritus f ...
with
Feynman diagram
In theoretical physics, a Feynman diagram is a pictorial representation of the mathematical expressions describing the behavior and interaction of subatomic particles. The scheme is named after American physicist Richard Feynman, who introdu ...
s also described as a precursor. They were later characterised as the arrows of
free monoidal categories in a seminal article by
André Joyal
André Joyal (; born 1943) is a professor of mathematics at the Université du Québec à Montréal who works on category theory. He was a member of the School of Mathematics at the Institute for Advanced Study in 2013, where he was invited to j ...
and
Ross Street
Ross Howard Street (born 29 September 1945, Sydney) is an Australian mathematician specialising in category theory.[LaTeX
Latex is an emulsion (stable dispersion) of polymer microparticles in water. Latexes are found in nature, but synthetic latexes are common as well.
In nature, latex is found as a milky fluid found in 10% of all flowering plants (angiosper ...]
and
PGF/TikZ
PGF/Ti''k''Z is a pair of languages for producing vector graphics (e.g., technical illustrations and drawings) from a geometric/algebraic description, with standard features including the drawing of points, lines, arrows, paths, circles, ellipse ...
made the publication of string diagrams more wide-spread.
The
existential graph
An existential graph is a type of diagrammatic or visual notation for logical expressions, proposed by Charles Sanders Peirce, who wrote on graphical logic as early as 1882,Peirce, C. S., "n Junctures and Fractures in Logic (editors' title for M ...
s and
diagrammatic reasoning of
Charles Sanders Peirce
Charles Sanders Peirce ( ; September 10, 1839 – April 19, 1914) was an American philosopher, logician, mathematician and scientist who is sometimes known as "the father of pragmatism".
Educated as a chemist and employed as a scientist for ...
are arguably the oldest form of string diagrams, they are interpreted in the monoidal category of
finite sets and
relations
Relation or relations may refer to:
General uses
*International relations, the study of interconnection of politics, economics, and law on a global level
*Interpersonal relationship, association or acquaintance between two or more people
*Public ...
with the
Cartesian product
In mathematics, specifically set theory, the Cartesian product of two sets ''A'' and ''B'', denoted ''A''×''B'', is the set of all ordered pairs where ''a'' is in ''A'' and ''b'' is in ''B''. In terms of set-builder notation, that is
: A\ ...
. The lines of identity of Peirce's existential graphs can be axiomatised as a
Frobenius algebra
In mathematics, especially in the fields of representation theory and module theory, a Frobenius algebra is a finite-dimensional unital associative algebra with a special kind of bilinear form which gives the algebras particularly nice duality ...
, the cuts are unary operators on homsets that axiomatise
logical negation
In logic, negation, also called the logical complement, is an operation that takes a proposition P to another proposition "not P", written \neg P, \mathord P or \overline. It is interpreted intuitively as being true when P is false, and false ...
. This makes string diagrams a
sound
In physics, sound is a vibration that propagates as an acoustic wave, through a transmission medium such as a gas, liquid or solid.
In human physiology and psychology, sound is the ''reception'' of such waves and their ''perception'' by ...
and
complete
Complete may refer to:
Logic
* Completeness (logic)
* Completeness of a theory, the property of a theory that every formula in the theory's language or its negation is provable
Mathematics
* The completeness of the real numbers, which implies ...
two-dimensional
deduction system
A formal system is an abstract structure used for inferring theorems from axioms according to a set of rules. These rules, which are used for carrying out the inference of theorems from axioms, are the logical calculus of the formal system.
A form ...
for
first-order logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quanti ...
, invented independently from the one-dimensional syntax of
Gottlob Frege
Friedrich Ludwig Gottlob Frege (; ; 8 November 1848 – 26 July 1925) was a German philosopher, logician, and mathematician. He was a mathematics professor at the University of Jena, and is understood by many to be the father of analytic ph ...
's
Begriffsschrift
''Begriffsschrift'' (German for, roughly, "concept-script") is a book on logic by Gottlob Frege, published in 1879, and the formal system set out in that book.
''Begriffsschrift'' is usually translated as ''concept writing'' or ''concept notati ...
.
Intuition
String diagrams are made of boxes
, which represent
processes
A process is a series or set of activities that interact to produce a result; it may occur once-only or be recurrent or periodic.
Things called a process include:
Business and management
*Business process, activities that produce a specific se ...
, with a list of wires
coming in at the top and
at the bottom, which represent the input and output
systems being processed by the box
. Starting from a collection of wires and boxes, called a signature, one may generate the set of all string diagrams by induction:
* each box
is a string diagram,
* for each list of wires
, the
identity is a string diagram representing the process which does nothing to its input system, it is drawn as a bunch of parallel wires,
* for each pair of string diagrams
and
, their
tensor
In mathematics, a tensor is an algebraic object that describes a multilinear relationship between sets of algebraic objects related to a vector space. Tensors may map between different objects such as vectors, scalars, and even other tens ...
is a string diagram representing the parallel composition of processes, it is drawn as the horizontal concatenation of the two diagrams,
* for each pair of string diagrams
and
, their
composition
Composition or Compositions may refer to:
Arts and literature
* Composition (dance), practice and teaching of choreography
*Composition (language), in literature and rhetoric, producing a work in spoken tradition and written discourse, to include ...
is a string diagram representing the sequential composition of processes, it is drawn as the vertical concatenation of the two diagrams.
Definition
Algebraic
Let the
Kleene star
In mathematical logic and computer science, the Kleene star (or Kleene operator or Kleene closure) is a unary operation, either on sets of strings or on sets of symbols or characters. In mathematics,
it is more commonly known as the free monoid ...
denote the
free monoid In abstract algebra, the free monoid on a set is the monoid whose elements are all the finite sequences (or strings) of zero or more elements from that set, with string concatenation as the monoid operation and with the unique sequence of zero elem ...
, i.e. the set of lists with elements in a set
.
A monoidal signature
is given by:
* a set
of generating objects, the lists of generating objects in
are also called types,
* a set
of generating arrows, also called boxes,
* a pair of functions
which assign a domain and codomain to each box, i.e. the input and output types.
A morphism of monoidal signature
is a pair of functions
and
which is compatible with the domain and codomain, i.e. such that
and
. Thus we get the category
of monoidal signatures and their morphisms.
There is a
forgetful functor In mathematics, in the area of category theory, a forgetful functor (also known as a stripping functor) 'forgets' or drops some or all of the input's structure or properties 'before' mapping to the output. For an algebraic structure of a given sig ...
which sends a monoidal category to its underlying signature and a
monoidal functor
In category theory, monoidal functors are functors between monoidal categories which preserve the monoidal structure. More specifically, a monoidal functor between two monoidal categories consists of a functor between the categories, along with t ...
to its underlying morphism of signatures, i.e. it forgets the identity, composition and tensor. The
free functor
In mathematics, the idea of a free object is one of the basic concepts of abstract algebra. Informally, a free object over a set ''A'' can be thought of as being a "generic" algebraic structure over ''A'': the only equations that hold between ele ...
, i.e. the
left adjoint
In mathematics, specifically category theory, adjunction is a relationship that two functors may exhibit, intuitively corresponding to a weak form of equivalence between two related categories. Two functors that stand in this relationship are k ...
to the forgetful functor, sends a monoidal signature
to the
free monoidal category it generates.
String diagrams (with generators from
) are arrows in the free monoidal category
. The interpretation in a monoidal category
is a defined by a monoidal functor
, which by freeness is uniquely determined by a morphism of monoidal signatures
. Intuitively, once the image of generating objects and arrows are given, the image of every diagram they generate is fixed.
Geometric
A
topological graph
In mathematics, a topological graph is a representation of a graph in the plane, where the ''vertices'' of the graph are represented by distinct points and the ''edges'' by Jordan arcs (connected pieces of ''Jordan curves'') joining the corres ...
, also called a one-dimensional
cell complex
A CW complex (also called cellular complex or cell complex) is a kind of a topological space that is particularly important in algebraic topology. It was introduced by J. H. C. Whitehead (open access) to meet the needs of homotopy theory. This cla ...
, is a tuple
of a
Hausdorff space
In topology and related branches of mathematics, a Hausdorff space ( , ), separated space or T2 space is a topological space where, for any two distinct points, there exist neighbourhoods of each which are disjoint from each other. Of the many ...
, a
closed discrete subset
]
In mathematics, a point ''x'' is called an isolated point of a subset ''S'' (in a topological space ''X'') if ''x'' is an element of ''S'' and there exists a neighborhood of ''x'' which does not contain any other points of ''S''. This is equi ...
of nodes and a set of
Connected component (topology), connected components called edges, each homeomorphic to an open interval with boundary in
and such that
.
A
plane graph
In graph theory, a planar graph is a graph that can be embedded in the plane, i.e., it can be drawn on the plane in such a way that its edges intersect only at their endpoints. In other words, it can be drawn in such a way that no edges cros ...
between two real numbers
with
is a finite topological graph embedded in
such that every point
is also a node
and belongs to the closure of exactly one edge in
. Such points are called outer nodes, they define the domain and codomain
of the string diagram, i.e. the list of edges that are connected to the top and bottom boundary. The other nodes
are called inner nodes.
A plane graph is progressive, also called recumbent, when the vertical projection
is injective for every edge
. Intuitively, the edges in a progressive plane graph go from top to bottom without bending backward. In that case, each edge can be given a top-to-bottom orientation with designated nodes as source and target. One can then define the domain and codomain
of each inner node
, given by the list of edges that have source and target.
A plane graph is generic when the vertical projection
is injective, i.e. no two inner nodes are at the same height. In that case, one can define a list
of the inner nodes ordered from top to bottom.
A progressive plane graph is labeled by a monoidal signature
if it comes equipped with a pair of functions
from edges to generating objects and
from inner nodes to generating arrows, in a way compatible with domain and codomain.
A deformation of plane graphs is a
continuous map
In mathematics, a continuous function is a function such that a continuous variation (that is a change without jump) of the argument induces a continuous variation of the value of the function. This means that there are no abrupt changes in va ...
such that
* the image of
defines a plane graph for all
,
* for all
, if
is an inner node for some
it is inner for all
.
A deformation is progressive (generic, labeled) if
is progressive (generic, labeled) for all
. Deformations induce an equivalence relation with
if and only if there is some
with
and
. String diagrams are equivalence classes of labeled progressive plane graphs. Indeed, one can define:
* the identity diagram
as a set of parallel edges labeled by some type
,
* the composition of two diagrams as their vertical concatenation with the codomain of the first identified with the domain of the second,
* the tensor of two diagrams as their horizontal concatenation.
Combinatorial
While the geometric definition makes explicit the link between
category theory and
low-dimensional topology
In mathematics, low-dimensional topology is the branch of topology that studies manifolds, or more generally topological spaces, of four or fewer dimensions. Representative topics are the structure theory of 3-manifolds and 4-manifolds, knot the ...
, a combinatorial definition is necessary to formalise string diagrams in
computer algebra systems and use them to define
computational problems
In theoretical computer science, a computational problem is a problem that may be solved by an algorithm. For example, the problem of factoring
:"Given a positive integer ''n'', find a nontrivial prime factor of ''n''."
is a computational probl ...
. One such definition is to define string diagrams as equivalence classes of well-typed formulae generated by the signature, identity, composition and tensor. In practice, it is more convenient to encode string diagrams as formulae in generic form, which are in bijection with the labeled generic progressive plane graphs defined above.
Fix a monoidal signature
. A layer is defined as a triple
of a type
on the left, a box
in the middle and a type
on the right. Layers have a domain and codomain
defined in the obvious way. This forms a
directed multigraph, also known as a
quiver
A quiver is a container for holding arrows, bolts, ammo, projectiles, darts, or javelins. It can be carried on an archer's body, the bow, or the ground, depending on the type of shooting and the archer's personal preference. Quivers were tr ...
, with the types as vertices and the layers as edges. A string diagram
is encoded as a path in this multigraph, i.e. it is given by:
* a domain
as starting point
* a length
,
* a list of
such that
and
for all
. In fact, the explicit list of layers is redundant, it is enough to specify the length of the type to the left of each layer, known as the offset. The whiskering
of a diagram
by a type
is defined as the concatenation to the right of each layer
and symmetrically for the whiskering
on the left. One can then define:
* the identity diagram
with
and
,
* the composition of two diagrams as the concatenation of their list of layers,
* the tensor of two diagrams as the composition of whiskerings
.
Note that because the diagram is in generic form (i.e. each layer contains exactly one box) the definition of tensor is necessarily biased: the diagram on the left hand-side comes above the one on the right-hand side. One could have chosen the opposite definition
.
Two diagrams are equal (up to the axioms of monoidal categories) whenever they are in the same equivalence class of the
congruence relation
In abstract algebra, a congruence relation (or simply congruence) is an equivalence relation on an algebraic structure (such as a group, ring, or vector space) that is compatible with the structure in the sense that algebraic operations done ...
generated by the interchanger:
That is, if the boxes in two consecutive layers are not connected then their order can be swapped. Intuitively, if there is no communication between two parallel processes then the order in which they happen is irrelevant.
The
word problem for free monoidal categories, i.e. deciding whether two given diagrams are equal, can be solved in
polynomial time
In computer science, the time complexity is the computational complexity that describes the amount of computer time it takes to run an algorithm. Time complexity is commonly estimated by counting the number of elementary operations performed by ...
. The interchanger is a
confluent rewriting system
In mathematics, computer science, and logic, rewriting covers a wide range of methods of replacing subterms of a formula with other terms. Such methods may be achieved by rewriting systems (also known as rewrite systems, rewrite engines, or red ...
on the subset of boundary connected diagrams, i.e. whenever the plane graphs have no more than one connected component which is not connected to the domain or codomain and the
Eckmann–Hilton argument
In mathematics, the Eckmann–Hilton argument (or Eckmann–Hilton principle or Eckmann–Hilton theorem) is an argument about two unital magma structures on a set where one is a homomorphism for the other. Given this, the structures can be sho ...
does not apply.
Extension to 2-categories
The idea is to represent structures of dimension ''d'' by structures of dimension ''2-d'', using
Poincaré duality
In mathematics, the Poincaré duality theorem, named after Henri Poincaré, is a basic result on the structure of the homology and cohomology groups of manifolds. It states that if ''M'' is an ''n''-dimensional oriented closed manifold ( comp ...
. Thus,
* an object is represented by a portion of plane,
* a 1-cell
is represented by a vertical segment—called a ''string''—separating the plane in two (the right part corresponding to ''A'' and the left one to ''B''),
* a 2-cell
is represented by an intersection of strings (the strings corresponding to ''f'' above the link, the strings corresponding to ''g'' below the link).
The parallel composition of 2-cells corresponds to the horizontal juxtaposition of diagrams and the sequential composition to the vertical juxtaposition of diagrams.
A monoidal category is equivalent to a 2-category with a single 0-cell. Intuitively, going from monoidal categories to 2-categories amounts to adding colours to the background of string diagrams.
Examples
The snake equation
Consider an
adjunction
In mathematics, the term ''adjoint'' applies in several situations. Several of these share a similar formalism: if ''A'' is adjoint to ''B'', then there is typically some formula of the type
:(''Ax'', ''y'') = (''x'', ''By'').
Specifically, adjoin ...
between two categories
and
where
is left adjoint of
and the
natural transformation
In category theory, a branch of mathematics, a natural transformation provides a way of transforming one functor into another while respecting the internal structure (i.e., the composition of morphisms) of the categories involved. Hence, a na ...
s
and
are respectively the unit and the counit. The string diagrams corresponding to these natural transformations are:
The string corresponding to the identity functor is drawn as a dotted line and can be omitted.
The definition of an adjunction requires the following equalities:
:
The first one is depicted as
A monoidal category where every object has a left and right adjoint is called a
rigid category In category theory, a branch of mathematics, a rigid category is a monoidal category where every object is rigid, that is, has a dual ''X''* (the internal Hom 'X'', 1 and a morphism 1 → ''X'' ⊗ ''X''* satisfying natural conditions. ...
. String diagrams for rigid categories can be defined as non-progressive plane graphs, i.e. the edges can bend backward.
In the context of
categorical quantum mechanics
Categorical quantum mechanics is the study of quantum foundations and quantum information using paradigms from mathematics and computer science, notably monoidal category theory. The primitive objects of study are physical processes, and the diff ...
, this is known as the snake equation.
The category of
Hilbert space
In mathematics, Hilbert spaces (named after David Hilbert) allow generalizing the methods of linear algebra and calculus from (finite-dimensional) Euclidean vector spaces to spaces that may be infinite-dimensional. Hilbert spaces arise natu ...
s is rigid, this fact underlies the proof of correctness for the
quantum teleportation protocol. The unit and counit of the adjunction are an abstraction of the
Bell state
The Bell states or EPR pairs are specific quantum states of two qubits that represent the simplest (and maximal) examples of quantum entanglement; conceptually, they fall under the study of quantum information science. The Bell states are a fo ...
and the
Bell measurement
The Bell states or EPR pairs are specific quantum states of two qubits that represent the simplest (and maximal) examples of quantum entanglement; conceptually, they fall under the study of quantum information science. The Bell states are a form ...
respectively. If Alice and Bob share two
qubits
In quantum computing, a qubit () or quantum bit is a basic unit of quantum information—the quantum version of the classic binary bit physically realized with a two-state device. A qubit is a two-state (or two-level) quantum-mechanical system, ...
Y and Z in an
entangled state
Quantum entanglement is the phenomenon that occurs when a group of particles are generated, interact, or share spatial proximity in a way such that the quantum state of each particle of the group cannot be described independently of the state of ...
and Alice performs a (
post-selected) entangled measurement between Y and another qubit X, then this qubit X will be teleported from Alice to Bob: quantum teleportation is an identity morphism.The same equation appears in the definition of
pregroup grammars where it captures the notion of
information flow
In discourse-based grammatical theory, information flow is any tracking of referential information by speakers. Information may be ''new,'' just introduced into the conversation; ''given,'' already active in the speakers' consciousness; or ''old ...
in
natural language semantics
Semantics (from grc, σημαντικός ''sēmantikós'', "significant") is the study of reference, meaning, or truth. The term can be used to refer to subfields of several distinct disciplines, including philosophy, linguistics and comput ...
. This observation has led to the development of the
DisCoCat framework and
quantum natural language processing
Quantum natural language processing (QNLP) is the application of quantum computing to natural language processing (NLP). It computes word embeddings as parameterised quantum circuits that can solve NLP tasks faster than any classical computer. It ...
.
Hierarchy of graphical languages
Many extensions of string diagrams have been introduced to represent arrows in monoidal categories with extra structure, forming a hierarchy of graphical languages which is classified in Selinger's ''Survey of graphical languages for monoidal categories.
''
*
Braided monoidal categories In mathematics, a ''commutativity constraint'' \gamma on a monoidal category ''\mathcal'' is a choice of isomorphism \gamma_ : A\otimes B \rightarrow B\otimes A for each pair of objects ''A'' and ''B'' which form a "natural family." In particu ...
with 3-dimensional diagrams, a generalisation of
braid group
A braid (also referred to as a plait) is a complex structure or pattern formed by interlacing two or more strands of flexible material such as textile yarns, wire, or hair.
The simplest and most common version is a flat, solid, three-strande ...
s.
*
Symmetric monoidal categories with 4-dimensional diagrams where edges can cross, a generalisation of the
symmetric group
In abstract algebra, the symmetric group defined over any set is the group whose elements are all the bijections from the set to itself, and whose group operation is the composition of functions. In particular, the finite symmetric group ...
.
*
Ribbon categories with 3-dimensional diagrams where the edges are undirected, a generalisation of
knot diagrams.
*
Compact closed categories with 4-dimensional diagrams where the edges are undirected, a generalisation of
Penrose graphical notation
In mathematics and physics, Penrose graphical notation or tensor diagram notation is a (usually handwritten) visual depiction of multilinear functions or tensors proposed by Roger Penrose in 1971. A diagram in the notation consists of several sha ...
.
*
Dagger categories where every diagram has a horizontal reflection.
List of applications
String diagrams have been used to formalise the following objects of study.
*
Concurrency theory
*
Artificial neural networks
*
Game theory
*
Bayesian probability
Bayesian probability is an interpretation of the concept of probability, in which, instead of frequency or propensity of some phenomenon, probability is interpreted as reasonable expectation representing a state of knowledge or as quantification o ...
*
Consciousness
Consciousness, at its simplest, is sentience and awareness of internal and external existence. However, the lack of definitions has led to millennia of analyses, explanations and debates by philosophers, theologians, linguisticians, and scien ...
*
Markov kernel In probability theory, a Markov kernel (also known as a stochastic kernel or probability kernel) is a map that in the general theory of Markov processes plays the role that the transition matrix does in the theory of Markov processes with a finite ...
s
*
Signal-flow graph
A signal-flow graph or signal-flowgraph (SFG), invented by Claude Shannon, but often called a Mason graph after Samuel Jefferson Mason who coined the term, is a specialized Flow graph (mathematics), flow graph, a directed graph in which nodes repr ...
s
*
Conjunctive queries
*
Bidirectional transformation
In computer programming, bidirectional transformations (bx) are programs in which a single piece of code can be run in several ways, such that the same data are sometimes considered as input, and sometimes as output. For example, a bx run in the f ...
s
*
Categorical quantum mechanics
Categorical quantum mechanics is the study of quantum foundations and quantum information using paradigms from mathematics and computer science, notably monoidal category theory. The primitive objects of study are physical processes, and the diff ...
*
Quantum circuit
In quantum information theory, a quantum circuit is a model for quantum computation, similar to classical circuits, in which a computation is a sequence of quantum gates, measurements, initializations of qubits to known values, and possibly ...
s,
measurement-based quantum computing
The one-way or measurement-based quantum computer (MBQC) is a method of quantum computing that first prepares an entangled ''resource state'', usually a cluster state or graph state, then performs single qubit measurements on it. It is "one-w ...
and
quantum error correction
Quantum error correction (QEC) is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is theorised as essential to achieve fault tolerant quantum computing tha ...
, see
ZX-calculus
The ZX-calculus is a rigorous graphical language for reasoning about linear maps between qubits, which are represented as string diagrams called ''ZX-diagrams''. A ZX-diagram consists of a set of generators called ''spiders'' that represent speci ...
*
Natural language processing
Natural language processing (NLP) is an interdisciplinary subfield of linguistics, computer science, and artificial intelligence concerned with the interactions between computers and human language, in particular how to program computers to proc ...
, see
DisCoCat
*
Quantum natural language processing
Quantum natural language processing (QNLP) is the application of quantum computing to natural language processing (NLP). It computes word embeddings as parameterised quantum circuits that can solve NLP tasks faster than any classical computer. It ...
See also
*
Proof net In proof theory, proof nets are a geometrical method of representing proofs that
eliminates two forms of ''bureaucracy'' that differentiate proofs: (A) irrelevant syntactical features of regular proof calculi, and (B) the order of rules applied in ...
s, a generalisation of string diagrams used to denote proofs in
linear logic
Linear logic is a substructural logic proposed by Jean-Yves Girard as a refinement of classical and intuitionistic logic, joining the dualities of the former with many of the constructive properties of the latter. Although the logic has also ...
*
Existential graphs, a precursor of string diagrams used to denote formulae in
first-order logic
First-order logic—also known as predicate logic, quantificational logic, and first-order predicate calculus—is a collection of formal systems used in mathematics, philosophy, linguistics, and computer science. First-order logic uses quanti ...
*
Penrose graphical notation
In mathematics and physics, Penrose graphical notation or tensor diagram notation is a (usually handwritten) visual depiction of multilinear functions or tensors proposed by Roger Penrose in 1971. A diagram in the notation consists of several sha ...
and
Feynman diagram
In theoretical physics, a Feynman diagram is a pictorial representation of the mathematical expressions describing the behavior and interaction of subatomic particles. The scheme is named after American physicist Richard Feynman, who introdu ...
s, two precursors of string diagrams in physics
*
Tensor network
Tensor networks or tensor network states are a class of variational wave functions used in the study of many-body quantum systems. Tensor networks extend one-dimensional matrix product states to higher dimensions while preserving some of their use ...
s, the interpretation of string diagrams in
vector space
In mathematics and physics, a vector space (also called a linear space) is a set whose elements, often called '' vectors'', may be added together and multiplied ("scaled") by numbers called '' scalars''. Scalars are often real numbers, but ...
s,
linear map
In mathematics, and more specifically in linear algebra, a linear map (also called a linear mapping, linear transformation, vector space homomorphism, or in some contexts linear function) is a mapping V \to W between two vector spaces that pr ...
s and
tensor product
In mathematics, the tensor product V \otimes W of two vector spaces and (over the same Field (mathematics), field) is a vector space to which is associated a bilinear map V\times W \to V\otimes W that maps a pair (v,w),\ v\in V, w\in W to an e ...
References
External links
*
*
DisCoPy a Python toolkit for computing with string diagrams
External links
*
{{DEFAULTSORT:String Diagram
Higher category theory
Monoidal categories