Parity Quantum Optimization: Benchmarks
We present benchmarks of the parity transformation for the Quantum Approximate Optimization Algorithm (QAOA). We analyse the gate resources required to implement a single QAOA cycle for real-world scenarios. In particular, we consider random spin models with higher order terms, as well as the proble...
Gespeichert in:
| Veröffentlicht in: | arXiv.org 2023-03 |
|---|---|
| Hauptverfasser: | , , , |
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | arXiv.org |
| container_volume | |
| creator | Fellner, Michael Kilian Ender Roeland ter Hoeven Lechner, Wolfgang |
| description | We present benchmarks of the parity transformation for the Quantum Approximate Optimization Algorithm (QAOA). We analyse the gate resources required to implement a single QAOA cycle for real-world scenarios. In particular, we consider random spin models with higher order terms, as well as the problems of predicting financial crashes and finding the ground states of electronic structure Hamiltonians. For the spin models studied our findings imply a significant advantage of the parity mapping compared to the standard gate model. In combination with full parallelizability of gates this has the potential to boost the race for demonstrating quantum advantage. |
| doi_str_mv | 10.48550/arxiv.2105.06240 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_arxiv</sourceid><recordid>TN_cdi_arxiv_primary_2105_06240</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2527375629</sourcerecordid><originalsourceid>FETCH-LOGICAL-a950-d4df5cbed393f8b8722ed3b2bc98bb6e1fe5b8af06d0eb8c8151b02943ae6b183</originalsourceid><addsrcrecordid>eNotj09Lw0AUxBdBsNR-AE8GPHhKfPs2b7PxpsWqUKhC72E32eBW88fdRKyf3th6mjkMM_Nj7IJDkioiuNH-230lyIESkJjCCZuhEDxWKeIZW4SwAwCUGRKJGbt-0d4N--h11O0wNtGmH1zjfvTguvY2urdt-dZo_x7O2WmtP4Jd_OucbVcP2-VTvN48Pi_v1rHOCeIqrWoqja1ELmplVIY4eYOmzJUx0vLaklG6BlmBNapUnLgBzFOhrTRciTm7PNYeKIreu2l9X_zRFAeaKXF1TPS--xxtGIpdN_p2-lQgYSYykpiLXyqiTKM</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2527375629</pqid></control><display><type>article</type><title>Parity Quantum Optimization: Benchmarks</title><source>arXiv.org</source><source>Free E- Journals</source><creator>Fellner, Michael ; Kilian Ender ; Roeland ter Hoeven ; Lechner, Wolfgang</creator><creatorcontrib>Fellner, Michael ; Kilian Ender ; Roeland ter Hoeven ; Lechner, Wolfgang</creatorcontrib><description>We present benchmarks of the parity transformation for the Quantum Approximate Optimization Algorithm (QAOA). We analyse the gate resources required to implement a single QAOA cycle for real-world scenarios. In particular, we consider random spin models with higher order terms, as well as the problems of predicting financial crashes and finding the ground states of electronic structure Hamiltonians. For the spin models studied our findings imply a significant advantage of the parity mapping compared to the standard gate model. In combination with full parallelizability of gates this has the potential to boost the race for demonstrating quantum advantage.</description><identifier>EISSN: 2331-8422</identifier><identifier>DOI: 10.48550/arxiv.2105.06240</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Benchmarks ; Crashes ; Electron spin ; Electronic structure ; Optimization ; Parallel processing ; Physics - Quantum Physics</subject><ispartof>arXiv.org, 2023-03</ispartof><rights>2023. 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><rights>http://creativecommons.org/licenses/by/4.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,780,784,885,27924</link.rule.ids><backlink>$$Uhttps://doi.org/10.48550/arXiv.2105.06240$$DView paper in arXiv$$Hfree_for_read</backlink><backlink>$$Uhttps://doi.org/10.22331/q-2023-03-17-952$$DView published paper (Access to full text may be restricted)$$Hfree_for_read</backlink></links><search><creatorcontrib>Fellner, Michael</creatorcontrib><creatorcontrib>Kilian Ender</creatorcontrib><creatorcontrib>Roeland ter Hoeven</creatorcontrib><creatorcontrib>Lechner, Wolfgang</creatorcontrib><title>Parity Quantum Optimization: Benchmarks</title><title>arXiv.org</title><description>We present benchmarks of the parity transformation for the Quantum Approximate Optimization Algorithm (QAOA). We analyse the gate resources required to implement a single QAOA cycle for real-world scenarios. In particular, we consider random spin models with higher order terms, as well as the problems of predicting financial crashes and finding the ground states of electronic structure Hamiltonians. For the spin models studied our findings imply a significant advantage of the parity mapping compared to the standard gate model. In combination with full parallelizability of gates this has the potential to boost the race for demonstrating quantum advantage.</description><subject>Algorithms</subject><subject>Benchmarks</subject><subject>Crashes</subject><subject>Electron spin</subject><subject>Electronic structure</subject><subject>Optimization</subject><subject>Parallel processing</subject><subject>Physics - Quantum Physics</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><sourceid>GOX</sourceid><recordid>eNotj09Lw0AUxBdBsNR-AE8GPHhKfPs2b7PxpsWqUKhC72E32eBW88fdRKyf3th6mjkMM_Nj7IJDkioiuNH-230lyIESkJjCCZuhEDxWKeIZW4SwAwCUGRKJGbt-0d4N--h11O0wNtGmH1zjfvTguvY2urdt-dZo_x7O2WmtP4Jd_OucbVcP2-VTvN48Pi_v1rHOCeIqrWoqja1ELmplVIY4eYOmzJUx0vLaklG6BlmBNapUnLgBzFOhrTRciTm7PNYeKIreu2l9X_zRFAeaKXF1TPS--xxtGIpdN_p2-lQgYSYykpiLXyqiTKM</recordid><startdate>20230308</startdate><enddate>20230308</enddate><creator>Fellner, Michael</creator><creator>Kilian Ender</creator><creator>Roeland ter Hoeven</creator><creator>Lechner, Wolfgang</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>PTHSS</scope><scope>GOX</scope></search><sort><creationdate>20230308</creationdate><title>Parity Quantum Optimization: Benchmarks</title><author>Fellner, Michael ; Kilian Ender ; Roeland ter Hoeven ; Lechner, Wolfgang</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a950-d4df5cbed393f8b8722ed3b2bc98bb6e1fe5b8af06d0eb8c8151b02943ae6b183</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Algorithms</topic><topic>Benchmarks</topic><topic>Crashes</topic><topic>Electron spin</topic><topic>Electronic structure</topic><topic>Optimization</topic><topic>Parallel processing</topic><topic>Physics - Quantum Physics</topic><toplevel>online_resources</toplevel><creatorcontrib>Fellner, Michael</creatorcontrib><creatorcontrib>Kilian Ender</creatorcontrib><creatorcontrib>Roeland ter Hoeven</creatorcontrib><creatorcontrib>Lechner, Wolfgang</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & 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 (Proquest) (PQ_SDU_P3)</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Publicly Available Content Database</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>Engineering Collection</collection><collection>arXiv.org</collection><jtitle>arXiv.org</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Fellner, Michael</au><au>Kilian Ender</au><au>Roeland ter Hoeven</au><au>Lechner, Wolfgang</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Parity Quantum Optimization: Benchmarks</atitle><jtitle>arXiv.org</jtitle><date>2023-03-08</date><risdate>2023</risdate><eissn>2331-8422</eissn><abstract>We present benchmarks of the parity transformation for the Quantum Approximate Optimization Algorithm (QAOA). We analyse the gate resources required to implement a single QAOA cycle for real-world scenarios. In particular, we consider random spin models with higher order terms, as well as the problems of predicting financial crashes and finding the ground states of electronic structure Hamiltonians. For the spin models studied our findings imply a significant advantage of the parity mapping compared to the standard gate model. In combination with full parallelizability of gates this has the potential to boost the race for demonstrating quantum advantage.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><doi>10.48550/arxiv.2105.06240</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | EISSN: 2331-8422 |
| ispartof | arXiv.org, 2023-03 |
| issn | 2331-8422 |
| language | eng |
| recordid | cdi_arxiv_primary_2105_06240 |
| source | arXiv.org; Free E- Journals |
| subjects | Algorithms Benchmarks Crashes Electron spin Electronic structure Optimization Parallel processing Physics - Quantum Physics |
| title | Parity Quantum Optimization: Benchmarks |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-10T16%3A37%3A17IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_arxiv&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Parity%20Quantum%20Optimization:%20Benchmarks&rft.jtitle=arXiv.org&rft.au=Fellner,%20Michael&rft.date=2023-03-08&rft.eissn=2331-8422&rft_id=info:doi/10.48550/arxiv.2105.06240&rft_dat=%3Cproquest_arxiv%3E2527375629%3C/proquest_arxiv%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2527375629&rft_id=info:pmid/&rfr_iscdi=true |