预优化的量子线路综合算法

Pre-optimized Quantum Circuit Synthesis Algorithm

为解决量子线路在映射过程中线路量子代价的优化问题,提出了一种预优化的量子线路综合算法。该算法在前瞻近邻化方法的基础上,预先使用简化规则对线路进行化简,减少前瞻时需处理的量子门数,之后使用N门前瞻算法对线路进行近邻化操作。该方法可以有效减少近邻过程中需插入的SWAP门数,降低线路的量子代价。选取Benchmark的较有代表性的例题进行实验,文中选择影响力较大的文献进行对比,结果表明,在16例Benchmark例题中,正优化为11例,最大优化率为50%,平均优化率为10.1%。

To solve the optimization problem of quantum circuit cost in the mapping process of a quantum circuit,a pre-optimized quantum circuit synthesis algorithm is proposed.Based on the look-ahead nearest neighbor method,the algorithm uses simplification rules to simplify the circuit in advance to reduce the number of quantum gates to be processed during the forward-looking and then uses the N-gate look-ahead algorithm to perform the nearest neighbor operation on the circuit.This method can effectively reduce the number of SWAP gates to be inserted in the neighbor process and reduce the quantum cost of the circuit.The representative examples of Benchmarks were selected for experiments,and the literature with greater influence was selected for comparison.The results showed that among the 16 Benchmark examples,11 were positively optimized,the maximum optimization rate was 50%,and the average optimization rate was 10.1%.