The search for leakage-free entangling Fibonacci braiding gates
The search for leakage-free entangling Fibonacci braiding gates
复制标题
DOI：
10.1088/1751-8121/ab488e
复制
发表时间：
2019-11-08
影响因子：
2.1
通讯作者：
Wong, Helen M.
中科院分区：
文献类型：
--
作者：
Cui, Shawn X.;Tian, Kevin T.;Wong, Helen M.
这是一个悬而未决的问题，如果有泄漏的纠缠Fibonacci编织门。在这篇文章中，我们给出了一个大家庭的无泄漏编织门的建设，然后证明是无纠缠。我们还进行了蛮力数值搜索的辫子与一个字的长度高达7，并没有发现泄漏的纠缠门。这表明了该猜想的否定。另一方面，我们提供了一个简单得多的协议来产生近似无泄漏纠缠Fibonacci编织门比现有的算法在文献中。
It is an open question if there are leakage-free entangling Fibonacci braiding gates. In this article, we give a construction of a large family of leakage-free braiding gates which are then proved to be non-entangling. We also conducted brute-force numerical searches for braids with a word-length up to seven and found no leakage-free entangling gates. These suggest the negative for the conjecture. On the other hand, we provide a much simpler protocol to generate approximately leakage-free entangling Fibonacci braiding gates than existing algorithms in the literature.