Xor-And-Inverter Graphs for Quantum Compilation
Xor-And-Inverter Graphs for Quantum Compilation
复制标题
用于量子编译的异或与逆变器图
DOI：
--
复制
发表时间：
2022
影响因子：
7.6
通讯作者：
G. De Micheli
中科院分区：
文献类型：
--
作者：
Giulia Meuli;Mathias Soeken;G. De Micheli
量子编译是将量子算法的高级描述转换为一系列低级量子操作的任务。我们建议并鼓励使用异或与逆变器图（XAG）来指定用于量子编译的布尔函数。我们提出了三种不同的基于 XAG 的编译算法来合成 Clifford + T 库中的量子电路，从而针对容错量子计算。这些算法旨在最小化相关成本函数，例如量子位数量、T 计数和 T 深度，同时允许灵活地探索不同的解决方案。我们为相关的密码学和算术基准提供了新颖的资源估计结果。所取得的结果表明，与最先进的技术相比，T 计数和 T 深度均显着减少。
Quantum compilation is the task of translating a high-level description of a quantum algorithm into a sequence of low-level quantum operations. We propose and motivate the use of Xor-And-Inverter Graphs (XAG) to specify Boolean functions for quantum compilation. We present three different XAG-based compilation algorithms to synthesize quantum circuits in the Clifford + T library, hence targeting fault-tolerant quantum computing. The algorithms are designed to minimize relevant cost functions, such as the number of qubits, the T-count, and the T-depth, while allowing the flexibility of exploring different solutions. We present novel resource estimation results for relevant cryptographic and arithmetic benchmarks. The achieved results show a significant reduction in both T-count and T-depth when compared with the state-of-the-art.