Related papers: Geometric representations of braid and Yang-Baxter…
Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because…
Set-theoretic solutions of the Yang--Baxter equation form a meeting-ground of mathematical physics, algebra and combinatorics. Such a solution consists of a set $X$ and a function r:X x X --> X x X which satisfies the braid relation. We…
There are various gate sets that can be used to describe a quantum computation. A particularly popular gate set in the literature on quantum computing consists of arbitrary single-qubit gates and 2-qubit CNOT gates. A CNOT gate is however…
Braid groups are an important and flexible tool used in several areas of science, such as Knot Theory (Alexander's theorem), Mathematical Physics (Yang-Baxter's equation) and Algebraic Geometry (monodromy invariants). In this note we will…
The circuit model of quantum computation can be interpreted as a scattering process. In particular, factorised scattering operators result in integrable quantum circuits that provide universal quantum computation and are potentially less…
Recent study suggests that there are natural connections between quantum information theory and the Yang--Baxter equation. In this paper, in terms of the generalized almost-complex structure and with the help of its algebra, we define the…
Every unitary solution of the Yang-Baxter equation (R-matrix) in dimension $d$ can be viewed as a unitary element of the Cuntz algebra ${\mathcal O}_d$ and as such defines an endomorphism of ${\mathcal O}_d$. These Yang-Baxter endomorphisms…
The principles of the theory of quantum groups are reviewed from the point of view of the possibility of their use for deformations of symmetries in physical models. The R-matrix approach to the theory of quantum groups is discussed in…
Topological quantum computation is an implementation of a quantum computer in a way that radically reduces decoherence. Topological qubits are encoded in the topological evolution of two-dimensional quasi-particles called anyons and…
We propose a dual-architecture quantum simulation framework for modeling morphisms and stability conditions in the bounded derived category $\mathbf{D}^b(\mathrm{Coh}(X))$, with applications to D-brane physics on K\"ahler and non-K\"ahler…
IBM has made several quantum computers available to researchers around the world via cloud services. Two architectures with five qubits, one with 16, and one with 20 qubits are available to run experiments. The IBM architectures implement…
Yang-Baxterising a braid group representation associated with multideformed version of $GL_{q}(N)$ quantum group and taking the corresponding $q\rightarrow 1$ limit, we obtain a rational $R$-matrix which depends on $\left ( 1+ {N(N-1) \over…
Entangled states, such as the Bell and GHZ states, are generated from separable states using matrices known to satisfy the Yang-Baxter equation and its generalization. This remarkable fact hints at the possibility of using braiding…
Yang-Baxter (YB) map systems (or set-theoretic analoga of entwining YB structures) are presented. They admit zero curvature representations with spectral parameter depended Lax triples L1, L2, L3 derived from symplectic leaves of 2 x 2…
Most quantum computing architectures to date natively support multi-valued logic, albeit being typically operated in a binary fashion. Multi-valued, or qudit, quantum processors have access to much richer forms of quantum entanglement,…
An explicit quantization is given of certain skew-symmetric solutions of the classical Yang-Baxter, yielding a family of $R$-matrices which generalize to higher dimensions the Jordanian $R$-matrices. Three different approaches to their…
This work classifies the set of diagonal gates that can implement a single or two-qubit transversal logical gate for qubit stabilizer codes. We show that individual physical gates on the underlying qubits that compose the code are…
We describe several methods of constructing R-matrices that are dependent upon many parameters, for example unitary R-matrices and R-matrices whose entries are functions. As an application, we construct examples of R-matrices with…
We construct two $Osp(n|2m)$ solutions of the graded Yang-Baxter equation by using the algebraic braid-monoid approach. The factorizable S-matrix interpretation of these solutions is also discussed.
In the first part we recall two famous sources of solutions to the Yang-Baxter equation -- R-matrices and Yetter-Drinfel$'$d (=YD) modules -- and an interpretation of the former as a particular case of the latter. We show that this result…