Lower Bounds on Quantum Annealing Times
The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result,...
Gespeichert in:
| Veröffentlicht in: | Physical review letters 2023-04, Vol.130 (14), p.140601, Article 140601 |
|---|---|
| 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 | 14 |
| container_start_page | 140601 |
| container_title | Physical review letters |
| container_volume | 130 |
| creator | García-Pintos, Luis Pedro Brady, Lucas T Bringewatt, Jacob Liu, Yi-Kai |
| description | The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource. |
| doi_str_mv | 10.1103/PhysRevLett.130.140601 |
| format | Article |
| fullrecord | <record><control><sourceid>proquest_osti_</sourceid><recordid>TN_cdi_osti_scitechconnect_2008288</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2805033165</sourcerecordid><originalsourceid>FETCH-LOGICAL-c338t-570b30f4ba4d077916e2be5e8071d7afe3671531b4585ace26846c9db773f5033</originalsourceid><addsrcrecordid>eNpNkF1LwzAUhoMobk7_wije6E3nSZM26eUcfkHBD-Z1SNNTV2mb2aTK_r0dVfHqwOF533N4CJlTWFAK7Opps3Mv-Jmh9wvKhiWHBOgBmVIQaSgo5YdkCsBomAKICTlx7h0AaJTIYzJhAiTnXE7JRWa_sAuubd8WLrBt8Nzr1vdNsGxb1HXVvgXrqkF3So5KXTs8-5kz8np7s17dh9nj3cNqmYWGMenDWEDOoOS55gUIkdIEoxxjlCBoIXSJLBE0ZjTnsYy1weEdnpi0yIVgZQyMzcj52Gudr5QzlUezMXZ4xngVAchIygG6HKFtZz96dF41lTNY17pF2zsVSdh30SQe0GRETWed67BU265qdLdTFNTepPpnUg0m1WhyCM5_bvR5g8Vf7Fcd-wYmCm89</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2805033165</pqid></control><display><type>article</type><title>Lower Bounds on Quantum Annealing Times</title><source>American Physical Society Journals</source><source>Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals</source><creator>García-Pintos, Luis Pedro ; Brady, Lucas T ; Bringewatt, Jacob ; Liu, Yi-Kai</creator><creatorcontrib>García-Pintos, Luis Pedro ; Brady, Lucas T ; Bringewatt, Jacob ; Liu, Yi-Kai ; Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)</creatorcontrib><description>The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.</description><identifier>ISSN: 0031-9007</identifier><identifier>ISSN: 1079-7114</identifier><identifier>EISSN: 1079-7114</identifier><identifier>DOI: 10.1103/PhysRevLett.130.140601</identifier><identifier>PMID: 37084448</identifier><language>eng</language><publisher>United States: American Physical Society (APS)</publisher><subject>Adiabatic quantum optimization ; CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS ; Quantum algorithms ; Quantum computation ; Quantum Information, Science & Technology</subject><ispartof>Physical review letters, 2023-04, Vol.130 (14), p.140601, Article 140601</ispartof><lds50>peer_reviewed</lds50><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c338t-570b30f4ba4d077916e2be5e8071d7afe3671531b4585ace26846c9db773f5033</citedby><cites>FETCH-LOGICAL-c338t-570b30f4ba4d077916e2be5e8071d7afe3671531b4585ace26846c9db773f5033</cites><orcidid>0000-0003-2075-4996 ; 0000-0003-3235-3444 ; 0000-0001-7458-4721 ; 0000000174584721 ; 0000000320754996 ; 0000000332353444</orcidid></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>230,314,780,784,885,2876,2877,27924,27925</link.rule.ids><backlink>$$Uhttps://www.ncbi.nlm.nih.gov/pubmed/37084448$$D View this record in MEDLINE/PubMed$$Hfree_for_read</backlink><backlink>$$Uhttps://www.osti.gov/servlets/purl/2008288$$D View this record in Osti.gov$$Hfree_for_read</backlink></links><search><creatorcontrib>García-Pintos, Luis Pedro</creatorcontrib><creatorcontrib>Brady, Lucas T</creatorcontrib><creatorcontrib>Bringewatt, Jacob</creatorcontrib><creatorcontrib>Liu, Yi-Kai</creatorcontrib><creatorcontrib>Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)</creatorcontrib><title>Lower Bounds on Quantum Annealing Times</title><title>Physical review letters</title><addtitle>Phys Rev Lett</addtitle><description>The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.</description><subject>Adiabatic quantum optimization</subject><subject>CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS</subject><subject>Quantum algorithms</subject><subject>Quantum computation</subject><subject>Quantum Information, Science & Technology</subject><issn>0031-9007</issn><issn>1079-7114</issn><issn>1079-7114</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2023</creationdate><recordtype>article</recordtype><recordid>eNpNkF1LwzAUhoMobk7_wije6E3nSZM26eUcfkHBD-Z1SNNTV2mb2aTK_r0dVfHqwOF533N4CJlTWFAK7Opps3Mv-Jmh9wvKhiWHBOgBmVIQaSgo5YdkCsBomAKICTlx7h0AaJTIYzJhAiTnXE7JRWa_sAuubd8WLrBt8Nzr1vdNsGxb1HXVvgXrqkF3So5KXTs8-5kz8np7s17dh9nj3cNqmYWGMenDWEDOoOS55gUIkdIEoxxjlCBoIXSJLBE0ZjTnsYy1weEdnpi0yIVgZQyMzcj52Gudr5QzlUezMXZ4xngVAchIygG6HKFtZz96dF41lTNY17pF2zsVSdh30SQe0GRETWed67BU265qdLdTFNTepPpnUg0m1WhyCM5_bvR5g8Vf7Fcd-wYmCm89</recordid><startdate>20230407</startdate><enddate>20230407</enddate><creator>García-Pintos, Luis Pedro</creator><creator>Brady, Lucas T</creator><creator>Bringewatt, Jacob</creator><creator>Liu, Yi-Kai</creator><general>American Physical Society (APS)</general><scope>NPM</scope><scope>AAYXX</scope><scope>CITATION</scope><scope>7X8</scope><scope>OIOZB</scope><scope>OTOTI</scope><orcidid>https://orcid.org/0000-0003-2075-4996</orcidid><orcidid>https://orcid.org/0000-0003-3235-3444</orcidid><orcidid>https://orcid.org/0000-0001-7458-4721</orcidid><orcidid>https://orcid.org/0000000174584721</orcidid><orcidid>https://orcid.org/0000000320754996</orcidid><orcidid>https://orcid.org/0000000332353444</orcidid></search><sort><creationdate>20230407</creationdate><title>Lower Bounds on Quantum Annealing Times</title><author>García-Pintos, Luis Pedro ; Brady, Lucas T ; Bringewatt, Jacob ; Liu, Yi-Kai</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c338t-570b30f4ba4d077916e2be5e8071d7afe3671531b4585ace26846c9db773f5033</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2023</creationdate><topic>Adiabatic quantum optimization</topic><topic>CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS</topic><topic>Quantum algorithms</topic><topic>Quantum computation</topic><topic>Quantum Information, Science & Technology</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>García-Pintos, Luis Pedro</creatorcontrib><creatorcontrib>Brady, Lucas T</creatorcontrib><creatorcontrib>Bringewatt, Jacob</creatorcontrib><creatorcontrib>Liu, Yi-Kai</creatorcontrib><creatorcontrib>Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)</creatorcontrib><collection>PubMed</collection><collection>CrossRef</collection><collection>MEDLINE - Academic</collection><collection>OSTI.GOV - Hybrid</collection><collection>OSTI.GOV</collection><jtitle>Physical review letters</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>García-Pintos, Luis Pedro</au><au>Brady, Lucas T</au><au>Bringewatt, Jacob</au><au>Liu, Yi-Kai</au><aucorp>Los Alamos National Laboratory (LANL), Los Alamos, NM (United States)</aucorp><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Lower Bounds on Quantum Annealing Times</atitle><jtitle>Physical review letters</jtitle><addtitle>Phys Rev Lett</addtitle><date>2023-04-07</date><risdate>2023</risdate><volume>130</volume><issue>14</issue><spage>140601</spage><pages>140601-</pages><artnum>140601</artnum><issn>0031-9007</issn><issn>1079-7114</issn><eissn>1079-7114</eissn><abstract>The adiabatic theorem provides sufficient conditions for the time needed to prepare a target ground state. While it is possible to prepare a target state much faster with more general quantum annealing protocols, rigorous results beyond the adiabatic regime are rare. Here, we provide such a result, deriving lower bounds on the time needed to successfully perform quantum annealing. The bounds are asymptotically saturated by three toy models where fast annealing schedules are known: the Roland and Cerf unstructured search model, the Hamming spike problem, and the ferromagnetic p-spin model. Our bounds demonstrate that these schedules have optimal scaling. Our results also show that rapid annealing requires coherent superpositions of energy eigenstates, singling out quantum coherence as a computational resource.</abstract><cop>United States</cop><pub>American Physical Society (APS)</pub><pmid>37084448</pmid><doi>10.1103/PhysRevLett.130.140601</doi><orcidid>https://orcid.org/0000-0003-2075-4996</orcidid><orcidid>https://orcid.org/0000-0003-3235-3444</orcidid><orcidid>https://orcid.org/0000-0001-7458-4721</orcidid><orcidid>https://orcid.org/0000000174584721</orcidid><orcidid>https://orcid.org/0000000320754996</orcidid><orcidid>https://orcid.org/0000000332353444</orcidid><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext |
| identifier | ISSN: 0031-9007 |
| ispartof | Physical review letters, 2023-04, Vol.130 (14), p.140601, Article 140601 |
| issn | 0031-9007 1079-7114 1079-7114 |
| language | eng |
| recordid | cdi_osti_scitechconnect_2008288 |
| source | American Physical Society Journals; Elektronische Zeitschriftenbibliothek - Frei zugängliche E-Journals |
| subjects | Adiabatic quantum optimization CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS Quantum algorithms Quantum computation Quantum Information, Science & Technology |
| title | Lower Bounds on Quantum Annealing Times |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-06T19%3A55%3A28IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_osti_&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Lower%20Bounds%20on%20Quantum%20Annealing%20Times&rft.jtitle=Physical%20review%20letters&rft.au=Garc%C3%ADa-Pintos,%20Luis%20Pedro&rft.aucorp=Los%20Alamos%20National%20Laboratory%20(LANL),%20Los%20Alamos,%20NM%20(United%20States)&rft.date=2023-04-07&rft.volume=130&rft.issue=14&rft.spage=140601&rft.pages=140601-&rft.artnum=140601&rft.issn=0031-9007&rft.eissn=1079-7114&rft_id=info:doi/10.1103/PhysRevLett.130.140601&rft_dat=%3Cproquest_osti_%3E2805033165%3C/proquest_osti_%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2805033165&rft_id=info:pmid/37084448&rfr_iscdi=true |