Tetris: A Compilation Framework for VQA Applications in Quantum Computing
Quantum computing has shown promise in solving complex problems by leveraging the principles of superposition and entanglement. Variational quantum algorithms (VQA) are a class of algorithms suited for near-term quantum computers due to their modest requirements of qubits and depths of computation....
Uloženo v:
| Vydáno v: | 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) s. 277 - 292 |
|---|---|
| Hlavní autoři: | , , , , , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
29.06.2024
|
| Témata: | |
| 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 has shown promise in solving complex problems by leveraging the principles of superposition and entanglement. Variational quantum algorithms (VQA) are a class of algorithms suited for near-term quantum computers due to their modest requirements of qubits and depths of computation. This paper introduces Tetris - a compilation framework for VQA applications on near-term quantum devices. Tetris focuses on reducing two-qubit gates in the compilation process since a two-qubit gate has an order of magnitude more significant error and execution time than a single-qubit gate. Tetris exploits unique opportunities in the circuit synthesis stage often overlooked by the state-of-the-art VQA compilers for reducing the number of two-qubit gates. Tetris comes with a refined IR of Pauli string to express such a two-qubit gate optimization opportunity. Moreover, Tetris is equipped with a fast bridging approach that mitigates the hardware mapping cost. Overall, Tetris demonstrates a reduction of up to 41.3 \% in CNOT gate counts, 37.9 \% in circuit depth, and \mathbf{4 2. 6 \%} in circuit duration for various molecules of different sizes and structures compared with the state-of-the-art approaches. Tetris is open-sourced at this link. |
|---|---|
| AbstractList | Quantum computing has shown promise in solving complex problems by leveraging the principles of superposition and entanglement. Variational quantum algorithms (VQA) are a class of algorithms suited for near-term quantum computers due to their modest requirements of qubits and depths of computation. This paper introduces Tetris - a compilation framework for VQA applications on near-term quantum devices. Tetris focuses on reducing two-qubit gates in the compilation process since a two-qubit gate has an order of magnitude more significant error and execution time than a single-qubit gate. Tetris exploits unique opportunities in the circuit synthesis stage often overlooked by the state-of-the-art VQA compilers for reducing the number of two-qubit gates. Tetris comes with a refined IR of Pauli string to express such a two-qubit gate optimization opportunity. Moreover, Tetris is equipped with a fast bridging approach that mitigates the hardware mapping cost. Overall, Tetris demonstrates a reduction of up to 41.3 \% in CNOT gate counts, 37.9 \% in circuit depth, and \mathbf{4 2. 6 \%} in circuit duration for various molecules of different sizes and structures compared with the state-of-the-art approaches. Tetris is open-sourced at this link. |
| Author | Huang, Yipeng Zhou, Huiyang Hao, Tianyi Zhang, Eddy Z. Li, Zirui Jin, Yuwei Hua, Fei |
| Author_xml | – sequence: 1 givenname: Yuwei surname: Jin fullname: Jin, Yuwei email: yj243@cs.rutgers.edu organization: Rutgers University,USA – sequence: 2 givenname: Zirui surname: Li fullname: Li, Zirui email: zirui.li@rutgers.edu organization: Rutgers University,USA – sequence: 3 givenname: Fei surname: Hua fullname: Hua, Fei email: huafei90@gmail.com organization: Rutgers University,USA – sequence: 4 givenname: Tianyi surname: Hao fullname: Hao, Tianyi email: tianyi.hao@wisc.edu organization: University of Wisconsin-Madison,USA – sequence: 5 givenname: Huiyang surname: Zhou fullname: Zhou, Huiyang email: hzhou@ncsu.edu organization: North Carolina State University,USA – sequence: 6 givenname: Yipeng surname: Huang fullname: Huang, Yipeng email: yipeng.huang@rutgers.edu organization: Rutgers University,USA – sequence: 7 givenname: Eddy Z. surname: Zhang fullname: Zhang, Eddy Z. email: eddy.zhengzhang@gmail.com organization: Rutgers University,USA |
| BookMark | eNotj9FKwzAYhSM4ULe-wS7yAq1_kqVJvCvFaWEgw-ntSNNEgm1a0hbx7a3Tq3NxOIfvu0PXoQ8WoS2BjBBQ99VrWXAFQmQU6C4DAKquUKKEkowDozmX5AYl4-hryEEJJiS_RdXJTtGPD7jAZd8NvtWT7wPeR93Zrz5-YtdH_H4scDEMrTeXdsQ-4OOswzR3l9U8-fCxQSun29Em_7lGb_vHU_mcHl6eqrI4pJpyOaWSUlIDAwvMkYbwXDiyYBMDxqqGm4UqV8oZLs3ONQ0Do2uuDXeLxLKUbI22f7_eWnseou90_D6TX6ecUfYDDr9Njg |
| CODEN | IEEPAD |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/ISCA59077.2024.00029 |
| 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 |
| EISBN | 9798350326581 |
| EndPage | 292 |
| ExternalDocumentID | 10609632 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: Duke University funderid: 10.13039/100006510 |
| GroupedDBID | 6IE 6IH ACM ALMA_UNASSIGNED_HOLDINGS CBEJK RIE RIO |
| ID | FETCH-LOGICAL-a258t-8221b030e03f1d1567f15901c0ce9d5c785699fc58c4fdd30cab5ac5f35021b83 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 4 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001290320700019&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:34:56 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a258t-8221b030e03f1d1567f15901c0ce9d5c785699fc58c4fdd30cab5ac5f35021b83 |
| PageCount | 16 |
| ParticipantIDs | ieee_primary_10609632 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-June-29 |
| PublicationDateYYYYMMDD | 2024-06-29 |
| PublicationDate_xml | – month: 06 year: 2024 text: 2024-June-29 day: 29 |
| PublicationDecade | 2020 |
| PublicationTitle | 2024 ACM/IEEE 51st Annual International Symposium on Computer Architecture (ISCA) |
| PublicationTitleAbbrev | ISCA |
| PublicationYear | 2024 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssib060973785 |
| Score | 2.3606088 |
| Snippet | Quantum computing has shown promise in solving complex problems by leveraging the principles of superposition and entanglement. Variational quantum algorithms... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 277 |
| SubjectTerms | compilation Computer architecture Computers Costs Logic gates Quantum algorithm Quantum computing Quantum entanglement Qubit VQA |
| Title | Tetris: A Compilation Framework for VQA Applications in Quantum Computing |
| URI | https://ieeexplore.ieee.org/document/10609632 |
| WOSCitedRecordID | wos001290320700019&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/eLvHCXMwlV09T8MwELWgYmACRBHf8sBqcD5sx2xRRUUlVLWiVN0q-2xLHUgRbfj9nJMWujCwRRkS6dnnd-e7d0fInQHQBpmPcekVy5XUzFrLWXAgbRryDJqrgemLGg6L2UyPNmL1RgvjvW-Kz_x9fGxy-W4JdbwqQwuX6HFneOLuKyVbsdZ288jYd0YVYiOPS7h-GLz2SoHBn8IwMI1Nsnl0JHeGqDQc0j_659-PSfdXjUdHPzxzQvZ8dUoGkzgKa_VISxpNetGWtNH-ttaKojNKp-OSljsZarqo6LhGLOt32o5zwA92yVv_adJ7ZpuxCMykolgzpPTEom16noXEYfylQhIVpMDBaycAQZBaBxAF5MG5jIOxwoAImUBCt0V2RjrVsvLnhMZ0MFK8Uc6o3CqvQSUBPb7EBaORxi5IN-Iw_2g7X8y3EFz-8f6KHEaoYylVqq9JZ_1Z-xtyAF_rxerztlmvb3w6lhQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV09T8MwELVQQYIJEEV844E14Hw4jtmiiqoVpWpFqbpV9tmWOpBWbcPv55y00IWBLcqQSM8-vzvfvTtCHhSAVMh8AUutCBKRykBrzQJnINWRS2KorgbGPdHvZ5OJHGzE6pUWxlpbFZ_ZR_9Y5fLNHEp_VYYWnqLHHeOJu8-TJGK1XGu7fVLfeUZkfCOQC5l86r63co7hn8BAMPJtspl3JXfGqFQs0j7-5_9PSPNXj0cHP0xzSvZscUa6Iz8Ma_VMc-qNelYXtdH2ttqKojtKx8Oc5js5ajor6LBENMtPWg90wA82yUf7ZdTqBJvBCIGKeLYOkNRDjdZpWexCgxGYcKHXkAIDKw0HBCGV0gHPIHHGxAyU5gq4izlSus7ic9Io5oW9INQnhJHklTBKJFpYCSJ06POFximJRHZJmh6H6aLufTHdQnD1x_t7ctgZvfWmvW7_9Zocedh9YVUkb0hjvSztLTmAr_Vstbyr1u4bfVaZWw |
| 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=2024+ACM%2FIEEE+51st+Annual+International+Symposium+on+Computer+Architecture+%28ISCA%29&rft.atitle=Tetris%3A+A+Compilation+Framework+for+VQA+Applications+in+Quantum+Computing&rft.au=Jin%2C+Yuwei&rft.au=Li%2C+Zirui&rft.au=Hua%2C+Fei&rft.au=Hao%2C+Tianyi&rft.date=2024-06-29&rft.pub=IEEE&rft.spage=277&rft.epage=292&rft_id=info:doi/10.1109%2FISCA59077.2024.00029&rft.externalDocID=10609632 |