Related Experiment Video
Updated: Jan 1, 2026

Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform
Published on: August 2, 2019
Boolean satisfiability in quantum compilation
Mathias Soeken1, Giulia Meuli1, Bruno Schmitt1
1EPFL, Lausanne, Switzerland.
Abstract:
Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technology-dependent instructions flow for a physical quantum computer. To tackle the large gap between the quantum program and the low-level instructions, quantum compilation is split into a multi-stage flow consisting of several layers of abstraction. Several different individual tasks have been proposed for the layers in the flow, many of them are NP-hard. In this article, we will describe the flow and we will propose algorithms based on Boolean satisfiability, which is a good match to tackle such computationally complex problems. This article is part of the theme issue 'Harmonizing energy-autonomous computing and intelligence'.
Related Concept Videos
Formal Charges
Constraints and Statical Determinacy
Stability of Equilibrium Configuration: Problem Solving
Problem-solving in the context of the stability of equilibrium configuration...
Synthetic Disvision of Polynomials
Castigliano's Theorem: Problem Solving
Alternative Sets of Equilibrium Equations
One example of such a situation can be observed in a...

