{"id":"https://openalex.org/W4416875316","doi":"https://doi.org/10.1109/qce65121.2025.00036","title":"Hybrid and Quantum Graph Algorithms via Quantum Array Search: Applications to Hamiltonian Paths and Path Counting","display_name":"Hybrid and Quantum Graph Algorithms via Quantum Array Search: Applications to Hamiltonian Paths and Path Counting","publication_year":2025,"publication_date":"2025-08-30","ids":{"openalex":"https://openalex.org/W4416875316","doi":"https://doi.org/10.1109/qce65121.2025.00036"},"language":null,"primary_location":{"id":"doi:10.1109/qce65121.2025.00036","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5095920423","display_name":"Ethan Hunt","orcid":"https://orcid.org/0009-0009-5621-3770"},"institutions":[{"id":"https://openalex.org/I172980758","display_name":"Kennesaw State University","ror":"https://ror.org/00jeqjx33","country_code":"US","type":"education","lineage":["https://openalex.org/I172980758"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ethan Hunt","raw_affiliation_strings":["Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060","institution_ids":["https://openalex.org/I172980758"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089282845","display_name":"Hieu Nguyen","orcid":"https://orcid.org/0000-0002-5154-0125"},"institutions":[{"id":"https://openalex.org/I172980758","display_name":"Kennesaw State University","ror":"https://ror.org/00jeqjx33","country_code":"US","type":"education","lineage":["https://openalex.org/I172980758"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hieu Nguyen","raw_affiliation_strings":["Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060","institution_ids":["https://openalex.org/I172980758"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5120532075","display_name":"Dheeraj Tukkugudam","orcid":null},"institutions":[{"id":"https://openalex.org/I172980758","display_name":"Kennesaw State University","ror":"https://ror.org/00jeqjx33","country_code":"US","type":"education","lineage":["https://openalex.org/I172980758"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dheeraj Tukkugudam","raw_affiliation_strings":["Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060","institution_ids":["https://openalex.org/I172980758"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109215833","display_name":"D. Horton","orcid":null},"institutions":[{"id":"https://openalex.org/I172980758","display_name":"Kennesaw State University","ror":"https://ror.org/00jeqjx33","country_code":"US","type":"education","lineage":["https://openalex.org/I172980758"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dillon Horton","raw_affiliation_strings":["Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060","institution_ids":["https://openalex.org/I172980758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066987043","display_name":"Tu N. Nguyen","orcid":"https://orcid.org/0000-0001-7184-4102"},"institutions":[{"id":"https://openalex.org/I172980758","display_name":"Kennesaw State University","ror":"https://ror.org/00jeqjx33","country_code":"US","type":"education","lineage":["https://openalex.org/I172980758"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tu N. Nguyen","raw_affiliation_strings":["Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060","institution_ids":["https://openalex.org/I172980758"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I172980758"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.17570648,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"249","last_page":"258"},"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.9751999974250793,"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.9751999974250793,"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.0071000000461936,"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.0010000000474974513,"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/hamiltonian-path","display_name":"Hamiltonian path","score":0.5705000162124634},{"id":"https://openalex.org/keywords/quantum-algorithm","display_name":"Quantum algorithm","score":0.5539000034332275},{"id":"https://openalex.org/keywords/treewidth","display_name":"Treewidth","score":0.49149999022483826},{"id":"https://openalex.org/keywords/quantum-computer","display_name":"Quantum computer","score":0.46799999475479126},{"id":"https://openalex.org/keywords/clique-problem","display_name":"Clique problem","score":0.4593999981880188},{"id":"https://openalex.org/keywords/quantum","display_name":"Quantum","score":0.4542999863624573},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.4480000138282776},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4120999872684479}],"concepts":[{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5705000162124634},{"id":"https://openalex.org/C137019171","wikidata":"https://www.wikidata.org/wiki/Q2623817","display_name":"Quantum algorithm","level":3,"score":0.5539000034332275},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5246000289916992},{"id":"https://openalex.org/C132569581","wikidata":"https://www.wikidata.org/wiki/Q5067368","display_name":"Treewidth","level":5,"score":0.49149999022483826},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4787999987602234},{"id":"https://openalex.org/C58053490","wikidata":"https://www.wikidata.org/wiki/Q176555","display_name":"Quantum computer","level":3,"score":0.46799999475479126},{"id":"https://openalex.org/C150997102","wikidata":"https://www.wikidata.org/wiki/Q1196873","display_name":"Clique problem","level":5,"score":0.4593999981880188},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.4542999863624573},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.4480000138282776},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4120999872684479},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4050000011920929},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.3982999920845032},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.3921000063419342},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.36000001430511475},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3407999873161316},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.337799996137619},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.3240000009536743},{"id":"https://openalex.org/C164886730","wikidata":"https://www.wikidata.org/wiki/Q7269054","display_name":"Quantum graph","level":3,"score":0.32249999046325684},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.2766999900341034},{"id":"https://openalex.org/C64339825","wikidata":"https://www.wikidata.org/wiki/Q722659","display_name":"Graph property","level":5,"score":0.27649998664855957},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.258899986743927},{"id":"https://openalex.org/C192122513","wikidata":"https://www.wikidata.org/wiki/Q2835770","display_name":"Quantum phase estimation algorithm","level":5,"score":0.2581000030040741},{"id":"https://openalex.org/C124148022","wikidata":"https://www.wikidata.org/wiki/Q2122210","display_name":"Quantum circuit","level":5,"score":0.2556000053882599},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2551000118255615},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2547000050544739}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/qce65121.2025.00036","is_oa":false,"landing_page_url":"https://doi.org/10.1109/qce65121.2025.00036","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4505736545","display_name":null,"funder_award_id":"AMPS-2229073","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"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1845834564","https://openalex.org/W2006290558","https://openalex.org/W2007224204","https://openalex.org/W2008231303","https://openalex.org/W2020918964","https://openalex.org/W2084652510","https://openalex.org/W2110748811","https://openalex.org/W2115826669","https://openalex.org/W2121981260","https://openalex.org/W2139435141","https://openalex.org/W3037585991","https://openalex.org/W3203621140","https://openalex.org/W4284976704","https://openalex.org/W4285117926","https://openalex.org/W4385811129"],"related_works":[],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,46,82,120],"introduce":[4],"novel":[5],"hybrid":[6,85,164],"and":[7,20,39,43,154,163,180],"quantum":[8,31,60,162],"algorithms":[9],"for":[10,88,106,127,170],"fundamental":[11],"graph":[12,173],"problems,":[13,174],"specifically":[14,175],"the":[15,64,113],"Hamiltonian":[16,178],"Path":[17,26],"Problem":[18],"(HPP)":[19],"<tex":[21,77,91,102,108],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[22,78,92,103,109],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$\\langle":[23,93],"s,":[24,94],"t\\rangle$</tex>":[25,95],"Counting":[27],"Problem.":[28],"By":[29],"leveraging":[30],"array":[32],"search":[33],"techniques,":[34],"rooted":[35],"in":[36,41,50,76],"amplitude":[37],"amplification":[38],"applied":[40],"new":[42],"effective":[44],"ways,":[45],"achieve":[47],"significant":[48],"reductions":[49],"time":[51,99],"complexity":[52,100],"compared":[53],"to":[54,135,146,177],"classical":[55,114],"methods.":[56],"We":[57,139],"propose":[58],"a":[59,67,84,98,122],"algorithm":[61,87,126],"that":[62],"solves":[63],"HPP":[65],"on":[66],"special":[68],"class":[69],"of":[70,101],"graphs":[71],"known":[72],"as":[73],"clique":[74,129,147],"trees":[75],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O(\\sqrt{n})$</tex>":[79],"time.":[80],"Additionally,":[81],"develop":[83],"quantum-classical":[86],"counting":[89,182],"simple":[90],"paths":[96,179],"with":[97],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$O\\left(\\binom{m}{n}":[104],"\\sqrt{n}\\right)$</tex>":[105],"large":[107],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">$m$</tex>,":[110],"improving":[111],"over":[112],"baseline.":[115],"Beyond":[116],"these":[117],"algorithmic":[118,143],"contributions,":[119],"present":[121],"fixedparameter":[123],"tractable":[124],"(FPT)":[125],"identifying":[128],"trees,":[130,148],"enabling":[131],"their":[132,152],"structural":[133],"properties":[134],"be":[136],"efficiently":[137],"leveraged.":[138],"also":[140],"explore":[141],"additional":[142],"results":[144],"related":[145],"including":[149],"insights":[150],"into":[151],"treewidth":[153],"chromatic":[155],"number.":[156],"Overall,":[157],"our":[158],"work":[159],"demonstrates":[160],"how":[161],"approaches":[165],"can":[166],"offer":[167],"practical":[168],"advantages":[169],"solving":[171],"challenging":[172],"applications":[176],"path":[181],"problems.":[183]},"counts_by_year":[],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-12-01T00:00:00"}