Reinforcement Learning and DEAR Framework for Solving the Qubit Mapping Problem
Quantum computing is gaining more and more attention due to its huge potential and the constant progress in quantum computer development. IBM and Google have released quantum architectures with more than 50 qubits. However, in these machines, the physical qubits are not fully connected so that two-q...
Uloženo v:
| Vydáno v: | 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) s. 1 - 9 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
ACM
29.10.2022
|
| Témata: | |
| ISSN: | 1558-2434 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | Quantum computing is gaining more and more attention due to its huge potential and the constant progress in quantum computer development. IBM and Google have released quantum architectures with more than 50 qubits. However, in these machines, the physical qubits are not fully connected so that two-qubit interaction can only be performed between specific pairs of the physical qubits. To execute a quantum circuit, it is necessary to transform it into a functionally equivalent one that respects the constraints imposed by the target architecture. Quantum circuit transformation inevitably introduces additional gates which reduces the fidelity of the circuit. Therefore, it is important that the transformation method completes the transformation with minimal overheads. It consists of two steps, initial mapping and qubit routing. Here we propose a reinforcement learning-based model to solve the initial mapping problem. Initial mapping is formulated as sequence-to-sequence learning and self- attention network is used to extract features from a circuit. For qubit routing, a DEAR (Dynamically-Extract-and-Route) framework is proposed. The framework iteratively extracts a subcircuit and uses A* search to determine when and where to insert additional gates. It helps to preserve the lookahead ability dynamically and to provide more accurate cost estimation efficiently during A* search. The experimental results show that our RL-model generates better initial mappings than the best known algorithms with 12% fewer additional gates in the qubit routing stage. Furthermore, our DEAR- framework outperforms the state-of-the-art qubit routing approach with 8.4% and 36.3% average reduction in the number of additional gates and execution time starting from the same initial mapping. |
|---|---|
| AbstractList | Quantum computing is gaining more and more attention due to its huge potential and the constant progress in quantum computer development. IBM and Google have released quantum architectures with more than 50 qubits. However, in these machines, the physical qubits are not fully connected so that two-qubit interaction can only be performed between specific pairs of the physical qubits. To execute a quantum circuit, it is necessary to transform it into a functionally equivalent one that respects the constraints imposed by the target architecture. Quantum circuit transformation inevitably introduces additional gates which reduces the fidelity of the circuit. Therefore, it is important that the transformation method completes the transformation with minimal overheads. It consists of two steps, initial mapping and qubit routing. Here we propose a reinforcement learning-based model to solve the initial mapping problem. Initial mapping is formulated as sequence-to-sequence learning and self- attention network is used to extract features from a circuit. For qubit routing, a DEAR (Dynamically-Extract-and-Route) framework is proposed. The framework iteratively extracts a subcircuit and uses A* search to determine when and where to insert additional gates. It helps to preserve the lookahead ability dynamically and to provide more accurate cost estimation efficiently during A* search. The experimental results show that our RL-model generates better initial mappings than the best known algorithms with 12% fewer additional gates in the qubit routing stage. Furthermore, our DEAR- framework outperforms the state-of-the-art qubit routing approach with 8.4% and 36.3% average reduction in the number of additional gates and execution time starting from the same initial mapping. |
| Author | Huang, Ching-Yao Mak, Wai-Kei Lien, Chi-Hsiang |
| Author_xml | – sequence: 1 givenname: Ching-Yao surname: Huang fullname: Huang, Ching-Yao email: rabit66119929@gapp.nthu.edu.tw organization: National Tsing Hua University,Hsinchu,Taiwan – sequence: 2 givenname: Chi-Hsiang surname: Lien fullname: Lien, Chi-Hsiang email: wee62660@gapp.nthu.edu.tw organization: National Tsing Hua University,Hsinchu,Taiwan – sequence: 3 givenname: Wai-Kei surname: Mak fullname: Mak, Wai-Kei email: wkmak@cs.nthu.edu.tw organization: National Tsing Hua University,Hsinchu,Taiwan |
| BookMark | eNotjM1OAjEURqvRRMRZu3HRFxi8_W-XBEFNMCjqmnTorY4yHdIZNL69EF19yTkn3zk5SW1CQi4ZjBiT6loosELxkVDSScOPSOGM3QsQjjMjj8mAKWVLLoU8I0XXfQAAt4YZAwOyWGKdYpvX2GDq6Rx9TnV6oz4FejMdL-ks-wa_2_xJ9xV9bjdfB92_I33aVXVPH_x2eyCPua022FyQ0-g3HRb_OySvs-nL5K6cL27vJ-N56bm0fenW0WmnIYTooxeCOykhoAt-jYYFETVGofdpxSvmmfBK64CWO8dkZQDFkFz9_daIuNrmuvH5Z8UADACz4hf1WFB6 |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1145/3508352.3549472 |
| 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 Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISBN | 9781450392174 1450392172 |
| EISSN | 1558-2434 |
| EndPage | 9 |
| ExternalDocumentID | 10070018 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Science and Technology Council funderid: 10.13039/501100020950 |
| 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-a248t-9cf96960ddfafa3329440de9dace71d3f6ef36248b2b1a13a566de829914b70e3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 14 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000981574300105&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:46:23 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a248t-9cf96960ddfafa3329440de9dace71d3f6ef36248b2b1a13a566de829914b70e3 |
| PageCount | 9 |
| ParticipantIDs | ieee_primary_10070018 |
| PublicationCentury | 2000 |
| PublicationDate | 2022-Oct.-29 |
| PublicationDateYYYYMMDD | 2022-10-29 |
| PublicationDate_xml | – month: 10 year: 2022 text: 2022-Oct.-29 day: 29 |
| PublicationDecade | 2020 |
| PublicationTitle | 2022 IEEE/ACM International Conference On Computer Aided Design (ICCAD) |
| PublicationTitleAbbrev | ICCAD |
| PublicationYear | 2022 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssj0002871770 ssj0020286 |
| Score | 2.3330574 |
| Snippet | Quantum computing is gaining more and more attention due to its huge potential and the constant progress in quantum computer development. IBM and Google have... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 1 |
| SubjectTerms | Computer architecture Logic gates Monte Carlo methods Qubit Reinforcement learning Routing Transforms |
| Title | Reinforcement Learning and DEAR Framework for Solving the Qubit Mapping Problem |
| URI | https://ieeexplore.ieee.org/document/10070018 |
| WOSCitedRecordID | wos000981574300105&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/eLvHCXMwlV1JTwIxFG6UeNCLG8Y9PXgdmC5D26NRiAdFRE24kS6vhMQMBgd_v20ZkIsHb81LkzavTd_W73sI3UhlbMG8ykL8ozJuNMmkNCFKMRo06RTCLIHCj6Lfl6ORGtRg9YSFAYD0-QxacZhq-W5mFzFV1o4V_dhFbhttCyGWYK11QiW6_iJevjraCoJOzeVDeNFmRXI2WiwERDzyAW80U0m2pLf_z10coOYvKg8P1vbmEG1BeYT2NggFj9HzEBITqk1JP1yTp06wLh2-794OcW_1FwuHWfh19hHzCTg4gfhlYaYVftKRr2ES14l9Zprovdd9u3vI6pYJmaZcVpmyPtLd5M557TVjVHGeO1BOWxDEMd8BH0wWl4YaognTwZtzIINNItyIHNgJapSzEk4RZiA0o2AJF8BzZoxXUngKuTNMmqI4Q82om_HnkhVjvFLL-R_yC7RLI3QgvPtUXaJGNV_AFdqx39X0a36dzvIHeYeehQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LTgIxFG0UTdSNL4xvu3A7OH0MbZdGIRgBETFhR9rpLSExg8HB77cdBmTjwl1z06RN2-TcR8-5CN1KZdKEORX5-EdF3GgSSWl8lGI0aFJPhFkQhdui25XDoeqVZPWCCwMAxeczqIVhUcu303QeUmV3oaIfushtoq2Ec0oWdK1VSiU4_yI8vzLe8oZ6qeZDeHLHksLdqDEfEvGgCLzWTqVAk-b-P_dxgKq_vDzcWyHOIdqA7AjtrUkKHqOXPhRaqGmR9sOlfOoY68zix8Z9HzeXv7Gwn4Xfph8ho4C9G4hf52aS444Oig3jsE7oNFNF783G4KEVlU0TIk25zCOVuiB4E1vrtNOMUcV5bEFZnYIglrk6OA9aXBpqiCZMe3_OgvSoRLgRMbATVMmmGZwizEBoRiElXACPmTFOSeEoxNYwaZLkDFXD2Yw-F7oYo-WxnP9hv0E7rUGnPWo_dZ8v0C4NRAKPAlRdoko-m8MV2k6_88nX7Lq41x_poaHM |
| 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=2022+IEEE%2FACM+International+Conference+On+Computer+Aided+Design+%28ICCAD%29&rft.atitle=Reinforcement+Learning+and+DEAR+Framework+for+Solving+the+Qubit+Mapping+Problem&rft.au=Huang%2C+Ching-Yao&rft.au=Lien%2C+Chi-Hsiang&rft.au=Mak%2C+Wai-Kei&rft.date=2022-10-29&rft.pub=ACM&rft.eissn=1558-2434&rft.spage=1&rft.epage=9&rft_id=info:doi/10.1145%2F3508352.3549472&rft.externalDocID=10070018 |