Boolean satisfiability in quantum compilation

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 compi...

Full description

Saved in:
Bibliographic Details
Published inPhilosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences Vol. 378; no. 2164; p. 20190161
Main Authors Soeken, Mathias, Meuli, Giulia, Schmitt, Bruno, Mozafari, Fereshte, Riener, Heinz, De Micheli, Giovanni
Format Journal Article
LanguageEnglish
Published England 07.02.2020
Subjects
logic synthesis
quantum programming languages
quantum compilation
Boolean satisfiability
quantum computing
Online AccessGet full text

Cover

More Information
Summary: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'.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1364-503X
1471-2962
DOI:10.1098/rsta.2019.0161