The reviewed record of science sign in
Pith

arxiv: 2003.00244 · v3 · pith:5HAETHQF · submitted 2020-02-29 · quant-ph · hep-th· math-ph· math.MP· nlin.SI

Braiding quantum gates from partition algebras

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:5HAETHQFrecord.jsonopen to challenge →

classification quant-ph hep-thmath-phmath.MPnlin.SI
keywords braidingoperatorsalgebrasgatespartitionquantumunitaryachieved
0
0 comments X
read the original abstract

Unitary braiding operators can be used as robust entangling quantum gates. We introduce a solution-generating technique to solve the $(d,m,l)$-generalized Yang-Baxter equation, for $m/2\leq l \leq m$, which allows to systematically construct such braiding operators. This is achieved by using partition algebras, a generalization of the Temperley-Lieb algebra encountered in statistical mechanics. We obtain families of unitary and non-unitary braiding operators that generate the full braid group. Explicit examples are given for a 2-, 3-, and 4-qubit system, including the classification of the entangled states generated by these operators based on Stochastic Local Operations and Classical Communication.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.