{"id":"https://openalex.org/W4392575257","doi":"https://doi.org/10.48550/arxiv.2403.03237","title":"Local Quantum Search Algorithm for Random $k$-SAT with $\u03a9(n^{1+\u03b5})$ Clauses","display_name":"Local Quantum Search Algorithm for Random $k$-SAT with $\u03a9(n^{1+\u03b5})$ Clauses","publication_year":2024,"publication_date":"2024-03-05","ids":{"openalex":"https://openalex.org/W4392575257","doi":"https://doi.org/10.48550/arxiv.2403.03237"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2403.03237","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2403.03237","pdf_url":"https://arxiv.org/pdf/2403.03237","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/2403.03237","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5019661520","display_name":"Mingyou Wu","orcid":"https://orcid.org/0000-0002-0972-5759","observed_orcids":["https://orcid.org/0000-0002-0972-5759"]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wu, Mingyou","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5019661520"],"corresponding_institution_ids":[],"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":0.9965999722480774,"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.9965999722480774,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0008999999845400453,"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.00039999998989515007,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/random-k-sat","display_name":"random k-SAT","score":0.8330000042915344},{"id":"https://openalex.org/keywords/quantum-search-algorithms","display_name":"quantum search","score":0.6460000276565552},{"id":"https://openalex.org/keywords/satisfiability-phase-transition","display_name":"satisfiability phase transition","score":0.8149999976158142},{"id":"https://openalex.org/keywords/average-case-complexity","display_name":"average-case complexity","score":0.8619999885559082},{"id":"https://openalex.org/keywords/grover-s-algorithm","display_name":"Grover's algorithm","score":0.7110000252723694},{"id":"https://openalex.org/keywords/structured-search","display_name":"structured search","score":0.4059999883174896}],"concepts":[{"id":"https://openalex.org/C109663097","wikidata":"https://www.wikidata.org/wiki/Q182453","display_name":"Adiabatic process","level":2,"score":0.6951278448104858},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.5561286211013794},{"id":"https://openalex.org/C121864883","wikidata":"https://www.wikidata.org/wiki/Q677916","display_name":"Statistical physics","level":1,"score":0.4509630799293518},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.43317273259162903},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.34581777453422546},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.3446454405784607}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2403.03237","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2403.03237","pdf_url":"https://arxiv.org/pdf/2403.03237","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.2403.03237","doi":"https://doi.org/10.48550/arxiv.2403.03237","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2403.03237","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:2403.03237","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2403.03237","pdf_url":"https://arxiv.org/pdf/2403.03237","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":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4392575257.pdf","grobid_xml":"https://content.openalex.org/works/W4392575257.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1063842838","https://openalex.org/W1516729503","https://openalex.org/W1546943373","https://openalex.org/W1966566486","https://openalex.org/W1969966778","https://openalex.org/W1983624953","https://openalex.org/W1988801946","https://openalex.org/W2002372750","https://openalex.org/W2031828766","https://openalex.org/W2036265926","https://openalex.org/W2037022371","https://openalex.org/W2074397050","https://openalex.org/W2085426595","https://openalex.org/W2088419249","https://openalex.org/W2100008268","https://openalex.org/W2102008187","https://openalex.org/W2105860081","https://openalex.org/W2152620223","https://openalex.org/W2155521441","https://openalex.org/W2401610261","https://openalex.org/W2564229214","https://openalex.org/W2793525843","https://openalex.org/W2951511034","https://openalex.org/W3178089624","https://openalex.org/W3215460652"],"related_works":["https://openalex.org/W7223159237","https://openalex.org/W1952196963","https://openalex.org/W6991448452","https://openalex.org/W4410606662","https://openalex.org/W1752551387","https://openalex.org/W2952785936","https://openalex.org/W7100680950","https://openalex.org/W3105549945","https://openalex.org/W3194397752","https://openalex.org/W4405626054"],"abstract_inverted_index":{"The":[0],"random":[1,61,181],"k-SAT":[2,149],"instances":[3,134,182,237],"undergo":[4],"a":[5,20,27,120],"\"phase":[6],"transition\"":[7],"from":[8,39],"being":[9,40],"generally":[10,41],"satisfiable":[11,133],"to":[12,46,55,74,98,199],"unsatisfiable":[13],"as":[14,138],"the":[15,31,37,57,75,81,89,106,113,117,126,130,155,197,210,219,253],"clause":[16],"number":[17,32],"m":[18],"passes":[19],"critical":[21],"threshold,":[22,51],"$r_k":[23],"n$.":[24],"This":[25],"causes":[26],"drastic":[28],"reduction":[29],"in":[30,84,145],"of":[33,60,77,119,128,132,135,183,205,213,234,238],"satisfying":[34],"assignments,":[35],"shifting":[36],"problem":[38,127,142],"solvable":[42,144],"on":[43,125,180,247,252],"classical":[44],"computers":[45],"typically":[47],"insolvable.":[48],"Beyond":[49],"this":[50,141,231],"it":[52],"is":[53,143,216,221,245],"challenging":[54],"comprehend":[56],"computational":[58],"complexity":[59,212,255],"k-SAT.":[62],"In":[63,207],"quantum":[64,91,96,175,194],"computing,":[65],"Grover's":[66,101],"search":[67,85,92,97,114,176,195],"still":[68],"yields":[69],"exponential":[70],"time":[71,204],"requirements":[72],"due":[73],"neglect":[76],"structural":[78],"information.":[79],"Leveraging":[80],"structure":[82],"inherent":[83],"problems,":[86],"we":[87,122,240],"propose":[88],"k-local":[90,174,192],"algorithm,":[93],"which":[94],"extends":[95],"structured":[99],"scenarios.":[100],"search,":[102],"by":[103],"contrast,":[104],"addresses":[105],"unstructured":[107],"case":[108],"where":[109],"k=n.":[110],"Given":[111],"that":[112,243],"algorithm":[115,232],"necessitates":[116],"presence":[118],"target,":[121],"specifically":[123],"focus":[124],"searching":[129],"interpretation":[131],"k-SAT,":[136],"denoted":[137],"max-k-SSAT.":[139],"If":[140],"polynomial":[146,246],"time,":[147],"then":[148],"can":[150],"also":[151],"be":[152],"solved":[153],"within":[154,201],"same":[156],"complexity.":[157],"We":[158],"demonstrate":[159],"that,":[160],"for":[161],"small":[162,167],"$k":[163],"\\ge":[164],"3$,":[165],"any":[166],"$\u03b5>0$":[168],"and":[169,190,218],"sufficiently":[170],"large":[171],"n:":[172],"$\\cdot$":[173,191],"achieves":[177],"general":[178],"efficiency":[179,220],"max-k-SSAT":[184,244],"with":[185,223],"$m=\u03a9(n^{2+\u03b4+\u03b5})$":[186],"using":[187],"$\\mathcal{O}(n)$":[188],"iterations,":[189],"adiabatic":[193],"enhances":[196],"bound":[198],"$m=\u03a9(n^{1+\u03b4+\u03b5})$":[200],"an":[202],"evolution":[203],"$\\mathcal{O}(n^2)$.":[206],"both":[208],"cases,":[209],"circuit":[211],"each":[214],"iteration":[215],"$\\mathcal{O}(n^k)$,":[217],"assured":[222],"overwhelming":[224],"probability":[225],"$1":[226],"-":[227],"\\mathcal{O}(\\mathrm{erfc}(n^{\u03b4/2}))$.":[228],"By":[229],"modifying":[230],"capable":[233],"solving":[235],"all":[236],"max-k-SSAT,":[239],"further":[241],"prove":[242],"average":[248],"when":[249],"$m=\u03a9(n^{2+\u03b5})$":[250],"based":[251],"average-case":[254],"theory.":[256]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2024-03-08T00:00:00"}