Quartz: Superoptimization of Quantum Circuits

被引:23
|
作者
Xu, Mingkuan [1 ]
Li, Zikun [2 ]
Padon, Oded [3 ]
Lin, Sina [4 ]
Pointing, Jessica [5 ]
Hirth, Auguste [2 ]
Ma, Henry [2 ]
Palsberg, Jens [2 ]
Aiken, Alex [6 ]
Acar, Umut A. [1 ]
Jia, Zhihao [1 ]
机构
[1] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
[2] Univ Calif Los Angeles, Los Angeles, CA USA
[3] VMware Res, Palo Alto, CA USA
[4] Microsoft, Mountain View, CA USA
[5] Univ Oxford, Oxford, England
[6] Stanford Univ, Stanford, CA 94305 USA
来源
PROCEEDINGS OF THE 43RD ACM SIGPLAN INTERNATIONAL CONFERENCE ON PROGRAMMING LANGUAGE DESIGN AND IMPLEMENTATION (PLDI '22) | 2022年
基金
美国国家科学基金会;
关键词
quantum computing; superoptimization;
D O I
10.1145/3519939.3523433
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Existing quantum compilers optimize quantum circuits by applying circuit transformations designed by experts. This approach requires significant manual effort to design and implement circuit transformations for different quantum devices, which use different gate sets, and can miss optimizations that are hard to find manually. We propose Quartz, a quantum circuit superoptimizer that automatically generates and verifies circuit transformations for arbitrary quantum gate sets. For a given gate set, Quartz generates candidate circuit transformations by systematically exploring small circuits and verifies the discovered transformations using an automated theorem prover. To optimize a quantum circuit, Quartz uses a cost-based backtracking search that applies the verified transformations to the circuit. Our evaluation on three popular gate sets shows that Quartz can effectively generate and verify transformations for different gate sets. The generated transformations cover manually designed transformations used by existing optimizers and also include new transformations. Quartz is therefore able to optimize a broad range of circuits for diverse gate sets, outperforming or matching the performance of hand-tuned circuit optimizers.
引用
收藏
页码:625 / 640
页数:16
相关论文
共 50 条
  • [21] Quantum Circuits for Dynamic Runtime Assertions in Quantum Computation
    Liu, Ji
    Byrd, Gregory T.
    Zhou, Huiyang
    TWENTY-FIFTH INTERNATIONAL CONFERENCE ON ARCHITECTURAL SUPPORT FOR PROGRAMMING LANGUAGES AND OPERATING SYSTEMS (ASPLOS XXV), 2020, : 1017 - 1030
  • [22] Locating quantum critical points with shallow quantum circuits
    Shi, Zhi-Quan
    Duan, Fang-Gang
    Zhang, Dan-Bo
    PHYSICS LETTERS A, 2023, 463
  • [23] Evolutionary Quantum Architecture Search for Parametrized Quantum Circuits
    Ding, Li
    Spector, Lee
    PROCEEDINGS OF THE 2022 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE COMPANION, GECCO 2022, 2022, : 2190 - 2195
  • [24] Split Compilation for Security of Quantum Circuits
    Saki, Abdullah Ash
    Suresh, Aakarshitha
    Topaloglu, Rasit Onur
    Ghosh, Swaroop
    2021 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN (ICCAD), 2021,
  • [25] Binary Pooling Circuits for Quantum Computing
    Yetis, Hasan
    Karakose, Mehmet
    2021 INTERNATIONAL CONFERENCE ON DECISION AID SCIENCES AND APPLICATION (DASA), 2021,
  • [26] A comprehensive study of quantum arithmetic circuits
    Wang, Siyi
    Li, Xiufan
    Lee, Wei Jie Bryan
    Deb, Suman
    Lim, Eugene
    Chattopadhyay, Anupam
    PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2025, 383 (2288):
  • [27] Equivalence Checking of Dynamic Quantum Circuits
    Hong, Xin
    Feng, Yuan
    Li, Sanjiang
    Ying, Mingsheng
    2022 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, ICCAD, 2022,
  • [28] Quantum Computing: Circuits, Algorithms, and Applications
    Shafique, Muhammad Ali
    Munir, Arslan
    Latif, Imran
    IEEE ACCESS, 2024, 12 : 22296 - 22314
  • [29] Pseudo-dimension of quantum circuits
    Matthias C. Caro
    Ishaun Datta
    Quantum Machine Intelligence, 2020, 2
  • [30] Advanced Equivalence Checking for Quantum Circuits
    Burgholzer, Lukas
    Wille, Robert
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2021, 40 (09) : 1810 - 1824