{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T02:28:34Z","timestamp":1760149714762,"version":"build-2065373602"},"reference-count":37,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2023,8,31]],"date-time":"2023-08-31T00:00:00Z","timestamp":1693440000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"U.S. Air Force Research Lab Summer Faculty Fellowship Program (SFFP)"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We investigate the irreconcilability issue that arises when translating the search algorithm from the Continuous Time Quantum Walk (CTQW) framework to the Adiabatic Quantum Computing (AQC) framework. For the AQC formulation to evolve along the same path as the CTQW, it requires a constant energy gap in the Hamiltonian throughout the AQC schedule. To resolve the constant gap issue, we modify the CTQW-inspired AQC catalyst Hamiltonian from an XZ operator to a Z oracle operator. Through simulation, we demonstrate that the total running time for the proposed approach for AQC with the modified catalyst Hamiltonian remains optimal as CTQW. Inspired by this solution, we further investigate adaptive scheduling for the catalyst Hamiltonian and its coefficient function in the adiabatic path of Grover-inspired AQC to improve the adiabatic local search.<\/jats:p>","DOI":"10.3390\/e25091287","type":"journal-article","created":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T08:19:39Z","timestamp":1693556379000},"page":"1287","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum-Walk-Inspired Dynamic Adiabatic Local Search"],"prefix":"10.3390","volume":"25","author":[{"given":"Chen-Fu","family":"Chiang","sequence":"first","affiliation":[{"name":"Department of Computer Science, State University of New York Polytechnic Institute, Utica, NY 13203, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul M.","family":"Alsing","sequence":"additional","affiliation":[{"name":"Information Directorate, Air Force Research Laboratory, Rome, NY 13441, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,8,31]]},"reference":[{"key":"ref_1","unstructured":"Shor, P.W. (1994, January 20\u201322). Algorithms for quantum computation: Discrete logarithms and factoring. Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, NM, USA."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996, January 22\u201324). A fast quantum mechanical algorithm for database search. Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, Philadelphia, PA, USA.","DOI":"10.1145\/237814.237866"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1103\/PhysRevA.58.915","article-title":"Quantum computation and decision trees","volume":"58","author":"Farhi","year":"1998","journal-title":"Phys. Rev. A"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1080\/00107151031000110776","article-title":"Quantum random walks: An introductory overview","volume":"44","author":"Kempe","year":"2003","journal-title":"Contemp. Phys."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"180501","DOI":"10.1103\/PhysRevLett.102.180501","article-title":"Universal computation by quantum walk","volume":"102","author":"Childs","year":"2009","journal-title":"Phys. Rev. Lett."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"042330","DOI":"10.1103\/PhysRevA.81.042330","article-title":"Universal quantum computation using the discrete-time quantum walk","volume":"81","author":"Lovett","year":"2010","journal-title":"Phys. Rev. A"},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1038\/ncomms11511","article-title":"Efficient quantum walk on a quantum processor","volume":"7","author":"Qiang","year":"2016","journal-title":"Nat. Commun."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"09B612","DOI":"10.1063\/1.3223548","article-title":"Highly efficient energy excitation transfer in light-harvesting complexes: The fundamental role of noise-assisted transport","volume":"131","author":"Caruso","year":"2009","journal-title":"J. Chem. Phys."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"11B603","DOI":"10.1063\/1.3002335","article-title":"Environment-assisted quantum walks in photosynthetic energy transfer","volume":"129","author":"Mohseni","year":"2008","journal-title":"J. Chem. Phys."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"033003","DOI":"10.1088\/1367-2630\/11\/3\/033003","article-title":"Environment-assisted quantum transport","volume":"11","author":"Rebentrost","year":"2009","journal-title":"New J. Phys."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"113019","DOI":"10.1088\/1367-2630\/10\/11\/113019","article-title":"Dephasing-assisted transport: Quantum networks and biomolecules","volume":"10","author":"Plenio","year":"2008","journal-title":"New J. Phys."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"207901","DOI":"10.1103\/PhysRevLett.91.207901","article-title":"Quantum communication through an unmodulated spin chain","volume":"91","author":"Bose","year":"2003","journal-title":"Phys. Rev. Lett."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1142\/S0219749910006514","article-title":"Perfect, efficient, state transfer and its application as a constructive tool","volume":"8","author":"Kay","year":"2010","journal-title":"Int. J. Quantum Inf."},{"key":"ref_14","first-page":"R28-003","article-title":"Quantum Link Prediction in Complex Networks","volume":"2019","author":"Omar","year":"2019","journal-title":"APS"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"100501","DOI":"10.1103\/PhysRevLett.116.100501","article-title":"Spatial search by quantum walk is optimal for almost all graphs","volume":"116","author":"Chakraborty","year":"2016","journal-title":"Phys. Rev. Lett."},{"key":"ref_16","first-page":"1","article-title":"Quantum computing","volume":"1","author":"Shor","year":"1998","journal-title":"Doc. Math."},{"key":"ref_17","unstructured":"Yao, A.C.C. (1993, January 3\u20135). Quantum circuit complexity. Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science, Palo Alto, CA, USA."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1126\/science.1217069","article-title":"Quantum algorithms for quantum field theories","volume":"336","author":"Jordan","year":"2012","journal-title":"Science"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1083","DOI":"10.1103\/RevModPhys.80.1083","article-title":"Non-Abelian anyons and topological quantum computation","volume":"80","author":"Nayak","year":"2008","journal-title":"Rev. Mod. Phys."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"070502","DOI":"10.1103\/PhysRevLett.99.070502","article-title":"Simple proof of equivalence between adiabatic quantum computation and the circuit model","volume":"99","author":"Mizel","year":"2007","journal-title":"Phys. Rev. Lett."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/s11128-017-1552-8","article-title":"Resonant transition-based quantum computation","volume":"16","author":"Chiang","year":"2017","journal-title":"Quantum Inf. Process."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"1036","DOI":"10.1038\/ncomms2043","article-title":"Blind topological measurement-based quantum computation","volume":"3","author":"Morimae","year":"2012","journal-title":"Nat. Commun."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"220503","DOI":"10.1103\/PhysRevLett.98.220503","article-title":"Novel schemes for measurement-based quantum computation","volume":"98","author":"Gross","year":"2007","journal-title":"Phys. Rev. Lett."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1038\/nphys1157","article-title":"Measurement-based quantum computation","volume":"5","author":"Briegel","year":"2009","journal-title":"Nat. Phys."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"022312","DOI":"10.1103\/PhysRevA.68.022312","article-title":"Measurement-based quantum computation on cluster states","volume":"68","author":"Raussendorf","year":"2003","journal-title":"Phys. Rev. A"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Cutugno, M., Giani, A., Alsing, P.M., Wessing, L., and Schnore, S. (2022). Quantum Computing Approaches for Mission Covering Optimization. Algorithms, 15.","DOI":"10.3390\/a15070224"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"062313","DOI":"10.1103\/PhysRevA.93.062313","article-title":"Irreconcilable difference between quantum walks and adiabatic quantum computing","volume":"93","author":"Wong","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"042308","DOI":"10.1103\/PhysRevA.65.042308","article-title":"Quantum search by local adiabatic evolution","volume":"65","author":"Roland","year":"2002","journal-title":"Phys. Rev. A"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"022314","DOI":"10.1103\/PhysRevA.70.022314","article-title":"Spatial search by quantum walk","volume":"70","author":"Childs","year":"2004","journal-title":"Phys. Rev. A"},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Childs, A.M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., and Spielman, D.A. (2003, January 9\u201311). Exponential algorithmic speedup by a quantum walk. Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing, San Diego, CA, USA.","DOI":"10.1145\/780542.780552"},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"13304","DOI":"10.1038\/srep13304","article-title":"Systematic dimensionality reduction for quantum walks: Optimal spatial search and transport on non-regular graphs","volume":"5","author":"Novo","year":"2015","journal-title":"Sci. Rep."},{"key":"ref_32","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., and Sipser, M. (2000). Quantum computation by adiabatic evolution. arXiv."},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"015002","DOI":"10.1103\/RevModPhys.90.015002","article-title":"Adiabatic quantum computation","volume":"90","author":"Albash","year":"2018","journal-title":"Rev. Mod. Phys."},{"key":"ref_34","first-page":"181","article-title":"Quantum Adiabatic Algorithms, Small Gaps, and Different Paths","volume":"11","author":"Farhi","year":"2011","journal-title":"Quantum Info. Comput."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s11128-010-0168-z","article-title":"A study of heuristic guesses for adiabatic quantum computation","volume":"10","year":"2011","journal-title":"Quantum Inf. Process."},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Griffiths, D.J., and Schroeter, D.F. (2018). Introduction to Quantum Mechanics, Cambridge University Press.","DOI":"10.1017\/9781316995433"},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1137\/080734479","article-title":"Adiabatic quantum computation is equivalent to standard quantum computation","volume":"50","author":"Aharonov","year":"2008","journal-title":"SIAM Rev."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/9\/1287\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T20:44:23Z","timestamp":1760129063000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/9\/1287"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,31]]},"references-count":37,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2023,9]]}},"alternative-id":["e25091287"],"URL":"https:\/\/doi.org\/10.3390\/e25091287","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,8,31]]}}}