期刊
QUANTUM INFORMATION & COMPUTATION
卷 21, 期 9-10, 页码 771-780出版社
RINTON PRESS, INC
关键词
quantum computation; golden gates
类别
资金
- National Science Foundation Graduate Research Fellowship [DGE-1752814]
The algorithm developed by Parzanchevski-Sarnak adapts Ross-Selinger's method to efficiently factorize PU(2)-diagonal elements within a distance epsilon, extending it to any PU(2)-element. By leveraging Carvalho Pinto-Petit's recent work, the algorithm has been further improved and implemented in Haskell, with the use of certain well-chosen sets of factors.
Parzanchevski-Sarnak [1] recently adapted an algorithm of Ross-Selinger [2] for factorization of PU(2)-diagonal elements to within distance epsilon into an efficient probabilistic algorithm for any PU(2)-element, using at most 3 log(p)(1/epsilon(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-Petit [3] to improve this to 7/3log(2) (1/epsilon(3)), and implement the algorithm in Haskell.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据