Phase polynomials synthesis algorithms for NISQ architectures and beyond

We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than the state of the art or have a significantly smaller...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2021-04
Main Authors: Vandaele, Vivien, Martiel, Simon, Timothée Goubault de Brugière
Format: Article
Language:English
Subjects:
Algorithms
Polynomials
Synthesis
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page
container_issue
container_start_page
container_title arXiv.org
container_volume
creator Vandaele, Vivien
Martiel, Simon
Timothée Goubault de Brugière
description We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than the state of the art or have a significantly smaller running time for similar performances. We also provide methods that can be applied to our algorithms in order to trade an increase in the CNOT count for a decrease in execution time, thereby filling the gap between our algorithms and faster ones.
doi_str_mv 10.48550/arxiv.2104.00934
format article
fullrecord <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2508726757</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2508726757</sourcerecordid><originalsourceid>FETCH-LOGICAL-a954-7e5e2a3a86ce74822539342400fb850ccb8829b8adb86032f5d7fc4dee2f73fb3</originalsourceid><addsrcrecordid>eNotj11LwzAYhYMgOOZ-gHcBr1vfvkma9FKGusHwA3c_kjSxHV0zk1bsv7cwr87NOc85h5C7AnKuhIAHHX_bnxwL4DlAxfgVWSBjRaY44g1ZpXQEACwlCsEWZPPe6OToOXRTH06t7hJNUz80LrWJ6u4rxHZoTon6EOnr9vOD6mibdnB2GKObHX1NjZtCX9-Saz-n3epfl2T__LRfb7Ld28t2_bjLdCV4Jp1wqJlWpXWSK0TB5onIAbxRAqw1SmFllK6NKoGhF7X0ltfOoZfMG7Yk9xfsOYbv0aXhcAxj7OfGAwpQcj4mJPsDjUhOWQ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2508726757</pqid></control><display><type>article</type><title>Phase polynomials synthesis algorithms for NISQ architectures and beyond</title><source>Publicly Available Content (ProQuest)</source><creator>Vandaele, Vivien ; Martiel, Simon ; Timothée Goubault de Brugière</creator><creatorcontrib>Vandaele, Vivien ; Martiel, Simon ; Timothée Goubault de Brugière</creatorcontrib><description>We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than the state of the art or have a significantly smaller running time for similar performances. We also provide methods that can be applied to our algorithms in order to trade an increase in the CNOT count for a decrease in execution time, thereby filling the gap between our algorithms and faster ones.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2104.00934</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Polynomials ; Synthesis</subject><ispartof>arXiv.org, 2021-04</ispartof><rights>2021. This work is published under http://creativecommons.org/licenses/by/4.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://www.proquest.com/docview/2508726757?pq-origsite=primo$$EHTML$$P50$$Gproquest$$Hfree_for_read</linktohtml><link.rule.ids>780,784,25753,27925,37012,44590</link.rule.ids></links><search><creatorcontrib>Vandaele, Vivien</creatorcontrib><creatorcontrib>Martiel, Simon</creatorcontrib><creatorcontrib>Timothée Goubault de Brugière</creatorcontrib><title>Phase polynomials synthesis algorithms for NISQ architectures and beyond</title><title>arXiv.org</title><description>We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than the state of the art or have a significantly smaller running time for similar performances. We also provide methods that can be applied to our algorithms in order to trade an increase in the CNOT count for a decrease in execution time, thereby filling the gap between our algorithms and faster ones.</description><subject>Algorithms</subject><subject>Polynomials</subject><subject>Synthesis</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2021</creationdate><recordtype>article</recordtype><sourceid>PIMPY</sourceid><recordid>eNotj11LwzAYhYMgOOZ-gHcBr1vfvkma9FKGusHwA3c_kjSxHV0zk1bsv7cwr87NOc85h5C7AnKuhIAHHX_bnxwL4DlAxfgVWSBjRaY44g1ZpXQEACwlCsEWZPPe6OToOXRTH06t7hJNUz80LrWJ6u4rxHZoTon6EOnr9vOD6mibdnB2GKObHX1NjZtCX9-Saz-n3epfl2T__LRfb7Ld28t2_bjLdCV4Jp1wqJlWpXWSK0TB5onIAbxRAqw1SmFllK6NKoGhF7X0ltfOoZfMG7Yk9xfsOYbv0aXhcAxj7OfGAwpQcj4mJPsDjUhOWQ</recordid><startdate>20210402</startdate><enddate>20210402</enddate><creator>Vandaele, Vivien</creator><creator>Martiel, Simon</creator><creator>Timothée Goubault de Brugière</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20210402</creationdate><title>Phase polynomials synthesis algorithms for NISQ architectures and beyond</title><author>Vandaele, Vivien ; Martiel, Simon ; Timothée Goubault de Brugière</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a954-7e5e2a3a86ce74822539342400fb850ccb8829b8adb86032f5d7fc4dee2f73fb3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2021</creationdate><topic>Algorithms</topic><topic>Polynomials</topic><topic>Synthesis</topic><toplevel>online_resources</toplevel><creatorcontrib>Vandaele, Vivien</creatorcontrib><creatorcontrib>Martiel, Simon</creatorcontrib><creatorcontrib>Timothée Goubault de Brugière</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science &amp; Engineering Collection</collection><collection>ProQuest Central (Alumni)</collection><collection>ProQuest Central</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>ProQuest Engineering Database</collection><collection>Publicly Available Content (ProQuest)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Vandaele, Vivien</au><au>Martiel, Simon</au><au>Timothée Goubault de Brugière</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Phase polynomials synthesis algorithms for NISQ architectures and beyond</atitle><jtitle>arXiv.org</jtitle><date>2021-04-02</date><risdate>2021</risdate><eissn>2331-8422</eissn><abstract>We present a framework for the synthesis of phase polynomials that addresses both cases of full connectivity and partial connectivity for NISQ architectures. In most cases, our algorithms generate circuits with lower CNOT count and CNOT depth than the state of the art or have a significantly smaller running time for similar performances. We also provide methods that can be applied to our algorithms in order to trade an increase in the CNOT count for a decrease in execution time, thereby filling the gap between our algorithms and faster ones.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2104.00934</doi><oa>free_for_read</oa></addata></record>
fulltext fulltext
identifier EISSN: 2331-8422
ispartof arXiv.org, 2021-04
issn 2331-8422
language eng
recordid cdi_proquest_journals_2508726757
source Publicly Available Content (ProQuest)
subjects Algorithms
Polynomials
Synthesis
title Phase polynomials synthesis algorithms for NISQ architectures and beyond
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T22%3A01%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Phase%20polynomials%20synthesis%20algorithms%20for%20NISQ%20architectures%20and%20beyond&rft.jtitle=arXiv.org&rft.au=Vandaele,%20Vivien&rft.date=2021-04-02&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2104.00934&rft_dat=%3Cproquest%3E2508726757%3C/proquest%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-a954-7e5e2a3a86ce74822539342400fb850ccb8829b8adb86032f5d7fc4dee2f73fb3%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=2508726757&rft_id=info:pmid/&rfr_iscdi=true