SAT-Based Quantum Circuit Adaptation
Sebastian Brandhofer, Jinwoong Kim, Siyuan Niu, Nicholas T. Bronn

TL;DR
This paper introduces a SAT-based method for optimizing quantum circuit adaptation across different hardware modalities, significantly improving fidelity and reducing idle time compared to existing techniques.
Contribution
It presents a novel satisfiability modulo theories model for quantum circuit adaptation, considering multiple hardware-native gate sets and optimization criteria.
Findings
Hellinger fidelity improved by up to 40%
Qubit idle time decreased by up to 87%
Effective adaptation for semiconducting spins hardware modality
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Advancements in Semiconductor Devices and Circuit Design · Low-power high-performance VLSI design
