Optimal Layout Synthesis for Quantum Computing
Recent years have witnessed the fast development of quantum computing. Researchers around the world are eager to run larger and larger quantum algorithms that promise speedups impossible to any classical algorithm. However, the available quantum computers are still volatile and error-prone. Thus, la...
Gespeichert in:
| Veröffentlicht in: | Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design S. 1 - 9 |
|---|---|
| Hauptverfasser: | , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
Association on Computer Machinery
02.11.2020
|
| Schlagworte: | |
| ISSN: | 1558-2434 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | Recent years have witnessed the fast development of quantum computing. Researchers around the world are eager to run larger and larger quantum algorithms that promise speedups impossible to any classical algorithm. However, the available quantum computers are still volatile and error-prone. Thus, layout synthesis, which transforms quantum programs to meet these hardware limitations, is a crucial step in the realization of quantum computing. In this paper, we present two synthesizers, one optimal and one approximate but nearly optimal. Although a few optimal approaches to this problem have been published, our optimal synthesizer explores a larger solution space, thus is optimal in a stronger sense. In addition, it reduces time and space complexity exponentially compared to some leading optimal approaches. The key to this success is a more efficient spacetime-based variable encoding of the layout synthesis problem as a mathematical programming problem. By slightly changing our formulation, we arrive at an approximate synthesizer that is even more efficient and outperforms some leading heuristic approaches, in terms of additional gate cost, by up to 100%, and also fidelity by up to 10x on a comprehensive set of benchmark programs and architectures. For a specific family of quantum programs named QAOA, which is deemed to be a promising application for near-term quantum computers, we further adjust the approximate synthesizer by taking commutation into consideration, achieving up to 75% reduction in depth and up to 65% reduction in additional cost compared to the tool used in a leading QAOA study. |
|---|---|
| AbstractList | Recent years have witnessed the fast development of quantum computing. Researchers around the world are eager to run larger and larger quantum algorithms that promise speedups impossible to any classical algorithm. However, the available quantum computers are still volatile and error-prone. Thus, layout synthesis, which transforms quantum programs to meet these hardware limitations, is a crucial step in the realization of quantum computing. In this paper, we present two synthesizers, one optimal and one approximate but nearly optimal. Although a few optimal approaches to this problem have been published, our optimal synthesizer explores a larger solution space, thus is optimal in a stronger sense. In addition, it reduces time and space complexity exponentially compared to some leading optimal approaches. The key to this success is a more efficient spacetime-based variable encoding of the layout synthesis problem as a mathematical programming problem. By slightly changing our formulation, we arrive at an approximate synthesizer that is even more efficient and outperforms some leading heuristic approaches, in terms of additional gate cost, by up to 100%, and also fidelity by up to 10x on a comprehensive set of benchmark programs and architectures. For a specific family of quantum programs named QAOA, which is deemed to be a promising application for near-term quantum computers, we further adjust the approximate synthesizer by taking commutation into consideration, achieving up to 75% reduction in depth and up to 65% reduction in additional cost compared to the tool used in a leading QAOA study. |
| Author | Cong, Jason Tan, Bochen |
| Author_xml | – sequence: 1 givenname: Bochen surname: Tan fullname: Tan, Bochen email: bctan@cs.ucla.edu organization: University of California,Los Angeles – sequence: 2 givenname: Jason surname: Cong fullname: Cong, Jason email: cong@cs.ucla.edu organization: University of California,Los Angeles |
| BookMark | eNotjsFKxDAUAKMouK49e_DSH2h9Sd5Lk6MUXYXCsqyel7RNtLBNS5se-vcu6GnmNMw9uwlDcIw9csg5R3qWCCBB5BI5KQFXLDGF5koRCilQXrMNJ9LZRfGOJfPc1YAISEbrDcv3Y-x6e04ruw5LTI9riD9u7ubUD1N6WGyIS5-WQz8usQvfD-zW2_Pskn9u2dfb62f5nlX73Uf5UmVWaB0z1xheWGpq3pIAJ7yi1nhVWy9qMNRosC1yJ2TReOcJZGFNDQqMAekRC7llT3_dzjl3GqfL4rSejCCljJK_95RFAg |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1145/3400302.3415620 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE/IET Electronic Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9781665423243 1665423242 |
| EISSN | 1558-2434 |
| EndPage | 9 |
| ExternalDocumentID | 9256696 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: NEC funderid: 10.13039/501100008010 |
| GroupedDBID | 6IE 6IF 6IH 6IL 6IN AAWTH ABLEC ADZIZ ALMA_UNASSIGNED_HOLDINGS BEFXN BFFAM BGNUA BKEBE BPEOZ CBEJK CHZPO FEDTE IEGSK IJVOP M43 OCL RIE RIL RIO |
| ID | FETCH-LOGICAL-a288t-ec917a5cb1d520e2f65d9f6baf2b095c80ad41e237cfef5037a9b0609903f4473 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 105 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000671087100118&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:28:32 EDT 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a288t-ec917a5cb1d520e2f65d9f6baf2b095c80ad41e237cfef5037a9b0609903f4473 |
| OpenAccessLink | https://dl.acm.org/doi/pdf/10.1145/3400302.3415620 |
| PageCount | 9 |
| ParticipantIDs | ieee_primary_9256696 |
| PublicationCentury | 2000 |
| PublicationDate | 2020-Nov.-2 |
| PublicationDateYYYYMMDD | 2020-11-02 |
| PublicationDate_xml | – month: 11 year: 2020 text: 2020-Nov.-2 day: 02 |
| PublicationDecade | 2020 |
| PublicationTitle | Digest of technical papers - IEEE/ACM International Conference on Computer-Aided Design |
| PublicationTitleAbbrev | ICCAD |
| PublicationYear | 2020 |
| Publisher | Association on Computer Machinery |
| Publisher_xml | – name: Association on Computer Machinery |
| SSID | ssib044045988 ssj0020286 |
| Score | 2.5568712 |
| Snippet | Recent years have witnessed the fast development of quantum computing. Researchers around the world are eager to run larger and larger quantum algorithms that... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | allocation approximate synthesizer available quantum computers computational complexity Computer architecture Couplings larger quantum algorithms larger solution space Layout layout synthesis layout synthesis problem leading optimal approaches Logic gates mapping mathematical programming mathematical programming problem near-term quantum computers optimal layout synthesis optimal synthesizer optimisation placement quantum computing quantum programs Qubit scheduling Synthesizers |
| Title | Optimal Layout Synthesis for Quantum Computing |
| URI | https://ieeexplore.ieee.org/document/9256696 |
| WOSCitedRecordID | wos000671087100118&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEA5t8aAXH634JgePbrub5-YsFg9SKyr0VvKYQMFupd0V-u9NtmvtwYu3EAgkk4SZb5L5PoRuXZp55pxPUu0CQBEsSwxxJkAVCopzLw3ktdiEHI3yyUSNW-huWwsDAPXnM-jHZv2W7xa2iqmygQr-WSjRRm0p5aZW6-fsRJo7XlNvNWAr-E3RUPlkjA8oi8eZ9GkELFHce0dLpXYlw8P_TeII9X5r8vB4622OUQuKE3SwQyfYRf3ncP_n-gM_6fWiKvHrugjh3Wq2wiEyxS9VMGI1xxsdhzCgh96HD2_3j0mjh5BokudlAjZgK82tyRwnKRAvuFNeGO2JCZGSzYO9WQaESuvB85RKrUwq4tMX9YxJeoo6xaKAM4QDhLbGM3DGUSacNlaBUbkTMaJLvThH3bjy6eeG8mLaLPri7-5LtE8iDI3ZVnKFOuWygmu0Z7_K2Wp5U-_TNzLwk9c |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LSwMxEB5qFdSLj1Z8uwePbrub127OYqlYa8UKvZU8oWC30u4K_fcm27X24MVbCASSScjMN8l8H8CtjmJLtLZhJLQDKIzEoURaOqiCDafUJtKkpdhE0u-noxEf1OBuXQtjjCk_n5mWb5Zv-XqmCp8qa3PnnxlnW7BNCUHxqlrr5_R4ojtakm9VcMt5TlaR-cSEtjHxBxq1sIcsXt57Q02ldCadg_9N4xCav1V5wWDtb46gZrJj2N8gFGxA68XdAFPxEfTEclbkwdsycwHeYrIIXGwavBbOjMU0WCk5uAFNeO88DO-7YaWIEAqUpnlolENXgioZa4oigyyjmlsmhUXSxUoqdRYnsUE4UdZYGuFEcBkx__iFLSEJPoF6NsvMKQQORCtpidFSY8K0kIobyVPNfEwXWXYGDb_y8eeK9GJcLfr87-4b2O0On3vj3mP_6QL2kAelPveKLqGezwtzBTvqK58s5tflnn0DFsKXHg |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Digest+of+technical+papers+-+IEEE%2FACM+International+Conference+on+Computer-Aided+Design&rft.atitle=Optimal+Layout+Synthesis+for+Quantum+Computing&rft.au=Tan%2C+Bochen&rft.au=Cong%2C+Jason&rft.date=2020-11-02&rft.pub=Association+on+Computer+Machinery&rft.eissn=1558-2434&rft.spage=1&rft.epage=9&rft_id=info:doi/10.1145%2F3400302.3415620&rft.externalDocID=9256696 |