Recompiling QAOA Circuits on Various Rotational Directions
The quantum approximate optimization algorithm (QAOA) is introduced to efficiently solve combinatorial optimization problems. Despite the promise of QAOA, the cost of executing QAOA circuits at scale for quantum advantage may still be excessive for the near-future quantum device. We observe the incr...
Gespeichert in:
| Veröffentlicht in: | 2024 33rd International Conference on Parallel Architectures and Compilation Techniques (PACT) S. 309 - 324 |
|---|---|
| Hauptverfasser: | , , , , , , , , |
| Format: | Tagungsbericht |
| Sprache: | Englisch |
| Veröffentlicht: |
ACM
13.10.2024
|
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Abstract | The quantum approximate optimization algorithm (QAOA) is introduced to efficiently solve combinatorial optimization problems. Despite the promise of QAOA, the cost of executing QAOA circuits at scale for quantum advantage may still be excessive for the near-future quantum device. We observe the increasing overhead of QAOA circuit execution in the native gate translation. To execute QAOA circuits on a real quantum computing device, Hamiltonians composed of predefined specific rotations (e.g., ZZ and X) should be decomposed into finite native gates. By adopting rotational combinations that utilize native gates more directly than the standard QAOA circuit model, the execution cost on real quantum devices can be reduced. In this study, we propose Racoon (Rotational Space Virtualization for QAOA Ansatz), an algorithm-hardware co-design approach that revisits the synthesis conditions of QAOA circuits and selects alternative candidates with different rotational combinations. Our analysis of six commercial quantum processors demonstrates that applying Racoon to QAOA circuits for the 4-node Sherrington-Kirkpatrick model reduces the number of native gates by an average of 23 \% and up to 79 \% . Consequently, using Racoon results in 43 \% fewer training epochs, 41 \% lower training energy consumption, and a 6 \% improvement in inference on average compared to standard QAOA. Racoon consistently reduces circuit depth as the number of qubits and layers increases, achieving 123 \times more circuit depth reduction compared to the recently proposed Depth First Search (DFS)-based method. Furthermore, we confirm that Racoon's method can be extended to State-of-The-Art QAOAs with modified ansätze and to the variational quantum eigensolver (VQE). |
|---|---|
| AbstractList | The quantum approximate optimization algorithm (QAOA) is introduced to efficiently solve combinatorial optimization problems. Despite the promise of QAOA, the cost of executing QAOA circuits at scale for quantum advantage may still be excessive for the near-future quantum device. We observe the increasing overhead of QAOA circuit execution in the native gate translation. To execute QAOA circuits on a real quantum computing device, Hamiltonians composed of predefined specific rotations (e.g., ZZ and X) should be decomposed into finite native gates. By adopting rotational combinations that utilize native gates more directly than the standard QAOA circuit model, the execution cost on real quantum devices can be reduced. In this study, we propose Racoon (Rotational Space Virtualization for QAOA Ansatz), an algorithm-hardware co-design approach that revisits the synthesis conditions of QAOA circuits and selects alternative candidates with different rotational combinations. Our analysis of six commercial quantum processors demonstrates that applying Racoon to QAOA circuits for the 4-node Sherrington-Kirkpatrick model reduces the number of native gates by an average of 23 \% and up to 79 \% . Consequently, using Racoon results in 43 \% fewer training epochs, 41 \% lower training energy consumption, and a 6 \% improvement in inference on average compared to standard QAOA. Racoon consistently reduces circuit depth as the number of qubits and layers increases, achieving 123 \times more circuit depth reduction compared to the recently proposed Depth First Search (DFS)-based method. Furthermore, we confirm that Racoon's method can be extended to State-of-The-Art QAOAs with modified ansätze and to the variational quantum eigensolver (VQE). |
| Author | Ha, Dongho Kim, Youngmin Lee, Yongju Ahn, Sungwoo Ro, Won Woo Kwon, Jaewon Choi, Seungwoo Kim, Hyungseok Jang, Enhyeok |
| Author_xml | – sequence: 1 givenname: Enhyeok surname: Jang fullname: Jang, Enhyeok email: enhyeok.jang@yonsei.ac.kr organization: Yonsei University,Republic of Korea – sequence: 2 givenname: Dongho surname: Ha fullname: Ha, Dongho email: dongho.ha@yonsei.ac.kr organization: Yonsei University,Republic of Korea – sequence: 3 givenname: Seungwoo surname: Choi fullname: Choi, Seungwoo email: seungwoo.choi@yonsei.ac.kr organization: Yonsei University,Republic of Korea – sequence: 4 givenname: Youngmin surname: Kim fullname: Kim, Youngmin email: youngmin.kim@yonsei.ac.kr organization: Yonsei University,Republic of Korea – sequence: 5 givenname: Jaewon surname: Kwon fullname: Kwon, Jaewon email: jaewon.kwon@yonsei.ac.kr organization: Yonsei University,Republic of Korea – sequence: 6 givenname: Yongju surname: Lee fullname: Lee, Yongju email: yongju.lee@yonsei.ac.kr organization: Yonsei University,Republic of Korea – sequence: 7 givenname: Sungwoo surname: Ahn fullname: Ahn, Sungwoo email: sungwoo.ahn@yonsei.ac.kr organization: Yonsei University,Republic of Korea – sequence: 8 givenname: Hyungseok surname: Kim fullname: Kim, Hyungseok email: kimnumber@yonsei.ac.kr organization: Yonsei University,Republic of Korea – sequence: 9 givenname: Won Woo surname: Ro fullname: Ro, Won Woo email: wro@yonsei.ac.kr organization: Yonsei University,Republic of Korea |
| BookMark | eNotjLtOwzAUQI1EJaDNzMLgH0i5tuPHZYvCU6pUUQFr5Tg3yFIaV3E68PeAYDpnODpX7HxMIzF2LWAtRKVvldEGBK6VscYhnrECLboKwIJRwl2wIufYgrbyp3Pykt3tKKTDMQ5x_OSv9bbmTZzCKc6Zp5F_-CmmU-a7NPs5ptEP_D5OFH49r9ii90Om4p9L9v748NY8l5vt00tTb0ovHc5loKqV1oBS0LoeW1d1zuhOQxAkrdAdavLYQyc86Va5gIF8QOq18bY3qJbs5u8biWh_nOLBT197AQ6skk59AwGvR-0 |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IL CBEJK RIE RIL |
| DOI | 10.1145/3656019.3676899 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP All) 1998-Present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore Digital Library url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| EISBN | 9798400706318 |
| EndPage | 324 |
| ExternalDocumentID | 10807328 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Research Foundation of Korea funderid: 10.13039/501100003725 – fundername: Ministry of Science and ICT funderid: 10.13039/501100014188 |
| GroupedDBID | 6IE 6IL ACM ALMA_UNASSIGNED_HOLDINGS APO CBEJK LHSKQ RIE RIL |
| ID | FETCH-LOGICAL-a289t-ce4b2760330b8f9b84d865d50c1e2715d95ea9f0d1ae5b38c9ceac9ef56a7f693 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 1 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001344829000024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Jan 08 06:10:43 EST 2025 |
| IsDoiOpenAccess | false |
| IsOpenAccess | true |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-a289t-ce4b2760330b8f9b84d865d50c1e2715d95ea9f0d1ae5b38c9ceac9ef56a7f693 |
| OpenAccessLink | https://doi.org/10.1145/3656019.3676899 |
| PageCount | 16 |
| ParticipantIDs | ieee_primary_10807328 |
| PublicationCentury | 2000 |
| PublicationDate | 2024-Oct.-13 |
| PublicationDateYYYYMMDD | 2024-10-13 |
| PublicationDate_xml | – month: 10 year: 2024 text: 2024-Oct.-13 day: 13 |
| PublicationDecade | 2020 |
| PublicationTitle | 2024 33rd International Conference on Parallel Architectures and Compilation Techniques (PACT) |
| PublicationTitleAbbrev | PACT |
| PublicationYear | 2024 |
| Publisher | ACM |
| Publisher_xml | – name: ACM |
| SSID | ssib057256082 |
| Score | 2.291699 |
| Snippet | The quantum approximate optimization algorithm (QAOA) is introduced to efficiently solve combinatorial optimization problems. Despite the promise of QAOA, the... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 309 |
| SubjectTerms | Algorithm-Hardware Co-Design Circuits Costs Energy consumption Integrated circuit modeling Logic gates Native Gate Optimization Program processors Quantum Compiler Training Virtualization |
| Title | Recompiling QAOA Circuits on Various Rotational Directions |
| URI | https://ieeexplore.ieee.org/document/10807328 |
| WOSCitedRecordID | wos001344829000024&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/eLvHCXMwlV09T8MwELVoxcAEiCK-5YE1bRzHsc1WVVQMqBQEqFtlO2cpA0nVJvx-fGkKLAxslgdbls_3fPa9d4TcasYd3lQjDSKLUpuFM6dSjh-OGlJtjZItUfhRzmZqsdDzjqzecmEAoE0-gyE227_8vHINPpWNMB8OxWV6pCel3JK1dsYjJIK3Sjr5HpaKEUdhGaaHKEqmUNz1V_2UFj6mh_-c-IgMfoh4dP4NMcdkD8oTcoch48eqQCI5fR4_jemkWLumqDe0Kul7CH5DNE9fqrp756OdWwv2NSBv0_vXyUPUlUCITIiE6shBahOZxZzHVnltVZqrTOQidgwSyUSuBRjt45wZEJYrp13wpBq8yIz0meanpF9WJZwRynXuhDOJVzYM6pU2SeyZBxbnMtza_DkZ4MKXq63KxXK35os_-i_JQRIAHv0441ekX68buCb77rMuNuubdm--AM8rkDM |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8MgFCY6TfSkxhl_y8Frt1KgBW_L4jLjnNNMs9tS4JH0YLt0nX-_0HXqxYM3wgFCeLyPB-_7HkK3klDtb6qBBB4HTMXuzAlG_YejBCZVKpKaKDxKxmMxm8lJQ1avuTAAUCefQcc36798U-iVfyrr-nw4Ly6zjXY4YxFZ07U25sMTD98iagR8CONd6qVliOx4WTLh5V1_VVCpAWRw8M-pD1H7h4qHJ98gc4S2ID9Gdz5o_FhknkqOX3rPPdzPSr3KqiUucvzuwl8Xz-PXompe-nDj2JyFtdHb4H7aHwZNEYQgdbFQFWhgKkrikNJQCSuVYEbE3PBQE4gSwo3kkEobGpICV1RoqZ0vlWB5nCY2lvQEtfIih1OEqTSa6zSyQrlBrZBpFFpigYQmcfc2e4bafuHzxVrnYr5Z8_kf_Tdobzh9Gs1HD-PHC7QfObj3Xp3QS9SqyhVcoV39WWXL8rrepy-As5N6 |
| 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+33rd+International+Conference+on+Parallel+Architectures+and+Compilation+Techniques+%28PACT%29&rft.atitle=Recompiling+QAOA+Circuits+on+Various+Rotational+Directions&rft.au=Jang%2C+Enhyeok&rft.au=Ha%2C+Dongho&rft.au=Choi%2C+Seungwoo&rft.au=Kim%2C+Youngmin&rft.date=2024-10-13&rft.pub=ACM&rft.spage=309&rft.epage=324&rft_id=info:doi/10.1145%2F3656019.3676899&rft.externalDocID=10807328 |