SAT-Based Quantum Circuit Adaptation

被引:1
|
作者
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 条
  • [21] Reevaluating Graph-Neural-Network-Based Runtime Prediction of SAT-Based Circuit Deobfuscation
    Zhao, Guangwei
    Shamsi, Kaveh
    CRYPTOGRAPHY, 2022, 6 (04)
  • [22] SAT-based equivalence checking based on circuit partitioning and special approaches for conflict clause reuse
    Andrade, Fabricio V.
    Oliveira, Marcia C. M.
    Fernandes, Antonio O.
    Coelho, Claudionor Jose N., Jr.
    PROCEEDINGS OF THE 2007 IEEE WORKSHOP ON DESIGN AND DIAGNOSTICS OF ELECTRONIC CIRCUITS AND SYSTEMS, 2007, : 397 - +
  • [23] A SAT-based decision procedure for ALC
    Giunchiglia, F
    Sebastiani, R
    PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING: PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE (KR '96), 1996, : 304 - 314
  • [24] SAT-based cooperative planning: A proposal
    Benedetti, M
    Aiello, LC
    MECHANIZING MATHEMATICAL REASONING: ESSAYS IN HONOUR OF JORG H SIEKMANN ON THE OCCASION OF HIS 60TH BIRTHDAY, 2005, 2605 : 494 - 513
  • [25] SAT-Based verification of LTL formulas
    Zhang, Wenhui
    FORMAL METHODS: APPLICATIONS AND TECHNOLOGY, 2007, 4346 : 277 - 292
  • [26] SAT-Based Minimization of Deterministic ω-Automata
    Baarir, Souheib
    Duret-Lutz, Alexandre
    LOGIC FOR PROGRAMMING, ARTIFICIAL INTELLIGENCE, AND REASONING, (LPAR-20 2015), 2015, 9450 : 79 - 87
  • [27] A SAT-based algorithm for context matching
    Bouquet, P
    Magnini, B
    Serafini, L
    Zanobini, S
    MODELING AND USING CONTEXT, PROCEEDINGS, 2003, 2680 : 66 - 79
  • [28] The SAT-based Approach to Separation Logic
    Alessandro Armando
    Claudio Castellini
    Enrico Giunchiglia
    Marco Maratea
    Journal of Automated Reasoning, 2005, 35 : 237 - 263
  • [29] The SAT-based approach to separation logic
    Armando, Alessandro
    Castellini, Claudio
    Giunchiglia, Enrico
    Maratea, Marco
    JOURNAL OF AUTOMATED REASONING, 2005, 35 (1-3) : 237 - 263
  • [30] SAT-Based ATL Satisfiability Checking
    Kacprzak, Magdalena
    Niewiadomski, Artur
    Penczek, Wojciech
    KR2020: PROCEEDINGS OF THE 17TH INTERNATIONAL CONFERENCE ON PRINCIPLES OF KNOWLEDGE REPRESENTATION AND REASONING, 2020, : 539 - 549