arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.07591quant-phcs.ET
收藏

基于EASE门的离子阱量子计算机高效量子编程

Efficient quantum programming using EASE gates on a trapped-ion quantum computer

Nikodem Grzesiak, Andrii Maksymov, Pradeep Niroula, Yunseong Nam

摘要:

传统计算中的并行运算已被证明是高效和实用计算的重要工具,对于量子计算来说也不例外。实际上,存在大量的研究量子门的并行实现对于高效的量子线路实现的优点的工作。在这里,我们专注于最近发明的有效的,任意的,同时纠缠(EASE)门,可在捕获离子量子计算机。利用其灵活性,在选择任意对的量子位耦合到任何程度的纠缠,所有的并行,我们显示了一个$n$ -量子位克利福德电路可以使用$6\log(n)$ EASE门实现,一个$n$ -量子位乘法控制的非门可以使用$3n/2$ EASE门实现,和一个$n$ -量子位置换可以使用六个EASE门实现。我们讨论了它们对近期量子化学模拟和最先进的模式匹配算法的影响。如果Clifford +乘控非门构成了量子计算的通用门集,那么我们的结果意味着一般情况下EASE门是有效的量子计算.

英文摘要:

Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of parallel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show an $n$-qubit Clifford circuit can be implemented using $6\log(n)$ EASE gates, an $n$-qubit multiply-controlled NOT gate can be implemented using $3n/2$ EASE gates, and an $n$-qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑