{"id":"https://openalex.org/W7221065010","doi":"https://doi.org/10.48550/arxiv.2610.09584","title":"Quantum Approximation Complexity of Classical Optimization Problems","display_name":"Quantum Approximation Complexity of Classical Optimization Problems","publication_year":2026,"publication_date":"2026-10-07","ids":{"openalex":"https://openalex.org/W7221065010","doi":"https://doi.org/10.48550/arxiv.2610.09584"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.09584","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.09584","pdf_url":"https://arxiv.org/pdf/2610.09584","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/2610.09584","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/I1329765538","display_name":"Universities Space Research Association","ror":"https://ror.org/043pgqy52","country_code":"US","type":"nonprofit","lineage":["https://openalex.org/I1329765538"]},{"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":["USRA Research Institute for Advanced Computer Science , Mountain View , California 94043 , USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"USRA Research Institute for Advanced Computer Science , Mountain View , California 94043 , USA","institution_ids":["https://openalex.org/I1329765538","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/I1329765538","https://openalex.org/I143663144"],"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.9955999851226807,"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.9955999851226807,"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":0.0038999998942017555,"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/T10020","display_name":"Quantum Information and Cryptography","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"}}],"keywords":[{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"polynomial-time approximation scheme","score":0.6499999761581421},{"id":"https://openalex.org/keywords/fully-polynomial-time-approximation-scheme","display_name":"fully polynomial time approximation scheme","score":0.9470000267028809},{"id":"https://openalex.org/keywords/randomized-approximation","display_name":"randomized approximation","score":0.47099998593330383},{"id":"https://openalex.org/keywords/quantum-classical-separation","display_name":"quantum-classical separation","score":0.7739999890327454},{"id":"https://openalex.org/keywords/integer-factorization","display_name":"integer factorization","score":0.8600000143051147},{"id":"https://openalex.org/keywords/discrete-logarithm-problem","display_name":"discrete logarithm problem","score":0.847000002861023},{"id":"https://openalex.org/keywords/max-cut","display_name":"MaxCut","score":0.7429999709129333},{"id":"https://openalex.org/keywords/maxsat","display_name":"MaxSAT","score":0.9670000076293945}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.741100013256073},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6187000274658203},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5960000157356262},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.5703999996185303},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.42899999022483826},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.4287000000476837},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.42410001158714294},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4000999927520752},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.39430001378059387},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.37369999289512634},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.36809998750686646},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3596000075340271},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35280001163482666},{"id":"https://openalex.org/C192353077","wikidata":"https://www.wikidata.org/wiki/Q4682635","display_name":"Adiabatic quantum computation","level":4,"score":0.3418999910354614},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3384000062942505},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.3278000056743622},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3255000114440918},{"id":"https://openalex.org/C207467116","wikidata":"https://www.wikidata.org/wiki/Q4385666","display_name":"Inverse","level":2,"score":0.31189998984336853},{"id":"https://openalex.org/C62641251","wikidata":"https://www.wikidata.org/wiki/Q7269097","display_name":"Quantum sort","level":5,"score":0.3089999854564667},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3003000020980835},{"id":"https://openalex.org/C58849907","wikidata":"https://www.wikidata.org/wiki/Q2118982","display_name":"Quantum gate","level":4,"score":0.2946000099182129},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C117148685","wikidata":"https://www.wikidata.org/wiki/Q6865376","display_name":"Minimax approximation algorithm","level":2,"score":0.28700000047683716},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.2802000045776367},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2750999927520752},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.2728999853134155},{"id":"https://openalex.org/C160824197","wikidata":"https://www.wikidata.org/wiki/Q2071054","display_name":"Linear approximation","level":3,"score":0.25189998745918274}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.09584","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.09584","pdf_url":"https://arxiv.org/pdf/2610.09584","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.2610.09584","doi":"https://doi.org/10.48550/arxiv.2610.09584","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.09584","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:2610.09584","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.09584","pdf_url":"https://arxiv.org/pdf/2610.09584","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/W7221065010.pdf","grobid_xml":"https://content.openalex.org/works/W7221065010.grobid-xml"},"referenced_works_count":50,"referenced_works":["https://openalex.org/W1523603617","https://openalex.org/W1568345435","https://openalex.org/W1569506757","https://openalex.org/W2754868542","https://openalex.org/W2798553955","https://openalex.org/W2802230929","https://openalex.org/W2950639237","https://openalex.org/W2962767882","https://openalex.org/W3016618834","https://openalex.org/W3088409280","https://openalex.org/W3127938248","https://openalex.org/W3171066440","https://openalex.org/W3201587870","https://openalex.org/W3205061038","https://openalex.org/W3209352128","https://openalex.org/W3209534835","https://openalex.org/W3213854893","https://openalex.org/W3215460652","https://openalex.org/W4312225592","https://openalex.org/W4360103738","https://openalex.org/W4388561449","https://openalex.org/W4392862204","https://openalex.org/W4395001626","https://openalex.org/W4396609698","https://openalex.org/W4403834027","https://openalex.org/W4404693019","https://openalex.org/W4406122603","https://openalex.org/W4415444582","https://openalex.org/W4415962224","https://openalex.org/W6891893723","https://openalex.org/W7083316599","https://openalex.org/W7090890275","https://openalex.org/W7117326031","https://openalex.org/W7125427540","https://openalex.org/W7128043983","https://openalex.org/W7134061595","https://openalex.org/W7153992552","https://openalex.org/W7158666340","https://openalex.org/W7168129150","https://openalex.org/W7169688540","https://openalex.org/W7169838424","https://openalex.org/W7172438685","https://openalex.org/W7204460871","https://openalex.org/W7211998202","https://openalex.org/W7214809170","https://openalex.org/W7215039715","https://openalex.org/W7215061123","https://openalex.org/W7216049020","https://openalex.org/W7216195416","https://openalex.org/W7220413213"],"related_works":["https://openalex.org/W2916506658","https://openalex.org/W7214809170","https://openalex.org/W3091992818","https://openalex.org/W2982304552","https://openalex.org/W4312045630","https://openalex.org/W2952437585","https://openalex.org/W2139322641","https://openalex.org/W1982397733","https://openalex.org/W1971275002","https://openalex.org/W3217540793"],"abstract_inverted_index":{"Classical":[0],"approximation":[1,22,24,30,78,131,174,227],"complexity":[2,219],"asks":[3],"what":[4],"solution":[5,72],"quality":[6],"can":[7,224],"be":[8,89],"guaranteed":[9],"with":[10,80],"polynomial-time":[11,167,206],"computation.":[12],"The":[13],"classes":[14,139],"APX,":[15],"PTAS,":[16],"and":[17,29,47,56,101,110,129,149,190],"FPTAS":[18],"distinguish":[19],"a":[20,60,69,123,141,191,204],"fixed":[21,27,197],"ratio,":[23],"to":[25],"any":[26,165,196],"accuracy,":[28],"schemes":[31],"whose":[32],"running":[33],"time":[34,94],"is":[35],"also":[36],"polynomial":[37],"in":[38],"inverse":[39],"accuracy.":[40],"Their":[41],"randomized":[42,166,205],"counterparts":[43,53],"are":[44,107],"R-APX,":[45],"R-PTAS,":[46],"R-FPTAS.":[48],"We":[49,120],"define":[50],"bounded-error":[51],"quantum":[52,62,104,138,162,188,222],"BQ-APX,":[54],"BQ-PTAS,":[55],"BQ-FPTAS.":[57],"Membership":[58],"requires":[59],"uniform":[61],"algorithm":[63,168,189,207],"that,":[64],"on":[65,146,176],"every":[66,177],"input,":[67],"returns":[68],"feasible":[70],"classical":[71],"achieving":[73],"at":[74,82,170],"least":[75,83,171],"the":[76,137,209],"claimed":[77],"ratio":[79,175],"probability":[81],"2/3.":[84],"Scores":[85],"(objective":[86],"values)":[87],"must":[88],"efficiently":[90],"classically":[91],"computable.":[92],"Running":[93],"includes":[95],"parameter":[96],"selection,":[97],"preparation,":[98],"measurement,":[99],"decoding,":[100],"repetition.":[102],"Many":[103],"optimization":[105],"methods":[106],"used":[108],"heuristically,":[109],"high":[111],"benchmark":[112],"scores":[113],"alone":[114],"do":[115],"not":[116],"establish":[117,122],"these":[118],"guarantees.":[119,228],"further":[121],"conditional":[124,153],"hierarchy":[125],"for":[126,208,232],"logarithmic,":[127],"polynomial,":[128],"exponential":[130],"factors.":[132],"Assuming":[133],"NP":[134],"$\\nsubseteq$":[135],"BQP,":[136],"form":[140],"strict":[142],"hierarchy.":[143],"Problems":[144],"based":[145],"prime":[147],"factorization":[148],"discrete":[150,211],"logarithms":[151],"give":[152,203],"quantum-classical":[154,230],"separations.":[155],"Certified":[156],"Maximum":[157],"Order":[158],"has":[159,185],"an":[160,172,186],"exact":[161,187],"algorithm,":[163],"while":[164],"guaranteeing":[169],"inverse-polynomial":[173],"input":[178],"would":[179,202],"yield":[180],"efficient":[181],"factoring.":[182],"Discrete-Logarithm":[183],"Fitting":[184],"deterministic":[192],"one-half":[193],"approximation,":[194],"but":[195],"improvement":[198],"over":[199],"one":[200],"half":[201],"safe-prime":[210],"logarithm":[212],"problem.":[213],"Our":[214],"results":[215],"show,":[216],"under":[217],"explicit":[218],"assumptions,":[220],"that":[221],"computation":[223],"improve":[225],"worst-case":[226],"A":[229],"gap":[231],"common":[233],"problems":[234],"such":[235],"as":[236],"MaxCut":[237],"or":[238],"MaxSAT":[239],"remains":[240],"open.":[241]},"counts_by_year":[],"updated_date":"2026-11-08T12:12:28.789561","created_date":"2026-10-09T00:00:00"}