论文标题
用非简化的ZX-rules消失的2 Qubit大门
Vanishing 2-Qubit Gates with Non-Simplification ZX-Rules
论文作者
论文摘要
传统的量子电路优化直接在电路级别进行。另外，可以将量子电路转换为ZX-DIAGR，可以使用ZX-Calculus的规则简化，然后可以提取简化的电路。但是，最著名的提取程序可以大大增加2 QUITIAL大门的数量。在这项工作中，我们利用了以下事实：ZX-Diagram中的局部变化可以极大地影响提取电路的复杂性。我们基于局部互补的图理论概念和枢轴生成简化的ZX-DIAGRAM的局部变体，使用一对一致（即非简化重写规则）。我们探讨了使用模拟退火和遗传算法生成的等效ZX-DIAGRA的空间，以获得具有较少2 Quibent门的简化电路。在随机生成的电路上，我们的方法可以胜过低QUIT（<10）电路的最先进优化技术。在一组先前报道的基准电路中，<= = 14吨，我们的方法在87％的情况下优于现成的方法，始终将总电路复杂性降低了约15-30％，并消除了多达46％的2小门。这些初步结果是ZX-Calculus新电路优化策略的概念概念。
Traditional quantum circuit optimization is performed directly at the circuit level. Alternatively, a quantum circuit can be translated to a ZX-diagram which can be simplified using the rules of the ZX-calculus, after which a simplified circuit can be extracted. However, the best-known extraction procedures can drastically increase the number of 2-qubit gates. In this work, we take advantage of the fact that local changes in a ZX-diagram can drastically affect the complexity of the extracted circuit. We use a pair of congruences (i.e., non-simplification rewrite rules) based on the graph-theoretic notions of local complementation and pivoting to generate local variants of a simplified ZX-diagram. We explore the space of equivalent ZX-diagrams generated by these congruences using simulated annealing and genetic algorithms to obtain a simplified circuit with fewer 2-qubit gates. On randomly generated circuits, our method can outperform state-of-the-art optimization techniques for low-qubit (<10) circuits. On a set of previously reported benchmark circuits with <=14 qubits, our method outperforms off-the-shelf methods in 87% of cases, consistently reducing overall circuit complexity by an additional ~15-30% and eliminating up to 46% of 2-qubit gates. These preliminary results serve as a proof-of-concept for a new circuit optimization strategy in the ZX-calculus.
