Related papers: Spin-networks in the ZX-calculus
We extend the graphical calculus developed in the first part of this paper to the parametrising spaces of quantum vertex operators. This involves a graphical implementation of the dynamical twist functor, which is a strict monoidal functor…
The ZX-calculus is a universal graphical language for qubit quantum computation, meaning that every linear map between qubits can be expressed in the ZX-calculus. Furthermore, it is a complete graphical rewrite system: any equation…
Based on our previous works, and in order to relate them with the theory of quantum graphs and the quantum computing principles, we once again try to introduce some newly developed technical structures just by relying on our toy example,…
Treating the infinite-dimensional Hilbert space of non-abelian gauge theories is an outstanding challenge for classical and quantum simulations. Here, we introduce $q$-deformed Kogut-Susskind lattice gauge theories, obtained by deforming…
We present a novel hierarchical construction of projective spin networks of the Ponzano-Regge type from an assembling of five quadrangles up to the combinatorial 4-simplex compatible with a geometrical realization in Euclidean 4-space. The…
The search for classical or quantum combinatorial invariants of compact n-dimensional manifolds (n=3,4) plays a key role both in topological field theories and in lattice quantum gravity. We present here a generalization of the partition…
Quantum states of geometry in loop quantum gravity are defined as spin networks, which are graph dressed with SU(2) representations. A spin network edge carries a half-integer spin, representing basic quanta of area, and the standard…
We propose a Lorentz-covariant Yang-Mills ``spin-gauge'' theory, where the function valued Pauli matrices play the role of a non-scalar Higgs-field. As symmetry group we choose $SU(2) \times U(1)$ of the 2-spinors describing…
We give a convenient representation for any map that is covariant with respect to an irreducible representation of SU(2), and use this representation to analyze the evolution of a quantum directional reference frame when it is exploited as…
Graphical languages are a convenient shorthand to represent computation, with rewrite rules relating one graph to another. In contrast, proof assistants rely heavily on inductive datatypes, particularly when giving semantics to embedded…
We present the characterizations of symbol correspondences for mechanical systems that are symmetric by $SU(3)$, which we refer to as \emph{quark systems}. The quantum quark systems are the unitary irreducible representations of $SU(3)$ of…
Exact diagonalization and other numerical studies of quantum spin systems are notoriously limited by the exponential growth of the Hilbert space dimension with system size. A common and well-known practice to reduce this increasing…
We present a quantum compilation algorithm that maps Clifford encoders, encoding maps for stabilizer quantum codes, to a unique graphical representation in the ZX calculus. Specifically, we develop a canonical form in the ZX calculus and…
We survey recent work on designing and evaluating quantum computing implementations based on nuclear or bound-electron spins in semiconductor heterostructures at low temperatures and in high magnetic fields. General overview is followed by…
We demonstrate that the matrix quantum group $SL_q(2)$ gives rise to nontrivial matrix product operator representations of the Lie group $SL(2)$, providing an explicit characterization of the nontrivial global $SU(2)$ symmetry of the XXZ…
The Lie algebra su(2) of the classical group SU(2) is built from two commuting quon algebras for which the deformation parameter is a common root of unity. This construction leads to (i) a not very well-known polar decomposition of the…
Colour $SU(3)$ group is an exact symmetry of Quantum Chromodynamics, which describes strong interactions between quarks and gluons. Supplemented by two internal symmetries, $SU(2)$ and $U(1)$, it serves as the internal symmetry of the…
In this note we illustrate by a few examples the general principle: interesting algebras and representations defined over Z_+ come from category theory, and are best understood when their categorical origination has been discovered. We show…
This article presents and discusses in detail the results of extensive exact calculations of the most basic ingredients of spin networks, the Racah coefficients (or Wigner 6j symbols), exhibiting their salient features when considered as a…
ZW-calculus is a useful graphical language for pure qubit quantum computing. It is via the translation of the completeness of ZW-calculus that the first proof of completeness of ZX-calculus was obtained. A d-level generalisation of qubit…