{"id":"https://openalex.org/W7221530293","doi":"https://doi.org/10.48550/arxiv.2610.13906","title":"Quantum Query Complexity of Maximum Degree and its Generalizations","display_name":"Quantum Query Complexity of Maximum Degree and its Generalizations","publication_year":2026,"publication_date":"2026-10-09","ids":{"openalex":"https://openalex.org/W7221530293","doi":"https://doi.org/10.48550/arxiv.2610.13906"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2610.13906","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.13906","pdf_url":"https://arxiv.org/pdf/2610.13906","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.13906","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5018608700","display_name":"Amin Shiraz Gilani","orcid":"https://orcid.org/0000-0003-0859-7254","observed_orcids":["https://orcid.org/0000-0003-0859-7254"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gilani, Amin Shiraz","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5027137684","display_name":"Nikhil S. Mande","orcid":"https://orcid.org/0000-0002-9520-7340","observed_orcids":["https://orcid.org/0000-0002-9520-7340"]},"institutions":[{"id":"https://openalex.org/I146655781","display_name":"University of Liverpool","ror":"https://ror.org/04xs57h96","country_code":"GB","type":"education","lineage":["https://openalex.org/I146655781"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Mande, Nikhil S.","raw_affiliation_strings":["University of Liverpool , UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Liverpool , UK","institution_ids":["https://openalex.org/I146655781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5020400393","display_name":"Subhasree Patro","orcid":"https://orcid.org/0009-0005-7051-727X","observed_orcids":["https://orcid.org/0009-0005-7051-727X"]},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Patro, Subhasree","raw_affiliation_strings":["Eindhoven University of Technology , Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology , Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5120305994","display_name":"Nithish Raja","orcid":"https://orcid.org/0009-0004-5377-8649","observed_orcids":["https://orcid.org/0009-0004-5377-8649"]},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Raja, Nithish","raw_affiliation_strings":["Eindhoven University of Technology , Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology , Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":2,"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.9746000170707703,"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.9746000170707703,"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.021900000050663948,"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":0.0006000000284984708,"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-query-complexity","display_name":"quantum query complexity","score":0.9990000128746033},{"id":"https://openalex.org/keywords/maximum-degree","display_name":"maximum degree","score":0.6520000100135803},{"id":"https://openalex.org/keywords/tournaments","display_name":"tournaments","score":0.7699999809265137},{"id":"https://openalex.org/keywords/graph-problems","display_name":"graph problems","score":0.5260000228881836},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.7210000157356262},{"id":"https://openalex.org/keywords/quantum-algorithms","display_name":"quantum algorithms","score":0.8029999732971191}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.767300009727478},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6769999861717224},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.676800012588501},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6733999848365784},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5206000208854675},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49799999594688416},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4726000130176544},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4564000070095062},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.4526999890804291},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.40619999170303345},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4036000072956085},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.3400000035762787},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.3330000042915344},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.32519999146461487},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.3249000012874603},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.31779998540878296},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2815999984741211},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.27619999647140503},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C123482549","wikidata":"https://www.wikidata.org/wiki/Q826467","display_name":"Regular graph","level":5,"score":0.271699994802475},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C15706264","wikidata":"https://www.wikidata.org/wiki/Q230883","display_name":"Quantum state","level":3,"score":0.2639999985694885},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.25859999656677246},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.2574999928474426},{"id":"https://openalex.org/C97042676","wikidata":"https://www.wikidata.org/wiki/Q5597097","display_name":"Graph reduction","level":3,"score":0.2522999942302704}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2610.13906","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.13906","pdf_url":"https://arxiv.org/pdf/2610.13906","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.13906","doi":"https://doi.org/10.48550/arxiv.2610.13906","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2610.13906","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.13906","doi":null,"is_oa":true,"landing_page_url":"https://arxiv.org/abs/2610.13906","pdf_url":"https://arxiv.org/pdf/2610.13906","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":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7221530293.pdf","grobid_xml":"https://content.openalex.org/works/W7221530293.grobid-xml"},"referenced_works_count":25,"referenced_works":["https://openalex.org/W1541629428","https://openalex.org/W1605072865","https://openalex.org/W1964032471","https://openalex.org/W1985123706","https://openalex.org/W1994262057","https://openalex.org/W2006290558","https://openalex.org/W2007224204","https://openalex.org/W2008231303","https://openalex.org/W2035627701","https://openalex.org/W2127259150","https://openalex.org/W2153887174","https://openalex.org/W2153988305","https://openalex.org/W2401610261","https://openalex.org/W2604345077","https://openalex.org/W2951630006","https://openalex.org/W2963214524","https://openalex.org/W3041308142","https://openalex.org/W3098074752","https://openalex.org/W3126461544","https://openalex.org/W3186087377","https://openalex.org/W4403662499","https://openalex.org/W4412222075","https://openalex.org/W4416651800","https://openalex.org/W7160958040","https://openalex.org/W7215123839"],"related_works":["https://openalex.org/W2255703828","https://openalex.org/W7117241523","https://openalex.org/W4403662499","https://openalex.org/W7097377815","https://openalex.org/W3042984089","https://openalex.org/W4378714767","https://openalex.org/W4401102997","https://openalex.org/W1541629428","https://openalex.org/W1677264643","https://openalex.org/W1502382854"],"abstract_inverted_index":{"We":[0,12,88,117],"study":[1,90],"the":[2,38,65,81,96,130,174],"quantum":[3,59,114],"query":[4],"complexity":[5],"of":[6,30,67,102,133],"several":[7],"basic":[8],"graph":[9,56,136],"problems.":[10],"1)":[11],"prove":[13],"a":[14,20,28,44,49,61,119,134,138,167,177],"tight":[15],"$\u0398(n^{3/2})$":[16,58],"bound":[17,62,179,183],"for":[18,78,95,171],"finding":[19,48],"maximum-out-degree":[21],"vertex":[22,51],"in":[23,52,64],"an":[24,53,112],"$n$-vertex":[25,54],"tournament,":[26],"resolving":[27],"conjecture":[29,168],"Mande,":[31],"Paraashar,":[32],"and":[33,69],"Saurabh":[34],"[FSTTCS'23].":[35],"2)":[36],"Using":[37],"same":[39],"proof":[40,46],"idea,":[41],"we":[42,110,169],"give":[43,111],"direct":[45],"that":[47,155],"maximum-degree":[50],"undirected":[55],"requires":[57],"queries,":[60],"implicit":[63],"work":[66],"Apers":[68],"Lee":[70],"[CCC'21].":[71],"Both":[72],"lower":[73,146,178],"bounds":[74,147],"above":[75],"hold":[76],"even":[77],"computing":[79,162],"only":[80],"maximum":[82,85,163],"degree":[83],"or":[84],"out-degree.":[86],"3)":[87],"also":[89],"Maximum":[91,122],"$(k,n-k)$-Cut,":[92],"which":[93,127],"asks":[94,128],"largest":[97],"cut":[98],"with":[99,148],"one":[100],"side":[101],"size":[103],"$k$.":[104],"For":[105,140],"every":[106],"constant":[107],"$k\\geq":[108,141],"1$,":[109],"$O(n^{2-1/(k+1)})$-query":[113],"algorithm.":[115],"4)":[116],"establish":[118],"reduction":[120,175],"to":[121],"$(k,n-k)$-Cut":[123],"involving":[124],"$k$-Graph":[125,172],"Collision,":[126,173],"whether":[129],"marked":[131],"vertices":[132],"known":[135],"contain":[137],"$k$-clique.":[139],"3$,":[142],"this":[143,156],"yields":[144,176],"unconditional":[145],"exponents":[149],"strictly":[150,159],"larger":[151],"than":[152,161],"$3/2$,":[153],"showing":[154],"problem":[157],"is":[158],"harder":[160],"degree.":[164],"Additionally,":[165],"under":[166],"propose":[170],"matching":[180],"our":[181],"upper":[182],"above.":[184]},"counts_by_year":[{"year":2026,"cited_by_count":2}],"updated_date":"2026-11-09T13:22:03.289127","created_date":"2026-10-13T00:00:00"}