{"id":"https://openalex.org/W7160958040","doi":"https://doi.org/10.48550/arxiv.2605.09017","title":"Quantum algorithms for path and cycle containment problems","display_name":"Quantum algorithms for path and cycle containment problems","publication_year":2026,"publication_date":"2026-05-09","ids":{"openalex":"https://openalex.org/W7160958040","doi":"https://doi.org/10.48550/arxiv.2605.09017"},"language":"en","primary_location":{"id":"pmh:oai:pure.tue.nl:openaire/db5e9070-eac7-4e09-be49-e121696061f7","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/db5e9070-eac7-4e09-be49-e121696061f7","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Cornelissen, A, Gilani, A S & Patro, S 2026 'Quantum algorithms for path and cycle containment problems' arXiv.org. https://doi.org/10.48550/arXiv.2605.09017","raw_type":"info:eu-repo/semantics/preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/db5e9070-eac7-4e09-be49-e121696061f7","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5087426081","display_name":"Arjan Cornelissen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cornelissen, Arjan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5018608700","display_name":"Amin Shiraz Gilani","orcid":"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":"last","author":{"id":"https://openalex.org/A5020400393","display_name":"Subhasree Patro","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Patro, Subhasree","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"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.9060999751091003,"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.9060999751091003,"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.07320000231266022,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.00570000009611249,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5814999938011169},{"id":"https://openalex.org/keywords/equivalence","display_name":"Equivalence (formal languages)","score":0.4885999858379364},{"id":"https://openalex.org/keywords/adjacency-matrix","display_name":"Adjacency matrix","score":0.4593000113964081},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.44209998846054077},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4339999854564667},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.42750000953674316},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42089998722076416},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.39879998564720154}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6481999754905701},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5814999938011169},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.4885999858379364},{"id":"https://openalex.org/C180356752","wikidata":"https://www.wikidata.org/wiki/Q727035","display_name":"Adjacency matrix","level":3,"score":0.4593000113964081},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4440000057220459},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.44209998846054077},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4339999854564667},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42750000953674316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42089998722076416},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.39879998564720154},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.37380000948905945},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.36079999804496765},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3562000095844269},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.34529998898506165},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3450999855995178},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.33799999952316284},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33149999380111694},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.32089999318122864},{"id":"https://openalex.org/C106487976","wikidata":"https://www.wikidata.org/wiki/Q685816","display_name":"Matrix (chemical analysis)","level":2,"score":0.30559998750686646},{"id":"https://openalex.org/C110484373","wikidata":"https://www.wikidata.org/wiki/Q264398","display_name":"Adjacency list","level":2,"score":0.2962000072002411},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.2930999994277954},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.272599995136261},{"id":"https://openalex.org/C17349429","wikidata":"https://www.wikidata.org/wiki/Q1049914","display_name":"Matrix multiplication","level":3,"score":0.2605000138282776},{"id":"https://openalex.org/C156103551","wikidata":"https://www.wikidata.org/wiki/Q130998","display_name":"Equivalence relation","level":2,"score":0.2549000084400177}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:pure.tue.nl:openaire/db5e9070-eac7-4e09-be49-e121696061f7","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/db5e9070-eac7-4e09-be49-e121696061f7","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Cornelissen, A, Gilani, A S & Patro, S 2026 'Quantum algorithms for path and cycle containment problems' arXiv.org. https://doi.org/10.48550/arXiv.2605.09017","raw_type":"info:eu-repo/semantics/preprint"},{"id":"doi:10.48550/arxiv.2605.09017","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.09017","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"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":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/db5e9070-eac7-4e09-be49-e121696061f7","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/db5e9070-eac7-4e09-be49-e121696061f7","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Cornelissen, A, Gilani, A S & Patro, S 2026 'Quantum algorithms for path and cycle containment problems' arXiv.org. https://doi.org/10.48550/arXiv.2605.09017","raw_type":"info:eu-repo/semantics/preprint"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3077665131","display_name":null,"funder_award_id":"2016245","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306084","display_name":"U.S. Department of Energy","ror":"https://ror.org/01bj3aw27"},{"id":"https://openalex.org/F4320332178","display_name":"National Institute of Standards and Technology","ror":"https://ror.org/05xpvk416"},{"id":"https://openalex.org/F4320332359","display_name":"Office of Science","ror":"https://ror.org/00mmn6b08"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"quantum":[1,271],"query":[2,44,225,247,279],"complexity":[3,226],"of":[4,25,42,55,72,97,122,141,144,177,188],"subgraph-containment":[5],"problems,":[6,124,147,170],"which":[7,261],"ask":[8],"whether":[9],"a":[10,39,98,133,173,185,219,252],"given":[11],"subgraph":[12],"$H$":[13],"is":[14,90],"present":[15],"in":[16,60],"an":[17,277],"input":[18,130],"graph":[19,131,274],"$G$,":[20],"has":[21,108,132],"been":[22],"the":[23,61,78,81,88,95,102,129,138,145,178,192,213,239,258],"subject":[24],"considerable":[26],"study.":[27],"However,":[28],"even":[29],"for":[30,68,107],"relatively":[31],"simple":[32],"subgraphs,":[33],"such":[34],"as":[35],"paths":[36,69],"and":[37,57,100,157,190,232],"cycles,":[38],"complete":[40],"understanding":[41],"their":[43],"complexities":[45],"remains":[46],"elusive.":[47],"In":[48],"this":[49,264],"work,":[50],"we":[51,66,104,126,164,171,217],"consider":[52,118],"several":[53,119,202],"variants":[54,143],"path-":[56],"cycle-containment":[58,203],"problems":[59,180],"adjacency":[62],"matrix":[63],"model,":[64],"where":[65,80,87,101,125,228],"search":[67],"or":[70,85,93,112],"cycles":[71],"constant":[73,210],"length":[74,109],"$k$.":[75,115],"We":[76,116,136,249],"compare":[77],"settings":[79],"graphs":[82],"are":[83,105,194],"directed":[84],"undirected,":[86],"goal":[89],"to":[91,151,168,196,201,209],"detect":[92],"find":[94],"existence":[96],"path/cycle,":[99],"path/cycle":[103],"looking":[106],"exactly":[110],"$k$,":[111],"at":[113],"most":[114],"also":[117,250],"promise":[120],"versions":[121],"these":[123,142],"suppose":[127],"that":[128,223,263],"certain":[134],"structure.":[135],"characterize":[137],"relative":[139],"difficulty":[140],"path/cycle-containment":[146],"by":[148],"relating":[149],"them":[150,159],"one":[152,197],"another":[153,198],"using":[154,184],"randomized":[155,206],"reductions,":[156,207],"grouping":[158],"into":[160],"equivalence":[161,215,265],"classes.":[162],"When":[163],"restrict":[165],"our":[166],"attention":[167],"path-containment":[169,179],"get":[172],"dichotomy":[174],"result.":[175],"Some":[176],"can":[181],"be":[182],"solved":[183],"linear":[186],"number":[187],"queries,":[189],"all":[191],"others":[193],"equivalent":[195],"(and":[199],"additionally":[200],"problems)":[204],"under":[205],"up":[208],"overhead.":[211],"For":[212],"latter":[214],"class,":[216],"prove":[218],"novel":[220],"quantum-walk-based":[221],"algorithm":[222],"achieves":[224],"$\\widetilde{O}(n^{3/2-\u03b1_k})$,":[227],"$\u03b1_k":[229],"\\in":[230],"\u0398(c^{-k})$":[231],"$c":[233],"=":[234],"\\sqrt{3+\\sqrt{17}}/2":[235],"\\approx":[236],"1.33$,":[237],"beating":[238],"previous":[240],"best":[241],"upper":[242],"bound":[243,255],"$O(n^{3/2})$":[244],"on":[245,257],"its":[246],"complexity.":[248],"provide":[251],"conditional":[253],"lower":[254],"based":[256],"graph-collision":[259],"problem,":[260],"implies":[262],"class":[266],"does":[267],"not":[268],"admit":[269],"linear-query":[270],"algorithms":[272],"unless":[273],"collision":[275],"admits":[276],"$O(\\sqrt{n})$":[278],"algorithm.":[280]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-05-13T00:00:00"}