SAT-Based Quantum Circuit Adaptation

被引:0
|
作者
Brandhofer, Sebastian [1 ,2 ]
Kim, Jinwoong [3 ]
Niu, Siyuan [4 ]
Bronn, Nicholas T. [5 ]
机构
[1] Univ Stuttgart, Inst Comp Architecture & Comp Engn, Stuttgart, Germany
[2] Univ Stuttgart, Ctr Integrated Quantum Sci & Technol, Stuttgart, Germany
[3] Delft Univ Technol, Appl Phys, Delft, Netherlands
[4] Univ Montpellier, LIRMM, Montpellier, France
[5] IBM Quantum, IBM TJ Watson Res Ctr, Yorktown Hts, NY USA
关键词
LOGIC; ALGORITHM;
D O I
10.23919/DATE56975.2023.10137140
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
As the nascent field of quantum computing develops, an increasing number of quantum hardware modalities, such as superconducting electronic circuits, semiconducting spins, trapped ions, and neutral atoms, have become available for performing quantum computations. These quantum hardware modalities exhibit varying characteristics and implement different universal quantum gate sets that may e.g. contain several distinct two-qubit quantum gates. Adapting a quantum circuit from a, possibly hardware-agnostic, universal quantum gate set to the quantum gate set of a target hardware modality has a crucial impact on the fidelity and duration of the intended quantum computation. However, current quantum circuit adaptation techniques only apply a specific decomposition or allow only for local improvements to the target quantum circuit potentially resulting in a quantum computation with less fidelity or more qubit idle time than necessary. These issues are further aggravated by the multiple options of hardware-native quantum gates rendering multiple universal quantum gates sets accessible to a hardware modality. In this work, we developed a satisfiability modulo theories model that determines an optimized quantum circuit adaptation given a set of allowed substitutions and decompositions, a target hardware modality and the quantum circuit to be adapted. We further discuss the physics of the semiconducting spins hardware modality, show possible implementations of distinct two-qubit quantum gates, and evaluate the developed model on the semiconducting spins hardware modality. Using the developed quantum circuit adaptation method on a noisy simulator, we show the Hellinger fidelity could be improved by up to 40% and the qubit idle time could be decreased by up to 87% compared to alternative quantum circuit adaptation techniques.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] SAT-based {CNOT, T} Quantum Circuit Synthesis
    Meuli, Giulia
    Soeken, Mathias
    De Micheli, Giovanni
    [J]. REVERSIBLE COMPUTATION, RC 2018, 2018, 11106 : 175 - 188
  • [2] SAT-Based Methods for Circuit Synthesis
    Bloem, Roderick
    Egly, Uwe
    Klampfl, Patrick
    Koenighofer, Robert
    Lonsing, Florian
    [J]. 2014 FORMAL METHODS IN COMPUTER-AIDED DESIGN (FMCAD), 2014, : 31 - 34
  • [3] Efficient SAT-based Circuit Initialization for Larger Designs
    Sauer, Matthias
    Reimer, Sven
    Reddy, Sudhakar M.
    Becker, Bernd
    [J]. 2014 27TH INTERNATIONAL CONFERENCE ON VLSI DESIGN AND 2014 13TH INTERNATIONAL CONFERENCE ON EMBEDDED SYSTEMS (VLSID 2014), 2014, : 62 - 67
  • [4] On the impact of structural circuit partitioning on SAT-based combinational circuit verification
    Herbstritt, M
    Kmieciak, T
    Becker, B
    [J]. 5TH INTERNATIONAL WORKSHOP ON MICROPROCESSOR TEST AND VERIFICATION: COMMON CHALLENGES AND SOLUTIONS, PROCEEDINGS, 2005, : 50 - 55
  • [5] A SAT-Based arithmetic circuit bug-hunting method
    Chen, Yunji
    Huang, Zhuo
    [J]. TENCON 2006 - 2006 IEEE REGION 10 CONFERENCE, VOLS 1-4, 2006, : 299 - +
  • [6] SAT-based arithmetic circuit bug-hunting method
    Chen, Yun-Ji
    Zhang, Jian
    Shen, Hai-Hua
    Hu, Wei-Wu
    [J]. Jisuanji Xuebao/Chinese Journal of Computers, 2007, 30 (12): : 2082 - 2089
  • [7] Reducing Interpolant Circuit Size Through SAT-Based Weakening
    Cabodi, G.
    Camurati, P. E.
    Palena, M.
    Pasini, P.
    Vendraminetto, D.
    [J]. IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (07) : 1524 - 1531
  • [8] Improving SAT-Based Combinational Equivalence Checking Through Circuit Preprocessing
    Andrade, Fabricio Vivas
    Silva, Leandro M.
    Fernandes, Antonio O.
    [J]. 2008 IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, 2008, : 40 - +
  • [9] SAT-Based Data Mining
    Boudane, Abdelhamid
    Jabbour, Said
    Sais, Lakhdar
    Salhi, Yakoub
    [J]. INTERNATIONAL JOURNAL ON ARTIFICIAL INTELLIGENCE TOOLS, 2018, 27 (01)
  • [10] SAT-Based Subsumption Resolution
    Coutelier, Robin
    Kovacs, Laura
    Rawson, Michael
    Rath, Jakob
    [J]. AUTOMATED DEDUCTION, CADE 29, 2023, 14132 : 190 - 206