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 in:Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences physical, and engineering sciences, 2020-02, Vol.378 (2164), p.20190161-20190161
Main Authors: Soeken, Mathias, Meuli, Giulia, Schmitt, Bruno, Mozafari, Fereshte, Riener, Heinz, De Micheli, Giovanni
Format: Article
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by cdi_FETCH-LOGICAL-c379t-232e9d9da2d826e99f5b20c519bfcdfd1b79db44c87cb18e7f3e9d5669907b6e3
cites cdi_FETCH-LOGICAL-c379t-232e9d9da2d826e99f5b20c519bfcdfd1b79db44c87cb18e7f3e9d5669907b6e3
container_end_page 20190161
container_issue 2164
container_start_page 20190161
container_title Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences
container_volume 378
creator Soeken, Mathias
Meuli, Giulia
Schmitt, Bruno
Mozafari, Fereshte
Riener, Heinz
De Micheli, Giovanni
description 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'.
doi_str_mv 10.1098/rsta.2019.0161
format article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_2330063867</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2330063867</sourcerecordid><originalsourceid>FETCH-LOGICAL-c379t-232e9d9da2d826e99f5b20c519bfcdfd1b79db44c87cb18e7f3e9d5669907b6e3</originalsourceid><addsrcrecordid>eNo9kDtPwzAUhS0EoqWwMqKMLAm-duLHCBUvqRILSGyWn5JRXo2Tof-eRC1M50rnu2f4ELoFXACW4mFIoy4IBllgYHCG1lByyIlk5Hy-KSvzCtPvFbpK6QdjAFaRS7SiIFglBF-j_Knraq_bLOkxphC1iXUcD1lss_2k23FqMts1faznumuv0UXQdfI3p9ygr5fnz-1bvvt4fd8-7nJLuRxzQomXTjpNnCDMSxkqQ7CtQJpgXXBguHSmLK3g1oDwPNCZrxiTEnPDPN2g--NuP3T7yadRNTFZX9e69d2UFKEUY0YF4zNaHFE7dCkNPqh-iI0eDgqwWhSpRZFaFKlF0fxwd9qeTOPdP_7nhP4Cjsdipw</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2330063867</pqid></control><display><type>article</type><title>Boolean satisfiability in quantum compilation</title><source>JSTOR</source><source>Royal Society Publishing Jisc Collections Royal Society Journals Read &amp; Publish Transitional Agreement 2025 (reading list)</source><creator>Soeken, Mathias ; Meuli, Giulia ; Schmitt, Bruno ; Mozafari, Fereshte ; Riener, Heinz ; De Micheli, Giovanni</creator><creatorcontrib>Soeken, Mathias ; Meuli, Giulia ; Schmitt, Bruno ; Mozafari, Fereshte ; Riener, Heinz ; De Micheli, Giovanni</creatorcontrib><description>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'.</description><identifier>ISSN: 1364-503X</identifier><identifier>EISSN: 1471-2962</identifier><identifier>DOI: 10.1098/rsta.2019.0161</identifier><identifier>PMID: 31865887</identifier><language>eng</language><publisher>England</publisher><ispartof>Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences, 2020-02, Vol.378 (2164), p.20190161-20190161</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c379t-232e9d9da2d826e99f5b20c519bfcdfd1b79db44c87cb18e7f3e9d5669907b6e3</citedby><cites>FETCH-LOGICAL-c379t-232e9d9da2d826e99f5b20c519bfcdfd1b79db44c87cb18e7f3e9d5669907b6e3</cites><orcidid>0000-0002-7827-3215</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/31865887$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink></links><search><creatorcontrib>Soeken, Mathias</creatorcontrib><creatorcontrib>Meuli, Giulia</creatorcontrib><creatorcontrib>Schmitt, Bruno</creatorcontrib><creatorcontrib>Mozafari, Fereshte</creatorcontrib><creatorcontrib>Riener, Heinz</creatorcontrib><creatorcontrib>De Micheli, Giovanni</creatorcontrib><title>Boolean satisfiability in quantum compilation</title><title>Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences</title><addtitle>Philos Trans A Math Phys Eng Sci</addtitle><description>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'.</description><issn>1364-503X</issn><issn>1471-2962</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2020</creationdate><recordtype>article</recordtype><recordid>eNo9kDtPwzAUhS0EoqWwMqKMLAm-duLHCBUvqRILSGyWn5JRXo2Tof-eRC1M50rnu2f4ELoFXACW4mFIoy4IBllgYHCG1lByyIlk5Hy-KSvzCtPvFbpK6QdjAFaRS7SiIFglBF-j_Knraq_bLOkxphC1iXUcD1lss_2k23FqMts1faznumuv0UXQdfI3p9ygr5fnz-1bvvt4fd8-7nJLuRxzQomXTjpNnCDMSxkqQ7CtQJpgXXBguHSmLK3g1oDwPNCZrxiTEnPDPN2g--NuP3T7yadRNTFZX9e69d2UFKEUY0YF4zNaHFE7dCkNPqh-iI0eDgqwWhSpRZFaFKlF0fxwd9qeTOPdP_7nhP4Cjsdipw</recordid><startdate>20200207</startdate><enddate>20200207</enddate><creator>Soeken, Mathias</creator><creator>Meuli, Giulia</creator><creator>Schmitt, Bruno</creator><creator>Mozafari, Fereshte</creator><creator>Riener, Heinz</creator><creator>De Micheli, Giovanni</creator><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7X8</scope><orcidid>https://orcid.org/0000-0002-7827-3215</orcidid></search><sort><creationdate>20200207</creationdate><title>Boolean satisfiability in quantum compilation</title><author>Soeken, Mathias ; Meuli, Giulia ; Schmitt, Bruno ; Mozafari, Fereshte ; Riener, Heinz ; De Micheli, Giovanni</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c379t-232e9d9da2d826e99f5b20c519bfcdfd1b79db44c87cb18e7f3e9d5669907b6e3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2020</creationdate><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Soeken, Mathias</creatorcontrib><creatorcontrib>Meuli, Giulia</creatorcontrib><creatorcontrib>Schmitt, Bruno</creatorcontrib><creatorcontrib>Mozafari, Fereshte</creatorcontrib><creatorcontrib>Riener, Heinz</creatorcontrib><creatorcontrib>De Micheli, Giovanni</creatorcontrib><collection>PubMed</collection><collection>CrossRef</collection><collection>MEDLINE - Academic</collection><jtitle>Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Soeken, Mathias</au><au>Meuli, Giulia</au><au>Schmitt, Bruno</au><au>Mozafari, Fereshte</au><au>Riener, Heinz</au><au>De Micheli, Giovanni</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Boolean satisfiability in quantum compilation</atitle><jtitle>Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences</jtitle><addtitle>Philos Trans A Math Phys Eng Sci</addtitle><date>2020-02-07</date><risdate>2020</risdate><volume>378</volume><issue>2164</issue><spage>20190161</spage><epage>20190161</epage><pages>20190161-20190161</pages><issn>1364-503X</issn><eissn>1471-2962</eissn><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'.</abstract><cop>England</cop><pmid>31865887</pmid><doi>10.1098/rsta.2019.0161</doi><tpages>1</tpages><orcidid>https://orcid.org/0000-0002-7827-3215</orcidid><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier ISSN: 1364-503X
ispartof Philosophical transactions of the Royal Society of London. Series A: Mathematical, physical, and engineering sciences, 2020-02, Vol.378 (2164), p.20190161-20190161
issn 1364-503X
1471-2962
language eng
recordid cdi_proquest_miscellaneous_2330063867
source JSTOR; Royal Society Publishing Jisc Collections Royal Society Journals Read & Publish Transitional Agreement 2025 (reading list)
title Boolean satisfiability in quantum compilation
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-21T17%3A11%3A40IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Boolean%20satisfiability%20in%20quantum%20compilation&rft.jtitle=Philosophical%20transactions%20of%20the%20Royal%20Society%20of%20London.%20Series%20A:%20Mathematical,%20physical,%20and%20engineering%20sciences&rft.au=Soeken,%20Mathias&rft.date=2020-02-07&rft.volume=378&rft.issue=2164&rft.spage=20190161&rft.epage=20190161&rft.pages=20190161-20190161&rft.issn=1364-503X&rft.eissn=1471-2962&rft_id=info:doi/10.1098/rsta.2019.0161&rft_dat=%3Cproquest_cross%3E2330063867%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c379t-232e9d9da2d826e99f5b20c519bfcdfd1b79db44c87cb18e7f3e9d5669907b6e3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2330063867&rft_id=info:pmid/31865887&rfr_iscdi=true