基于块的量子逻辑综合
Block-based quantum-logic synthesis
摘要：
本文讨论了构造一个有效的量子线路来实现任意量子计算的问题。为此，提出了一种基于余弦-正弦分解方法的基本块，其中包含$l$量子比特。此外，以前提出的量子逻辑综合方法的基础上量子香农分解递归地应用到达到$l$量子比特的酉门。然后，使用基本块，并应用一些优化来去除冗余门。结果表明，$l$的精确值影响所提出的方法中的一个量子位和CNOT门的数量。与以前的综合方法相比，$l$的值被检查，从而改善CNOT门的数量或门的总数。通过考虑最近邻限制，进一步分析了所提出的方法。根据我们的评估，CNOT门的数量增加了最多一个因素的$\frac{5}{3}$，如果最近邻相互作用。
英文摘要：
In this paper, the problem of constructing an efficient quantum circuit for the implementation of an arbitrary quantum computation is addressed. To this end, a basic block based on the cosine-sine decomposition method is suggested which contains $l$ qubits. In addition, a previously proposed quantum-logic synthesis method based on quantum Shannon decomposition is recursively applied to reach unitary gates over $l$ qubits. Then, the basic block is used and some optimizations are applied to remove redundant gates. It is shown that the exact value of $l$ affects the number of one-qubit and CNOT gates in the proposed method. In comparison to the previous synthesis methods, the value of $l$ is examined consequently to improve either the number of CNOT gates or the total number of gates. The proposed approach is further analyzed by considering the nearest neighbor limitation. According to our evaluation, the number of CNOT gates is increased by at most a factor of $\frac{5}{3}$ if the nearest neighbor interaction is applied.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
