Boolean satisfiability in quantum compilation.
- Soeken M EPFL, Lausanne, Switzerland.
- Meuli G EPFL, Lausanne, Switzerland.
- Schmitt B EPFL, Lausanne, Switzerland.
- Mozafari F EPFL, Lausanne, Switzerland.
- Riener H EPFL, Lausanne, Switzerland.
- De Micheli G EPFL, Lausanne, Switzerland.
- 2019-12-24
Published in:
- Philosophical transactions. Series A, Mathematical, physical, and engineering sciences. - 2020
Boolean satisfiability
logic synthesis
quantum compilation
quantum computing
quantum programming languages
English
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'.
- Language
-
- English
- Open access status
- bronze
- Identifiers
-
- DOI 10.1098/rsta.2019.0161
- PMID 31865887
- Persistent URL
- https://sonar.ch/global/documents/294696
Statistics
Document views: 31
File downloads:
- Full-text: 0