Tetris: A Compilation Framework for VQA Applications in Quantum Computing
arxiv(2023)
摘要
Quantum computing has shown promise in solving complex problems by leveraging
the principles of superposition and entanglement. Variational quantum
algorithms (VQA) are a class of algorithms suited for near term quantum
computers due to their modest requirements of qubits and depths of computation.
This paper introduces Tetris, a compilation framework for VQA applications on
near term quantum devices. Tetris focuses on reducing two qubit gates in the
compilation process since a two qubit gate has an order of magnitude more
significant error and execution time than a single qubit gate. Tetris exploits
unique opportunities in the circuit synthesis stage often overlooked by the
state of the art VQA compilers for reducing the number of two qubit gates.
Tetris comes with a refined IR of Pauli string to express such a two qubit gate
optimization opportunity. Moreover, Tetris is equipped with a fast bridging
approach that mitigates the hardware mapping cost. Overall, Tetris demonstrates
a reduction of up to 41.3 percent in CNOT gate counts, 37.9 percent in circuit
depth, and 42.6 percent in circuit duration for various molecules of different
sizes and structures compared with the state-of-the-art approaches. Tetris is
open-sourced at this link.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要