{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:39:38Z","timestamp":1764657578751,"version":"3.46.0"},"reference-count":20,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,8,30]],"date-time":"2025-08-30T00:00:00Z","timestamp":1756512000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["AMPS-2229073"],"award-info":[{"award-number":["AMPS-2229073"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,8,30]]},"DOI":"10.1109\/qce65121.2025.00036","type":"proceedings-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T18:22:51Z","timestamp":1764613371000},"page":"249-258","source":"Crossref","is-referenced-by-count":0,"title":["Hybrid and Quantum Graph Algorithms via Quantum Array Search: Applications to Hamiltonian Paths and Path Counting"],"prefix":"10.1109","author":[{"given":"Ethan","family":"Hunt","sequence":"first","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hieu","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dheeraj","family":"Tukkugudam","sequence":"additional","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dillon","family":"Horton","sequence":"additional","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tu N.","family":"Nguyen","sequence":"additional","affiliation":[{"name":"Kennesaw State University,Department of Computer Science,Marietta,GA,USA,30060"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TEM.2022.3175633"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-87568-8_2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.106.010101"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/050644719"},{"volume-title":"Quantum computing with Qiskit","year":"2024","author":"Javadi-Abhari","key":"ref5"},{"volume-title":"Quantum algorithm zoo. Google Research","year":"2025","author":"Jordan","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/305\/05215"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.31"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-22935-0_31"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"volume-title":"Introduction to quantum information science ii lecture notes","year":"2022","author":"Aaronson","key":"ref13"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/bfb0055105"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2005.53"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.108.022412"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2007.1032"},{"volume-title":"Graph Theory Electronic Edition 2005","year":"2005","author":"Diestel","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/0208032"},{"key":"ref20","article-title":"Zdd-based computation of the number of paths in a graph. Technical report, Hokkaido University, Graduate School of Information Science and Technology","volume-title":"Technical Report TCS-TR-A-12-60","author":"Iwashita","year":"2012"}],"event":{"name":"2025 IEEE International Conference on Quantum Computing and Engineering (QCE)","start":{"date-parts":[[2025,8,30]]},"location":"Albuquerque, NM, USA","end":{"date-parts":[[2025,9,5]]}},"container-title":["2025 IEEE International Conference on Quantum Computing and Engineering (QCE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11249812\/11249813\/11250179.pdf?arnumber=11250179","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T06:36:27Z","timestamp":1764657387000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11250179\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,30]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/qce65121.2025.00036","relation":{},"subject":[],"published":{"date-parts":[[2025,8,30]]}}}