Rapid development has taken place in quantum algorithms, but few of them can be implemented directly on the quantum computer because of the coupling constraint and high error rates of quantum computer operations. Transforming a circuit into an executable one on the quantum computer with the highest fidelity is an NP problem. Therefore, the algorithm tackling the mapping and routing problem of qubits is needed. Following the policy of VQA, a heuristic algorithm to solve the problem is proposed. The algorithm uses the error score derived from quantum operation’s error rate as the heuristic cost. Combining SWAP gates, physical CNOT gates, remote CNOT gates and inverse CNOT gates, the algorithm transforms the input circuit into an executable output circuit on the quantum computer with lower error score in acceptable execution time and moves forward from local optimal to global optimal.

量子算法已经得到了快速发展，但是由于量子计算机操作的耦合约束和高错误率，很少有可以直接在量子计算机上实现的算法。NP将电路转换为量子计算机上保真度最高的可执行电路问题。因此，需要一种解决量子位的映射和路由问题的算法。遵循VQA策略，提出了一种启发式算法来解决该问题。该算法使用从量子运算的错误率得出的错误分数作为启发式代价。该算法将SWAP门，物理CNOT门，远程CNOT门和反向CNOT门相结合，在可接受的执行时间内将输入电路转换为具有较低错误分数的量子计算机上的可执行输出电路，并从局部最优变为全局最优。