Classical simulation of Yang-Baxter gates
From MaRDI portal
Abstract: A unitary operator that satisfies the constant Yang-Baxter equation immediately yields a unitary representation of the braid group B n for every . 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., ) solutions, and some simple families that include solutions for arbitrary . 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.
Recommendations
Cited in
(7)- Cyclic groups and quantum logic gates
- Integrable quantum computation
- The Yang-Baxter equation, (quantum) computers and unifying theories
- Universal quantum gates
- Matchgates and classical simulation of quantum circuits
- UNIVERSAL QUANTUM GATE, YANG–BAXTERIZATION AND HAMILTONIAN
- Duality quantum simulation of the Yang-Baxter equation
This page was built for publication: Classical simulation of Yang-Baxter gates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2969058)