Details

Autor(en) / Beteiligte

• Soeken, Mathias
• Meuli, Giulia
• Schmitt, Bruno
• Mozafari, Fereshte
• Riener, Heinz
• De Micheli, Giovanni

Titel

Boolean satisfiability in quantum compilation

Ist Teil von

• Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences, 2020-02, Vol.378 (2164), p.1-16

Ort / Verlag

Royal Society

Erscheinungsjahr

2020

Link zum Volltext

Quelle

Alma/SFX Local Collection

Beschreibungen/Notizen

• Quantum compilation is the task of translating a quantum algorithm implemented in a high-level quantum programming language into a technologydependent 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’.