ZX-calculus
The ZX-calculus is a graphical language.
≈ 3 min read
Names in other languages
No names in other languages are held for this entry yet.
Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.
The ZX-calculus is a graphical language. It was conceived 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 specific tensors.
These are connected together to form a tensor network similar to Penrose graphical notation. Due to the symmetries of the spiders and the properties of the underlying category, topologically deforming a ZX-diagram (i.e. moving the generators without changing their connections) does not affect the linear map it represents.
In addition to the equalities between ZX-diagrams that are generated by topological deformations, the calculus also has a set of graphical rewrite rules for transforming diagrams into one another. The ZX-calculus is universal in the sense that any linear map between qubits can be represented as a diagram, and different sets of graphical rewrite rules are complete for different families of linear maps.
ZX-diagrams can be seen as a generalisation of quantum circuit notation, and they form a strict subset of tensor networks which represent general fusion categories and wavefunctions of quantum spin systems. The building blocks or generators of the ZX-calculus are graphical representations of specific states, unitary operators, linear isometries, and projections in the computational basis | 0 \rangle, | 1 \rangle and the Hadamard-transformed basis | + \rangle = \frac Indeed, all ZX-diagrams are built freely from a set of generators via composition and monoidal product, modulo the equalities induced by the compact structure and the rules of the ZX-calculus given below.
For instance, the identity of the object n is depicted as n parallel wires from left to right, with the special case n=0 being the empty diagram. The following table gives the generators together with their standard interpretations as linear maps, expressed in Dirac notation.
The computational basis states are denoted by \mid 0 \rangle, \vert 1 \rangle and the Hadamard-transformed basis states are \mid \pm \rangle = \frac{1}{\sqrt{2}} (\vert 0 \rangle \pm \vert 1 \rangle) . The n -fold tensor-product of the vector \mid \psi \rangle is denoted by \mid \psi \rangle^{\otimes n} .
There are many different versions of the ZX-calculus, using different systems of rewrite rules as axioms. All share the meta rule "only the topology matters", which means that two diagrams are equal if they consist of the same generators connected in the same way, no matter how these generators are arranged in the diagram.
The following are some of the core set of rewrite rules, here given "up to scalar factor": i.e. two diagrams are considered to be equal if their interpretations as linear maps differ by a non-zero complex factor.
Text derived from https://en.wikipedia.org/w/index.php?oldid=1360602123 under CC BY-SA 4.0; modifications have been made.