Boolean satisfiability in quantum compilation
| Autor: | Fereshte Mozafari, Mathias Soeken, Giulia Meuli, Heinz Riener, Bruno Schmitt, Giovanni De Micheli |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Quantum programming
Theoretical computer science Computer science General Mathematics General Physics and Astronomy 02 engineering and technology 01 natural sciences quantum computing Abstraction layer circuits 0103 physical sciences 0202 electrical engineering electronic engineering information engineering 010306 general physics Quantum quantum compilation Quantum computer computer.programming_language General Engineering Logic synthesis Flow (mathematics) quantum programming languages boolean satisfiability Computer Science::Programming Languages 020201 artificial intelligence & image processing Quantum algorithm Boolean satisfiability problem logic synthesis computer |
| Zdroj: | Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences. 378:20190161 |
| ISSN: | 1471-2962 1364-503X |
| DOI: | 10.1098/rsta.2019.0161 |
| Popis: | 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’. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|