论文标题
现有量子计算布局合成工具的最佳研究
Optimality Study of Existing Quantum Computing Layout Synthesis Tools
论文作者
论文摘要
布局合成是量子计算中的重要一步，它处理量子电路以满足设备布局约束。在本文中，我们为此问题构建了Queko基准测试，这些基准已知最佳的深度和栅极计数。我们使用Queko评估当前布局合成工具的最佳性，包括Google的CIRQ，来自IBM的Qiskit，$ \ Mathsf {t} | \ Mathsf {KET} \ rangle $来自Cambridge量子量计算的$，以及最近的学术工作。令我们惊讶的是，尽管学术界和行业在量子电路的汇编和合成方面进行了十多年的研究和发展，但我们仍然能够证明较大的最优差距：平均设备上的1.5-12X，平均在较大设备上平均5-45倍。这暗示了通过更好的布局合成工具提高量子计算机效率的很大空间。最后，我们还证明了用于量子计算的布局合成问题的NP完整性。我们已经进行了Queko基准开源。
Layout synthesis, an important step in quantum computing, processes quantum circuits to satisfy device layout constraints. In this paper, we construct QUEKO benchmarks for this problem, which have known optimal depths and gate counts. We use QUEKO to evaluate the optimality of current layout synthesis tools, including Cirq from Google, Qiskit from IBM, $\mathsf{t}|\mathsf{ket}\rangle$ from Cambridge Quantum Computing, and recent academic work. To our surprise, despite over a decade of research and development by academia and industry on compilation and synthesis for quantum circuits, we are still able to demonstrate large optimality gaps: 1.5-12x on average on a smaller device and 5-45x on average on a larger device. This suggests substantial room for improvement of the efficiency of quantum computer by better layout synthesis tools. Finally, we also prove the NP-completeness of the layout synthesis problem for quantum computing. We have made the QUEKO benchmarks open-source.
