论文标题
与CNOT电路合成进行量子汇编的动态Qubit路由
Dynamic Qubit Routing with CNOT Circuit Synthesis for Quantum Compilation
论文作者
论文摘要
许多量子计算机对本地允许哪些两分操作的操作有限制。要在这些约束下运行量子电路，需要将Qubits映射到不同的量子寄存器，并且需要相应地路由多Qubit大门。最近的事态发展表明，基于斯坦纳树的策略为路由CNOT提供了竞争性工具。但是，这些算法需要在路由前确定量子图。此外，量子图在整个计算过程中都固定，即，逻辑量子量不会移动到其他物理量子寄存器。相对于所得电路的CNOT计数效率低下。 在本文中，我们提出了用于在量子电路中路由CNOT的算法。在计算过程中，它动态重建逻辑Qubit，因此与Steiner-Gauss和Rowcol算法相比，导致输出CNOT少。 在这里，我们仅关注CNOT上的电路，但是通过将量子电路切入由CNOT和单粒门组成的子电路中，可以将此方法推广到Clifford+T电路的路由和映射策略。另外，可以使用逆腐蚀剂代替施泰纳 - 高斯（Steiner-Gauss）的综合以及从ZX图中提取量子电路。
Many quantum computers have constraints regarding which two-qubit operations are locally allowed. To run a quantum circuit under those constraints, qubits need to be mapped to different quantum registers, and multi-qubit gates need to be routed accordingly. Recent developments have shown that compiling strategies based on the Steiner tree provide a competitive tool to route CNOTs. However, these algorithms require the qubit map to be decided before routing. Moreover, the qubit map is fixed throughout the computation, i.e. the logical qubit will not be moved to a different physical qubit register. This is inefficient with respect to the CNOT count of the resulting circuit. In this paper, we propose the algorithm PermRowCol for routing CNOTs in a quantum circuit. It dynamically remaps logical qubits during the computation, and thus results in fewer output CNOTs than the algorithms Steiner-Gauss and RowCol. Here we focus on circuits over CNOT only, but this method could be generalized to a routing and mapping strategy on Clifford+T circuits by slicing the quantum circuit into subcircuits composed of CNOTs and single-qubit gates. Additionally, PermRowCol can be used in place of Steiner-Gauss in the synthesis of phase polynomials as well as the extraction of quantum circuits from ZX diagrams.
