{"id":"https://openalex.org/W2238514032","doi":"https://doi.org/10.1109/focs.2016.81","title":"Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing","display_name":"Simulated Quantum Annealing Can Be Exponentially Faster Than Classical Simulated Annealing","publication_year":2016,"publication_date":"2016-10-01","ids":{"openalex":"https://openalex.org/W2238514032","doi":"https://doi.org/10.1109/focs.2016.81","mag":"2238514032"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2016.81","doi":"https://doi.org/10.1109/focs.2016.81","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2016.81","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1601.03030","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Elizabeth Crosson","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I122411786","display_name":"California Institute of Technology","ror":"https://ror.org/05dxps055","country_code":"US","type":"education","lineage":["https://openalex.org/I122411786"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Elizabeth Crosson","raw_affiliation_strings":["Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Quantum Information and Matter, California Institute of Technology, Pasadena, CA, USA","institution_ids":["https://openalex.org/I122411786"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008766821","display_name":"Aram W. Harrow","orcid":"https://orcid.org/0000-0003-3220-7682","observed_orcids":["https://orcid.org/0000-0003-3220-7682"]},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aram W. Harrow","raw_affiliation_strings":["Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.2015,"has_fulltext":true,"cited_by_count":124,"citation_normalized_percentile":{"value":0.97049159,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":93,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"714","last_page":"723"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simulated-quantum-annealing","display_name":"simulated quantum annealing","score":0.949999988079071},{"id":"https://openalex.org/keywords/quantum-annealing","display_name":"quantum annealing","score":0.8159999847412109},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"simulated annealing","score":0.9810000061988831},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7649999856948853},{"id":"https://openalex.org/keywords/tunneling","display_name":"tunneling","score":0.5870000123977661},{"id":"https://openalex.org/keywords/quantum-advantage","display_name":"quantum advantage","score":0.6480000019073486},{"id":"https://openalex.org/keywords/markov-chain-mixing-time","display_name":"Markov chain mixing time","score":0.7409999966621399},{"id":"https://openalex.org/keywords/warm-start","display_name":"warm start","score":0.6029999852180481},{"id":"https://openalex.org/keywords/local-minima","display_name":"local minima","score":0.6359999775886536}],"concepts":[{"id":"https://openalex.org/C90408235","wikidata":"https://www.wikidata.org/wiki/Q938141","display_name":"Quantum annealing","level":4,"score":0.9283999800682068},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6381000280380249},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.6151000261306763},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.574400007724762},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5656999945640564},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.49070000648498535},{"id":"https://openalex.org/C186633575","wikidata":"https://www.wikidata.org/wiki/Q845060","display_name":"Maxima and minima","level":2,"score":0.48420000076293945},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.47029998898506165},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.44769999384880066},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.42739999294281006},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.42329999804496765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3921000063419342},{"id":"https://openalex.org/C85384003","wikidata":"https://www.wikidata.org/wiki/Q5421525","display_name":"Exponential polynomial","level":3,"score":0.36329999566078186},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.36320000886917114},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.3531999886035919},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.35019999742507935},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.3379000127315521},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.33320000767707825},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.32440000772476196},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3165000081062317},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.30379998683929443},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.30219998955726624},{"id":"https://openalex.org/C134466208","wikidata":"https://www.wikidata.org/wiki/Q1520657","display_name":"Weight function","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.27900001406669617},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.27489998936653137},{"id":"https://openalex.org/C203087015","wikidata":"https://www.wikidata.org/wiki/Q378201","display_name":"Qubit","level":3,"score":0.274399995803833},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2563000023365021},{"id":"https://openalex.org/C63361517","wikidata":"https://www.wikidata.org/wiki/Q5645805","display_name":"Hamming weight","level":5,"score":0.25619998574256897}],"mesh":[],"locations_count":7,"locations":[{"id":"doi:10.1109/focs.2016.81","doi":"https://doi.org/10.1109/focs.2016.81","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2016.81","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1601.03030","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1601.03030","pdf_url":"https://arxiv.org/pdf/1601.03030","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:authors.library.caltech.edu:68611","doi":null,"is_oa":false,"landing_page_url":"https://resolver.caltech.edu/CaltechAUTHORS:20160622-152913947","pdf_url":null,"source":{"id":"https://openalex.org/S4306402161","display_name":"CaltechAUTHORS (California Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I122411786","host_organization_name":"California Institute of Technology","host_organization_lineage":["https://openalex.org/I122411786"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Book Section"},{"id":"pmh:oai:docs.lib.purdue.edu:nanopub-1432","doi":null,"is_oa":false,"landing_page_url":"https://docs.lib.purdue.edu/nanopub/416","pdf_url":null,"source":{"id":"https://openalex.org/S4377196310","display_name":"Purdue e-Pubs (Purdue University System)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801333002","host_organization_name":"Purdue University System","host_organization_lineage":["https://openalex.org/I2801333002"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Birck and NCN Publications","raw_type":"text"},{"id":"pmh:oai:dspace.mit.edu:1721.1/132114","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/132114","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"pmh:oai:dspace.mit.edu:1721.1/132114.2","doi":null,"is_oa":true,"landing_page_url":"https://hdl.handle.net/1721.1/132114.2","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"http://purl.org/eprint/type/ConferencePaper"},{"id":"doi:10.48550/arxiv.1601.03030","doi":"https://doi.org/10.48550/arxiv.1601.03030","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1601.03030","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1601.03030","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/1601.03030","pdf_url":"https://arxiv.org/pdf/1601.03030","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G2356925628","display_name":"CAREER: Applications of Quantum Information Theory","funder_award_id":"1452616","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2684148513","display_name":null,"funder_award_id":"12500028","funder_id":"https://openalex.org/F4320306202","funder_display_name":"Gordon and Betty Moore Foundation"},{"id":"https://openalex.org/G2894089465","display_name":null,"funder_award_id":"PHY-1125565","funder_id":"https://openalex.org/F4320306202","funder_display_name":"Gordon and Betty Moore Foundation"},{"id":"https://openalex.org/G3747832099","display_name":"Institute for Quantum Information and Matter (IQIM)","funder_award_id":"1125565","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5539695041","display_name":null,"funder_award_id":"W911NF-12-1-0486","funder_id":"https://openalex.org/F4320338281","funder_display_name":"Army Research Office"},{"id":"https://openalex.org/G7584904492","display_name":"AF: Large: Collaborative Research: Reliable Quantum Communication and Computation in the Presence of Noise","funder_award_id":"1111382","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8838030021","display_name":null,"funder_award_id":"PHY-1125565","funder_id":"https://openalex.org/F4320334224","funder_display_name":"Institute for Quantum Information and Matter, California Institute of Technology"},{"id":"https://openalex.org/G999948053","display_name":null,"funder_award_id":"GBMF-12500028","funder_id":"https://openalex.org/F4320306202","funder_display_name":"Gordon and Betty Moore Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306202","display_name":"Gordon and Betty Moore Foundation","ror":"https://ror.org/006wxqw41"},{"id":"https://openalex.org/F4320334224","display_name":"Institute for Quantum Information and Matter, California Institute of Technology","ror":null},{"id":"https://openalex.org/F4320338281","display_name":"Army Research Office","ror":"https://ror.org/05epdh915"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2238514032.pdf","grobid_xml":"https://content.openalex.org/works/W2238514032.grobid-xml"},"referenced_works_count":40,"referenced_works":["https://openalex.org/W54487369","https://openalex.org/W146400702","https://openalex.org/W226703363","https://openalex.org/W1494952201","https://openalex.org/W1507600087","https://openalex.org/W1553351496","https://openalex.org/W1600293573","https://openalex.org/W1650189925","https://openalex.org/W1965306250","https://openalex.org/W1983624953","https://openalex.org/W1990115083","https://openalex.org/W2033281046","https://openalex.org/W2040469943","https://openalex.org/W2040950981","https://openalex.org/W2059775326","https://openalex.org/W2094756709","https://openalex.org/W2103575329","https://openalex.org/W2107244022","https://openalex.org/W2110552005","https://openalex.org/W2117762142","https://openalex.org/W2118180752","https://openalex.org/W2139562712","https://openalex.org/W2166625314","https://openalex.org/W2191308561","https://openalex.org/W2212688111","https://openalex.org/W2224132980","https://openalex.org/W2230800425","https://openalex.org/W2239771382","https://openalex.org/W2246554861","https://openalex.org/W2286474142","https://openalex.org/W2295163528","https://openalex.org/W2296948686","https://openalex.org/W2512312062","https://openalex.org/W2949480312","https://openalex.org/W2952627047","https://openalex.org/W2953111444","https://openalex.org/W3022584652","https://openalex.org/W3104613635","https://openalex.org/W3215460652","https://openalex.org/W4290102584"],"related_works":["https://openalex.org/W3109360078","https://openalex.org/W2296948686","https://openalex.org/W4299894007","https://openalex.org/W2992146840","https://openalex.org/W2037354050","https://openalex.org/W6922659351","https://openalex.org/W1553351496","https://openalex.org/W1675927620","https://openalex.org/W2744642842","https://openalex.org/W2071410718"],"abstract_inverted_index":{"Can":[0],"quantum":[1,185,246,291],"computers":[2],"solve":[3],"optimization":[4,113],"problems":[5],"much":[6,214],"more":[7,36],"quickly":[8,37],"than":[9,38],"classical":[10,39,174,188],"computers?":[11],"One":[12,43],"major":[13],"piece":[14],"of":[15,31,87,103,106,167,215,244,284,305,310,313],"evidence":[16,240],"for":[17,125,259,281,288],"this":[18,88,126,232],"proposition":[19],"has":[20],"been":[21],"the":[22,29,48,58,65,70,84,104,138,207,216,242,255,265,290,296],"fact":[23],"that":[24,109,124,193,200],"Quantum":[25,179],"Annealing":[26,41,180],"(QA)":[27],"finds":[28],"minimum":[30,86],"some":[32],"cost":[33,45,89],"functions":[34],"exponentially":[35],"Simulated":[40,178],"(SA).":[42],"such":[44],"function":[46,55,67,90],"is":[47,60,68,97],"simple":[49],"\u201cHamming":[50],"weight":[51,81,209],"with":[52,149,210],"a":[53,74,99,173],"spike\u201d":[54],"in":[56,111,165,203,213,293,299,307,318],"which":[57,182],"input":[59],"an":[61,222],"n-bit":[62],"string":[63],"and":[64,121,132,137,152,287],"objective":[66],"simply":[69],"Hamming":[71,80,208],"weight,":[72],"plus":[73],"tall":[75],"thin":[76],"barrier":[77],"centered":[78],"around":[79],"n/4.":[82],"While":[83,227],"global":[85],"can":[91,236,271],"be":[92,163,237,272,304],"found":[93],"by":[94,118,143,274],"inspection,":[95],"it":[96,235],"also":[98,278],"plausible":[100],"toy":[101,233],"model":[102],"sort":[105],"local":[107],"minima":[108],"arise":[110],"realworld":[112],"problems.":[114],"It":[115],"was":[116,141],"shown":[117],"Farhi,":[119],"Goldstone":[120],"Gutmann":[122],"[1]":[123],"example":[127],"SA":[128],"takes":[129,134],"exponential":[130,223,245],"time":[131,205],"QA":[133,220,294],"polynomial":[135,204],"time,":[136],"same":[139],"result":[140],"generalized":[142],"Reichardt":[144],"[2]":[145],"to":[146,187,263,295],"include":[147,253],"barriers":[148],"width":[150],"n\u03b6":[151],"height":[153],"n\u03b1for":[154],"\u03b6":[155],"+":[156],"\u03b1":[157],"\u2264":[158],"1/2.":[159],"This":[160],"advantage":[161,224,283],"could":[162],"explained":[164],"terms":[166],"quantummechanical":[168],"\u201ctunneling.\u201d":[169],"Our":[170,250],"work":[171],"considers":[172],"algorithm":[175],"known":[176],"as":[177,239],"(SQA)":[181],"relates":[183],"certain":[184],"systems":[186],"Markov":[189,261,316],"chains.":[190],"By":[191],"proving":[192],"these":[194],"chains":[195,262,317],"mix":[196],"rapidly,":[197],"we":[198],"show":[199],"SQA":[201,311],"runs":[202],"on":[206],"spike":[211],"problem":[212],"parameter":[217],"regime":[218],"where":[219],"achieves":[221],"over":[225],"SA.":[226],"our":[228],"analysis":[229],"only":[230],"covers":[231],"model,":[234],"seen":[238],"against":[241],"prospect":[243],"speedup":[247],"using":[248],"tunneling.":[249],"technical":[251],"contributions":[252],"extending":[254],"canonical":[256],"path":[257],"method":[258],"analyzing":[260],"cover":[264],"case":[266],"when":[267],"not":[268],"all":[269],"vertices":[270],"connected":[273],"low-congestion":[275],"paths.":[276],"We":[277],"develop":[279],"methods":[280],"taking":[282],"warm":[285],"starts":[286],"relating":[289],"state":[292],"probability":[297],"distribution":[298],"SQA.":[300],"These":[301],"techniques":[302],"may":[303],"use":[306],"future":[308],"studies":[309],"or":[312],"rapidly":[314],"mixing":[315],"general.":[319]},"counts_by_year":[{"year":2026,"cited_by_count":11},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":15},{"year":2021,"cited_by_count":15},{"year":2020,"cited_by_count":14},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":11},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2016-06-24T00:00:00"}