{"id":"https://openalex.org/W7202349123","doi":"https://doi.org/10.48550/arxiv.2608.11385","title":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","display_name":"Evaluating QAOA expectation values can be as hard as counting optimal solutions","publication_year":2026,"publication_date":"2026-08-11","ids":{"openalex":"https://openalex.org/W7202349123","doi":"https://doi.org/10.48550/arxiv.2608.11385"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2608.11385","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.11385","pdf_url":"https://arxiv.org/pdf/2608.11385","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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/2608.11385","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5076190671","display_name":"Stuart Hadfield","orcid":"https://orcid.org/0000-0002-4607-3921","observed_orcids":["https://orcid.org/0000-0002-4607-3921"]},"institutions":[{"id":"https://openalex.org/I1280536761","display_name":"Ames Research Center","ror":"https://ror.org/02acart68","country_code":"US","type":"facility","lineage":["https://openalex.org/I1280536761","https://openalex.org/I4210124779"]},{"id":"https://openalex.org/I143663144","display_name":"Research Institute for Advanced Computer Science","ror":"https://ror.org/022qmyy53","country_code":"US","type":"facility","lineage":["https://openalex.org/I1329765538","https://openalex.org/I143663144"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hadfield, Stuart","raw_affiliation_strings":["Quantum Artificial Intelligence Laboratory (QuAIL) , NASA Ames Research Center , Moffett Field , CA 94035 , USA","USRA Research Institute for Advanced Computer Science , Mountain View , CA 94043 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Quantum Artificial Intelligence Laboratory (QuAIL) , NASA Ames Research Center , Moffett Field , CA 94035 , USA","institution_ids":["https://openalex.org/I1280536761"]},{"raw_affiliation_string":"USRA Research Institute for Advanced Computer Science , Mountain View , CA 94043 , USA","institution_ids":["https://openalex.org/I143663144"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5076190671"],"corresponding_institution_ids":["https://openalex.org/I1280536761","https://openalex.org/I143663144"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":3,"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":1.0,"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":1.0,"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/T11804","display_name":"Quantum many-body systems","score":0.0,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/quantum-approximate-optimization-algorithm","display_name":"quantum approximate optimization algorithm","score":0.9909999966621399},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.7540000081062317},{"id":"https://openalex.org/keywords/p-hardness","display_name":"#P-hardness","score":0.75},{"id":"https://openalex.org/keywords/variational-quantum-algorithms","display_name":"variational quantum algorithms","score":0.7710000276565552},{"id":"https://openalex.org/keywords/laurent-polynomials","display_name":"Laurent polynomials","score":0.6499999761581421},{"id":"https://openalex.org/keywords/gradient-and-hessian-computation","display_name":"gradient and Hessian computation","score":0.6759999990463257}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.7766000032424927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7419999837875366},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.5957000255584717},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.505299985408783},{"id":"https://openalex.org/C167729594","wikidata":"https://www.wikidata.org/wiki/Q17736","display_name":"Axiom","level":2,"score":0.4708000123500824},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.46869999170303345},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.4262000024318695},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.3840999901294708},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3716000020503998},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3668999969959259},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.36629998683929443},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.36059999465942383},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.34619998931884766},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.34220001101493835},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.32690000534057617},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.3221000134944916},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.32019999623298645},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.31029999256134033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2930000126361847},{"id":"https://openalex.org/C141042865","wikidata":"https://www.wikidata.org/wiki/Q200125","display_name":"Expected value","level":2,"score":0.29260000586509705},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2872999906539917},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2858999967575073},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.274399995803833},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.27219998836517334},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2711000144481659},{"id":"https://openalex.org/C46274116","wikidata":"https://www.wikidata.org/wiki/Q185521","display_name":"Truth value","level":2,"score":0.26440000534057617},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2608.11385","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.11385","pdf_url":"https://arxiv.org/pdf/2608.11385","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2608.11385","doi":"https://doi.org/10.48550/arxiv.2608.11385","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2608.11385","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2608.11385","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2608.11385","pdf_url":"https://arxiv.org/pdf/2608.11385","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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/G4782275651","display_name":null,"funder_award_id":"80ARC020D0010","funder_id":"https://openalex.org/F4320332374","funder_display_name":"Ames Research Center"},{"id":"https://openalex.org/G4850096730","display_name":null,"funder_award_id":"80ARC020D0010","funder_id":"https://openalex.org/F4320306101","funder_display_name":"National Aeronautics and Space Administration"},{"id":"https://openalex.org/G6986072231","display_name":null,"funder_award_id":"89243024SSC000129","funder_id":"https://openalex.org/F4320306084","funder_display_name":"U.S. Department of Energy"}],"funders":[{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320306101","display_name":"National Aeronautics and Space Administration","ror":"https://ror.org/027ka1x80"},{"id":"https://openalex.org/F4320332359","display_name":"Office of Science","ror":"https://ror.org/00mmn6b08"},{"id":"https://openalex.org/F4320332374","display_name":"Ames Research Center","ror":"https://ror.org/02acart68"},{"id":"https://openalex.org/F4320337506","display_name":"Advanced Scientific Computing Research","ror":"https://ror.org/0012c7r22"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7202349123.pdf","grobid_xml":"https://content.openalex.org/works/W7202349123.grobid-xml"},"referenced_works_count":15,"referenced_works":["https://openalex.org/W1568345435","https://openalex.org/W1752349928","https://openalex.org/W2297565774","https://openalex.org/W2982304552","https://openalex.org/W2998250124","https://openalex.org/W3171066440","https://openalex.org/W4282944086","https://openalex.org/W4286898945","https://openalex.org/W4414565617","https://openalex.org/W6891893723","https://openalex.org/W7106787421","https://openalex.org/W7162117654","https://openalex.org/W7166675992","https://openalex.org/W7166702155","https://openalex.org/W7222966301"],"related_works":["https://openalex.org/W7106787421","https://openalex.org/W7171085191","https://openalex.org/W7139791625","https://openalex.org/W2901444101","https://openalex.org/W4399286793","https://openalex.org/W3202328061","https://openalex.org/W4390832340","https://openalex.org/W2962767882","https://openalex.org/W4286898945","https://openalex.org/W7169810873"],"abstract_inverted_index":{"Evaluating":[0],"expectation":[1,83,177],"values":[2],"is":[3,86,97,185],"a":[4,142,147,154],"critical":[5],"task":[6,44],"for":[7,31,50,63,75,102,114,211],"variational":[8],"quantum":[9,12,17],"eigensolvers,":[10],"parameterized":[11],"circuits,":[13],"and":[14,149,214],"many":[15],"other":[16],"algorithms.":[18],"We":[19,69],"consider":[20],"the":[21,25,32,124,133,138,158,167,175],"well-studied":[22],"case":[23],"of":[24,37,118,127,141,161,196,216],"Quantum":[26],"Approximate":[27],"Optimization":[28],"Algorithm":[29],"(QAOA)":[30],"MaxCut":[33],"problem.":[34],"Recent":[35],"work":[36],"Wang":[38,128],"et":[39,129],"al.":[40,130],"[arXiv:2511.20212]":[41],"showed":[42],"this":[43,71],"to":[45,99,157,166,183,190,194],"be":[46],"NP-hard":[47],"in":[48,164],"general":[49],"any":[51],"QAOA":[52,143,176,217],"depth":[53],"$p\\geq":[54,76,95],"2$,":[55],"complementing":[56],"past":[57],"results":[58,206,210],"showing":[59,73],"efficiently":[60],"computable":[61],"formulas":[62],"$p=1$":[64,182],"with":[65],"arbitrary":[66],"problem":[67],"graphs.":[68],"sharpen":[70],"dichotomy":[72],"that":[74,131,152,174,195],"2$":[77,96],"exact":[78],"or":[79],"exponentially":[80],"precise":[81],"cost":[82],"value":[84,136,155,178],"evaluation":[85],"#P-hard":[87],"under":[88],"deterministic":[89],"polynomial-time":[90],"Turing":[91],"reductions.":[92],"Hardness":[93],"at":[94],"shown":[98],"remain":[100],"even":[101],"evaluating":[103],"single":[104],"pairwise":[105],"correlators":[106],"$\\langle":[107],"Z\\otimes":[108],"Z\\rangle":[109],"$,":[110],"as":[111,113],"well":[112],"highly":[115],"restricted":[116],"sets":[117],"algorithm":[119],"parameters.":[120],"Our":[121],"proof":[122],"refines":[123],"NP-hardness":[125],"construction":[126,151],"recovers":[132],"maximum":[134,162],"cut":[135,169],"from":[137,181,188],"largest":[139],"exponent":[140],"Laurent":[144],"polynomial,":[145],"utilizing":[146],"distinct":[148],"simpler":[150],"extracts":[153],"proportional":[156],"total":[159],"number":[160],"cuts,":[163],"addition":[165],"optimal":[168,198],"value.":[170],"Thus":[171],"we":[172,203],"show":[173,204],"hardness":[179,209],"transition":[180],"$p=2$":[184],"not":[186],"only":[187],"tractability":[189],"optimization":[191],"hardness,":[192],"but":[193],"counting":[197],"solutions.":[199],"As":[200],"an":[201],"application":[202],"our":[205],"imply":[207],"analogous":[208],"computing":[212],"gradients":[213],"Hessians":[215],"circuits.":[218]},"counts_by_year":[{"year":2026,"cited_by_count":3}],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-08-14T00:00:00"}