Short paths in PU(2)

arXiv2012.04695MaRDI QIDQ6355607FDOQ6355607

Authors: Zachary Stier 

Publication date: 8 December 2020

Abstract: Parzanchevski and Sarnak recently adapted an algorithm of Ross and Selinger for factorization of PU(2)-diagonal elements to within distance $varepsilon$ into an efficient probabilistic algorithm for any PU(2)-element, using at most $3lo{g}_{p}frac1varepsilo{n}^3$ factors from certain well-chosen sets. The Clifford+$T$ gates are one such set arising from $p=2$. In that setting, we leverage recent work of Carvalho Pinto and Petit to improve this to $frac73lo{g}_{2}frac1varepsilo{n}^3$, and implement the algorithm in Haskell.

This page was built for publication: Short paths in PU(2)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6355607)