Related papers: Unitary tetrahedron quantum gates
Any single-qubit unitary operation or quantum gate can be considered a rotation. Typical experimental implementations of single-qubit gates involve two or three fixed rotation axes, and up to three rotation steps. Here we show that, if the…
We present particularly simple new solutions to the Yang--Baxter equation arising from two--dimensional cyclic representations of quantum $SU(2)$. They are readily interpreted as scattering matrices of relativistic objects, and the quantum…
Given an arbitrary $2^w \times 2^w$ unitary matrix $U$, a powerful matrix decomposition can be applied, leading to four different syntheses of a $w$-qubit quantum circuit performing the unitary transformation. The demonstration is based on…
The aim of this review is to present the list of by now a significant collection of quantum integrable models, ultralocal as well as nonultralocal, in a systematic way stressing on their underlying unifying algebraic structures. We restrict…
Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum…
The prevalent approach to executing quantum algorithms on quantum computers is to break-down the algorithms to a concatenation of universal gates, typically single and two-qubit gates. However such a decomposition results in long gate…
In this paper, we introduce the notion of a normal form of one qubit quantum circuits over the basis $\{H, P, T\}$, where $H$, $P$ and $T$ denote the Hadamard, Phase and $\pi/8$ gates, respectively. This basis is known as the {\it standard…
In this work, we study distributions of unitaries generated by random quantum circuits containing only symmetry-respecting gates. We develop a unified approach applicable to all symmetry groups and obtain an equation that determines the…
We present an algorithm for efficiently approximating of qubit unitaries over gate sets derived from totally definite quaternion algebras. It achieves $\varepsilon$-approximations using circuits of length $O(\log(1/\varepsilon))$, which is…
We study a sequence of quantum gates in finite-dimensional Hilbert spaces given by the normalized eigenvectors of the unitary operators. The corresponding sequence of the Hamilton operators is also given. From the Hamilton operators we…
We define three families of quivers in which the braid relations of the symmetric group $S_n$ are realized by mutations and automorphisms. A sequence of eight braid moves on a reduced word for the longest element of $S_4$ yields three…
We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly…
Bethe Ansatz was discoverd in 1932. Half a century later its algebraic structure was unearthed: Yang-Baxter equation was discovered, as well as its multidimensional generalizations [tetrahedron equation and $d$-simplex equations]. Here we…
We present a succinct way of obtaining all possible higher dimensional generalization of Quantum Yang-Baxter Equation (QYBE). Using the scheme, we could generate the two popular three-simplex equations, namely: Zamolodchikov's tetrahedron…
We consider quantum circuits composed of Clifford and T gates. In this context the T gate has a special status since it confers universal computation when added to the (classically simulable) Clifford gates. However it can be very expensive…
We present a way to realize a multiplex-controlled phase gate of n-1 control qubits simultaneously controlling one target qubit, with n qubits distributed in n different cavities. This multiqubit gate is implemented by using n qutrits…
The Clifford hierarchy is a nested sequence of sets of quantum gates critical to achieving fault-tolerant quantum computation. Diagonal gates of the Clifford hierarchy and 'nearly diagonal' semi-Clifford gates are particularly important:…
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…
In this paper we derive from arguments of string scattering a set of eight tetrahedron equations, with different index orderings. It is argued that this system of equations is the proper system that represents integrable structures in three…
In this paper we discuss a model of quantum computer in which a state is an operator of density matrix and gates are general quantum operations, not necessarily unitary. A mixed state (operator of density matrix) of n two-level quantum…