Related papers: Unitary tetrahedron quantum gates
For any algebra two families of coloured Yang-Baxter operators are constructed, thus producing solutions to the two-parameter quantum Yang-Baxter equation. An open problem about a system of functional equations is stated. The matrix forms…
We develop the quantum cluster algebra approach recently introduced by Sun and Yagi to investigate the tetrahedron equation, a three-dimensional generalization of the Yang-Baxter equation. In the case of square quiver, we devise a new…
We survey the matrix product solutions of the Yang-Baxter equation obtained recently from the tetrahedron equation. They form a family of quantum $R$ matrices of generalized quantum groups interpolating the symmetric tensor representations…
Maximally entangled bipartite unitary operators or gates find various applications from quantum information to being building blocks of minimal models of many-body quantum chaos, and have been referred to as "dual unitaries". Dual unitary…
Many well-known and well-studied four by four universal quantum logic gates in the literature are of a specific form, the so called eight-vertex form \eqref{8vertexform} \cite{kaufman etal 05-1,kaufman etal 05-2}, or {\it similar} to it. We…
Higher braiding gates, a new kind of quantum gate, are introduced. These are matrix solutions of the polyadic braid equations (which differ from the generalized Yang-Baxter equations). Such gates support a special kind of multi-qubit…
Quantum doubles of finite group algebras form a class of quasi-triangular Hopf algebras which algebraically solve the Yang--Baxter equation. Each representation of the quantum double then gives a matrix solution of the Yang--Baxter…
Computations with a future quantum computer will be implemented through the operations by elementary quantum gates. It is now well known that the collection of 1-bit and 2-bit quantum gates are universal for quantum computation, i.e., any…
In this paper we describe connections among extraspecial 2-groups, unitary representations of the braid group and multi-qubit braiding quantum gates. We first construct new representations of extraspecial 2-groups. Extending the latter by…
We give quantum circuits that simulate an arbitrary two-qubit unitary operator up to global phase. For several quantum gate libraries we prove that gate counts are optimal in worst and average cases. Our lower and upper bounds compare…
A problem of universality in simulation of evolution of quantum system and in theory of quantum computations is related with the possibility of expression or approximation of arbitrary unitary transformation by composition of specific…
How to find universal sets quantum gates (gates whose composition can form any othergate within a given range) is an important part of the development of quantum computation science that has been explored in the past with success. However,…
We consider a generic elementary gate sequence which is needed to implement a general quantum gate acting on n qubits -- a unitary transformation with 4^n degrees of freedom. For synthesizing the gate sequence, a method based on the…
We study the resources required to achieve universal quantum computing via the gate sets that provide the fundamental instructions from which quantum algorithms are built. While single-gate universal sets are known, they rely on precisely…
For a native gate set which includes all single-qubit gates, we apply results from symplectic geometry to analyze the spaces of two-qubit programs accessible within a fixed number of gates. These techniques yield an explicit description of…
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…
A method of constructing $n^{2}\times n^{2}$ matrix solutions(with $n^{3}$ matrix elements) of Temperley-Lieb algebra relation is presented in this paper. The single loop of these solutions are $d=\sqrt{n}$. Especially, a $9\times9-$matrix…
While all quantum algorithms can be expressed in terms of single-qubit and two-qubit gates, more expressive gate sets can help reduce the algorithmic depth. This is important in the presence of gate errors, especially those due to…
Unitary operations are the building blocks of quantum programs. Our task is to design effcient or optimal implementations of these unitary operations by employing the intrinsic physical resources of a given n-qubit system. The most common…
A coloured braid group representation (CBGR) is constructed with the help of some modified universal ${\cal R}$-matrix, associated to $U_q(gl(2))$ quantised algebra. Explicit realisation of Faddeev-Reshetikhin-Takhtajan (FRT) algebra is…