{"id":"https://openalex.org/W7212081776","doi":"https://doi.org/10.48550/arxiv.2609.05812","title":"Quantum Query Algorithms for the Constructive Diagonal Ramsey Theorem","display_name":"Quantum Query Algorithms for the Constructive Diagonal Ramsey Theorem","publication_year":2026,"publication_date":"2026-09-05","ids":{"openalex":"https://openalex.org/W7212081776","doi":"https://doi.org/10.48550/arxiv.2609.05812"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2609.05812","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.05812","pdf_url":"https://arxiv.org/pdf/2609.05812","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.05812","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5150966389","display_name":"Cheng Xin","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I67328108","display_name":"California State University, Fresno","ror":"https://ror.org/03enmdz06","country_code":"US","type":"education","lineage":["https://openalex.org/I67328108"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xin, Cheng","raw_affiliation_strings":["Department of Computer Science California State University , Fresno"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science California State University , Fresno","institution_ids":["https://openalex.org/I67328108"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5150966389"],"corresponding_institution_ids":["https://openalex.org/I67328108"],"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.9032999873161316,"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.9032999873161316,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.0731000006198883,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.006500000134110451,"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/ramsey-numbers","display_name":"Ramsey numbers","score":0.7210000157356262},{"id":"https://openalex.org/keywords/quantum-query-algorithms","display_name":"quantum query algorithms","score":0.8309999704360962},{"id":"https://openalex.org/keywords/sublinear-algorithms","display_name":"sublinear-time algorithms","score":0.5640000104904175},{"id":"https://openalex.org/keywords/quantum-lower-bounds","display_name":"quantum lower bounds","score":0.8569999933242798},{"id":"https://openalex.org/keywords/quantum-search-algorithms","display_name":"quantum search","score":0.4320000112056732},{"id":"https://openalex.org/keywords/random-graphs","display_name":"random graphs","score":0.4740000069141388}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6858999729156494},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.6055999994277954},{"id":"https://openalex.org/C44115641","wikidata":"https://www.wikidata.org/wiki/Q918099","display_name":"Ramsey's theorem","level":3,"score":0.5198000073432922},{"id":"https://openalex.org/C140058369","wikidata":"https://www.wikidata.org/wiki/Q7269113","display_name":"Quantum walk","level":4,"score":0.5091999769210815},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4970000088214874},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.4620000123977661},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.45649999380111694},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4325999915599823},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.42579999566078186},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.4198000133037567},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.38109999895095825},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.3553999960422516},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.35269999504089355},{"id":"https://openalex.org/C130367717","wikidata":"https://www.wikidata.org/wiki/Q189791","display_name":"Diagonal","level":2,"score":0.35179999470710754},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.3319000005722046},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3215999901294708},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.32100000977516174},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.31520000100135803},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.2919999957084656},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.28290000557899475},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.28189998865127563},{"id":"https://openalex.org/C41241483","wikidata":"https://www.wikidata.org/wiki/Q7269015","display_name":"Quantum capacity","level":5,"score":0.28139999508857727},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.28130000829696655},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.2800000011920929},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27720001339912415},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.2754000127315521},{"id":"https://openalex.org/C169699857","wikidata":"https://www.wikidata.org/wiki/Q2122243","display_name":"Quantum information","level":3,"score":0.27160000801086426},{"id":"https://openalex.org/C94940","wikidata":"https://www.wikidata.org/wiki/Q652941","display_name":"Hermitian matrix","level":2,"score":0.2628999948501587},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.2623000144958496},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.257999986410141},{"id":"https://openalex.org/C122907437","wikidata":"https://www.wikidata.org/wiki/Q5318999","display_name":"Dynamic perfect hashing","level":5,"score":0.2565000057220459},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.2556999921798706},{"id":"https://openalex.org/C165216359","wikidata":"https://www.wikidata.org/wiki/Q670653","display_name":"Marginal distribution","level":3,"score":0.2533000111579895},{"id":"https://openalex.org/C202854965","wikidata":"https://www.wikidata.org/wiki/Q3044470","display_name":"Constructive proof","level":2,"score":0.2513999938964844}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2609.05812","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.05812","pdf_url":"https://arxiv.org/pdf/2609.05812","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.05812","doi":"https://doi.org/10.48550/arxiv.2609.05812","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2609.05812","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.05812","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2609.05812","pdf_url":"https://arxiv.org/pdf/2609.05812","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/W7212081776.pdf","grobid_xml":"https://content.openalex.org/works/W7212081776.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W1763960172","https://openalex.org/W1769909511","https://openalex.org/W1814302338","https://openalex.org/W2020918964","https://openalex.org/W2026967932","https://openalex.org/W2042587503","https://openalex.org/W2045472305","https://openalex.org/W2056117314","https://openalex.org/W2084732248","https://openalex.org/W2159783982","https://openalex.org/W2262797885","https://openalex.org/W2417068188","https://openalex.org/W2951674151","https://openalex.org/W2963551170","https://openalex.org/W2964030075","https://openalex.org/W2964063279","https://openalex.org/W3103161513","https://openalex.org/W4234252375","https://openalex.org/W4296415581","https://openalex.org/W4412200738"],"related_works":["https://openalex.org/W2262797885","https://openalex.org/W3026254307","https://openalex.org/W2811269531","https://openalex.org/W2072481757","https://openalex.org/W1769909511","https://openalex.org/W1966082679","https://openalex.org/W7134957547","https://openalex.org/W4401878369","https://openalex.org/W2072676464","https://openalex.org/W2056117314"],"abstract_inverted_index":{"The":[0,114],"constructive":[1,118],"diagonal":[2],"Ramsey":[3,58,98,176,204],"problem":[4],"asks,":[5],"given":[6],"adjacency-oracle":[7],"access":[8],"to":[9,88,219],"an":[10,103,164,212],"$N$-vertex":[11],"graph,":[12],"for":[13,33,96,203],"a":[14,28,41,63,109,129,143,188,198],"clique":[15],"or":[16],"independent":[17],"set":[18,65,125],"of":[19,66,81,132,154,174,223],"the":[20,57,78,82,91,97,117,151,160,171,181],"order":[21,67],"guaranteed":[22],"by":[23,108,128],"Ramsey's":[24],"theorem.":[25],"We":[26,100,158,209],"give":[27,211],"bounded-error":[29],"quantum":[30,105,140,190,201],"algorithm":[31,95,115],"that,":[32],"every":[34,220],"$K\\ge2$":[35],"and":[36,39,86,135,142,216],"$N\\ge4^{K-1}$,":[37],"finds":[38],"verifies":[40],"homogeneous":[42,64],"$K$-set":[43],"using":[44,70,137],"$O\\!\\left(2^K":[45],"K\\log\\frac":[46],"K\u03b7\\right)$":[47],"edge":[48,224],"queries":[49,80],"with":[50,163],"failure":[51],"probability":[52],"at":[53],"most":[54],"$\u03b7$.":[55],"At":[56],"scale":[59],"$N=2^n$,":[60],"this":[61],"yields":[62],"$\\lfloor":[68],"n/2\\rfloor+1$":[69],"$O(\\sqrt":[71],"N\\log":[72],"N\\log(\\log":[73],"N/\u03b7))$":[74],"queries,":[75,196],"improving":[76],"on":[77,180,206],"$O(N)$":[79],"explicit":[83],"classical":[84],"recursion":[85,119,215],"giving,":[87],"our":[89],"knowledge,":[90],"first":[92],"sublinear":[93],"worst-case":[94],"relation.":[99],"also":[101,210],"derive":[102],"$\u03a9(N^{1/12})$":[104],"lower":[106,167],"bound":[107,162],"reduction":[110],"from":[111,170],"collision":[112],"finding.":[113],"runs":[116],"over":[120],"implicit":[121],"candidate":[122],"sets.":[123,157],"Each":[124],"is":[126],"represented":[127],"short":[130],"conjunction":[131],"adjacency":[133],"constraints":[134],"sampled":[136],"capped":[138],"unknown-solution":[139],"search,":[141],"scale-aware":[144],"concentration":[145],"schedule":[146],"balances":[147],"estimation":[148],"accuracy":[149],"against":[150],"increasing":[152],"cost":[153],"sampling":[155],"deeper":[156],"complement":[159],"upper":[161],"$\u03a9(N^{1-1/\\sqrt2})$":[165],"randomized":[166],"bound,":[168],"transported":[169],"random-Painter":[172],"analysis":[173],"online":[175],"numbers,":[177],"which":[178],"holds":[179],"uniform":[182],"distribution":[183,187],"$G(N,1/2)$.":[184],"On":[185],"that":[186],"greedy":[189],"search":[191,205],"uses":[192],"only":[193],"$\\widetilde":[194],"O(N^{1/4})$":[195],"giving":[197],"provable":[199],"polynomial":[200],"speedup":[202],"random":[207],"graphs.":[208],"estimation-free":[213],"size-biased":[214],"extend":[217],"it":[218],"fixed":[221],"number":[222],"colours.":[225]},"counts_by_year":[],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2026-09-10T00:00:00"}