Related papers: Classical simulation of Yang-Baxter gates
We consider Yang-Baxter equations arising from its associative analog and study corresponding exchange relations. They generate finite-dimensional quantum algebras which have form of coupled ${\rm GL}(N)$ Sklyanin elliptic algebras. Then we…
Uniformly controlled one-qubit gates are quantum gates which can be represented as direct sums of two-dimensional unitary operators acting on a single qubit. We present a quantum gate array which implements any n-qubit gate of this type…
Matchgates are a family of parity-preserving two-qubit gates, nearest-neighbour circuits of which are known to be classically simulable in polynomial time. In this work, we present a simulation method to classically simulate an…
In order to construct solutions of the braid equation we consider bijective left non-degenerate set-theoretic type solutions, which correspond to regular q-cycle coalgebras. We obtain a partial classification of the different q-cycle…
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…
The general rational solution of the Yang-Baxter equation with the symmetry algebra sl(2) can be represented as the product of the simpler building blocks denoted as R-operators. The R-operators are constructed explicitly and have simple…
We show that a set of gates that consists of all one-bit quantum gates (U(2)) and the two-bit exclusive-or gate (that maps Boolean values $(x,y)$ to $(x,x \oplus y)$) is universal in the sense that all unitary operations on arbitrarily many…
We present two classical algorithms for the simulation of universal quantum circuits on $n$ qubits constructed from $c$ instances of Clifford gates and $t$ arbitrary-angle $Z$-rotation gates such as $T$ gates. Our algorithms complement each…
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…
Quantum magic is a necessary resource for quantum computers to be not efficiently simulable by classical computers. Previous results have linked the amount of quantum magic, characterized by the number of $T$ gates or stabilizer rank, to…
Given an associative multiplication in matrix algebra compatible with the usual one or, in other words, linear deformation of matrix algebra, we construct a solution to the classical Yang-Baxter equation. We also develop a theory of such…
Every unitary involutive solution of the quantum Yang-Baxter equation ("R-matrix") defines an extremal character and a representation of the infinite symmetric group $S_\infty$. We give a complete classification of all such Yang-Baxter…
Complete solution, more precisely, all invertible $4\times 4$ matrices $R,Q$ that solve Yang--Baxter system related to quantised braided groups, quantum doubles and other systems are given.
We introduce an enhanced technique for strong classical simulation of quantum circuits which combines the `sum-of-stabilisers' method with an automated simplification strategy based on the ZX-calculus. Recently it was shown that quantum…
We establish a classical heuristic algorithm for exactly computing quantum probability amplitudes. Our algorithm is based on mapping output probability amplitudes of quantum circuits to evaluations of the Tutte polynomial of graphic…
We study various aspects of the topological quantum computation scheme based on the non-Abelian anyons corresponding to fractional quantum hall effect states at filling fraction 5/2 using the Temperley-Lieb recoupling theory. Unitary…
We present a probabilistic quantum processor for qudits. The processor itself is represented by a fixed array of gates. The input of the processor consists of two registers. In the program register the set of instructions (program) is…
We have shown that quantum systems on finite-dimensional Hilbert spaces are equivalent under local transformations. Using these transformations give rise to a gauge group that connects the hamiltonian operators associated with each quantum…
We propose to represent both $n$--qubits and quantum gates acting on them as elements in the complex Clifford algebra defined on a complex vector space of dimension $2n.$ In this framework, the Dirac formalism can be realized in…
We demonstrate that the two inequivalent spinor representations of the braid group \B_{2n+2}, describing the exchanges of 2n+2 non-Abelian Ising anyons in the Pfaffian topological quantum computer, are equivalent from computational point of…