{"id":"https://openalex.org/W7214744131","doi":"https://doi.org/10.48550/arxiv.2609.35131","title":"The Overlap Gap Property: Separating Quantum and Quantum-Inspired Approximate Optimization Algorithms","display_name":"The Overlap Gap Property: Separating Quantum and Quantum-Inspired Approximate Optimization Algorithms","publication_year":2026,"publication_date":"2026-09-28","ids":{"openalex":"https://openalex.org/W7214744131","doi":"https://doi.org/10.48550/arxiv.2609.35131"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.35131","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.35131","pdf_url":"https://arxiv.org/pdf/2609.35131","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"},"volume":null,"type":"preprint","is_traditional":true,"indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2609.35131","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133804698","display_name":"Mark Goh","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I180923762","display_name":"University of Cologne","ror":"https://ror.org/00rcxh774","country_code":"DE","type":"education","lineage":["https://openalex.org/I180923762"]},{"id":"https://openalex.org/I2898391981","display_name":"Deutsches Zentrum f\u00fcr Luft- und Raumfahrt e. V. (DLR)","ror":"https://ror.org/04bwf3e34","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I2898391981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Goh, Mark","raw_affiliation_strings":["Institute for Frontier Materials on Earth and in Space , German Aerospace Center","Institute for Theoretical Physics , University of Cologne"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute for Frontier Materials on Earth and in Space , German Aerospace Center","institution_ids":["https://openalex.org/I2898391981"]},{"raw_affiliation_string":"Institute for Theoretical Physics , University of Cologne","institution_ids":["https://openalex.org/I180923762"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089061845","display_name":"Thorge M\u00fcller","orcid":"https://orcid.org/0009-0000-9561-5945","observed_orcids":["https://orcid.org/0009-0000-9561-5945"]},"institutions":[{"id":"https://openalex.org/I2898391981","display_name":"Deutsches Zentrum f\u00fcr Luft- und Raumfahrt e. V. (DLR)","ror":"https://ror.org/04bwf3e34","country_code":"DE","type":"facility","lineage":["https://openalex.org/I1305996414","https://openalex.org/I2898391981"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"M\u00fcller, Thorge","raw_affiliation_strings":["Institute of Software Technology , German Aerospace Center"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Software Technology , German Aerospace Center","institution_ids":["https://openalex.org/I2898391981"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9994999766349792,"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.9994999766349792,"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/T11804","display_name":"Quantum many-body systems","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/3107","display_name":"Atomic and Molecular Physics, and Optics"},"field":{"id":"https://openalex.org/fields/31","display_name":"Physics and Astronomy"},"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/overlap-gap-property","display_name":"overlap gap property","score":0.8640000224113464},{"id":"https://openalex.org/keywords/quantum-approximate-optimization-algorithm","display_name":"quantum approximate optimization algorithm","score":0.8420000076293945},{"id":"https://openalex.org/keywords/approximate-message-passing","display_name":"approximate message passing","score":0.9300000071525574},{"id":"https://openalex.org/keywords/finite-size-scaling","display_name":"finite-size scaling","score":0.8550000190734863},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.7509999871253967}],"concepts":[{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.6473000049591064},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5649999976158142},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.5149999856948853},{"id":"https://openalex.org/C109663097","wikidata":"https://www.wikidata.org/wiki/Q182453","display_name":"Adiabatic process","level":2,"score":0.5134000182151794},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4934999942779541},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.491100013256073},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4643000066280365},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.462799996137619},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.4239000082015991},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.36959999799728394},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.3472000062465668},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3463999927043915},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.33869999647140503},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.33559998869895935},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3188999891281128},{"id":"https://openalex.org/C192353077","wikidata":"https://www.wikidata.org/wiki/Q4682635","display_name":"Adiabatic quantum computation","level":4,"score":0.31790000200271606},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.3066999912261963},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.289900004863739},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.2793999910354614},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2621000111103058}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.35131","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.35131","pdf_url":"https://arxiv.org/pdf/2609.35131","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":"doi:10.48550/arxiv.2609.35131","doi":"https://doi.org/10.48550/arxiv.2609.35131","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.35131","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":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2609.35131","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.35131","pdf_url":"https://arxiv.org/pdf/2609.35131","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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7214744131.pdf","grobid_xml":"https://content.openalex.org/works/W7214744131.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1568345435","https://openalex.org/W1980276492","https://openalex.org/W1990755770","https://openalex.org/W2738325034","https://openalex.org/W2903058119","https://openalex.org/W2982169647","https://openalex.org/W2987043130","https://openalex.org/W2997163556","https://openalex.org/W3016618834","https://openalex.org/W3107868845","https://openalex.org/W3195429828","https://openalex.org/W3202733572","https://openalex.org/W4226429218","https://openalex.org/W4361807527","https://openalex.org/W4385520956","https://openalex.org/W4386692386","https://openalex.org/W4387355618","https://openalex.org/W4399118343","https://openalex.org/W4402412287","https://openalex.org/W4404360845","https://openalex.org/W4410497496","https://openalex.org/W4415408356","https://openalex.org/W4416824468","https://openalex.org/W7154263041","https://openalex.org/W7161296429"],"related_works":["https://openalex.org/W7165823188","https://openalex.org/W6908849832","https://openalex.org/W4413413643","https://openalex.org/W3034708880","https://openalex.org/W2903058119","https://openalex.org/W7110616653","https://openalex.org/W7139791625","https://openalex.org/W2955435611","https://openalex.org/W3043665205","https://openalex.org/W3196844582"],"abstract_inverted_index":{"In":[0,132],"this":[1,41,91],"paper,":[2],"we":[3,134],"prove":[4],"that":[5,68,104,110],"the":[6,17,34,44,62,71,78,82,95,98,106,111,117,140,143,147,151],"Mean-Field":[7],"Approximate":[8,19,48],"Optimization":[9,20],"Algorithm":[10,21],"(MF-AOA),":[11],"a":[12,125,128,136,160],"quantum-inspired":[13],"classical":[14],"algorithm":[15],"of":[16,97,102,142],"Quantum":[18],"(QAOA),":[22],"is":[23,113],"unable":[24],"to":[25,46,56,115,159],"give":[26],"arbitrary":[27],"near":[28,145],"optimal":[29,152],"solution":[30],"for":[31],"problems":[32,69],"exhibiting":[33,70],"Overlap":[35],"Gap":[36],"Property":[37],"(OGP).":[38],"We":[39,89],"show":[40],"by":[42,61,92,146],"relating":[43],"MF-AOA":[45,83],"finite-memory":[47],"Message":[49],"Passing":[50],"(AMP)":[51],"algorithms,":[52],"which":[53],"are":[54,73],"known":[55],"be":[57],"limited":[58],"in":[59,87,139],"performance":[60,96,141],"OGP.":[63],"Thus,":[64],"our":[65,120],"paper":[66],"argues":[67],"OGP":[72,107,148],"one":[74],"such":[75],"instance":[76],"where":[77,150],"QAOA":[79,99,112,144,153],"can":[80],"outperform":[81],"and":[84,108],"AMP":[85],"algorithms":[86],"general.":[88],"supplement":[90],"numerically":[93],"simulating":[94],"on":[100],"instances":[101],"Max-$4$-XORSAT":[103],"exhibit":[105],"find":[109],"able":[114],"surpass":[116],"barrier,":[118,149],"while":[119],"finite-size":[121],"scaling":[122],"analysis":[123],"favors":[124],"super-polynomial":[126],"over":[127],"polynomial":[129],"depth":[130],"dependence.":[131],"addition,":[133],"observe":[135],"non-differentiable":[137],"point":[138],"parameters":[154],"change":[155],"from":[156],"an":[157],"adiabatic":[158],"non-adiabatic":[161],"schedule.":[162]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-30T00:00:00"}