%0 Journal Article
%J 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)
%D 2014
%T Classical simulation of Yang-Baxter gates
%A Gorjan Alagic
%A Aniruddha Bapat
%A Stephen P. Jordan
%X A unitary operator that satisfies the constant Yang-Baxter equation immediately yields a unitary representation of the braid group B n for every $n \ge 2$. If we view such an operator as a quantum-computational gate, then topological braiding corresponds to a quantum circuit. A basic question is when such a representation affords universal quantum computation. In this work, we show how to classically simulate these circuits when the gate in question belongs to certain families of solutions to the Yang-Baxter equation. These include all of the qubit (i.e., $d = 2$) solutions, and some simple families that include solutions for arbitrary $d \ge 2$. Our main tool is a probabilistic classical algorithm for efficient simulation of a more general class of quantum circuits. This algorithm may be of use outside the present setting.
%B 9th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2014)
%V 27
%P 161-175
%8 2014/07/05
%G eng
%U http://arxiv.org/abs/1407.1361v1
%! 9th Conference on the Theory of Quantum Computation
%R 10.4230/LIPIcs.TQC.2014.161