{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:12:22Z","timestamp":1760058742141,"version":"build-2065373602"},"reference-count":28,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T00:00:00Z","timestamp":1745366400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100003593","name":"CNPq","doi-asserted-by":"publisher","award":["300926\/2022-7","304645\/2023-0","409552\/2022-4","E-26\/200.954\/2021"],"award-info":[{"award-number":["300926\/2022-7","304645\/2023-0","409552\/2022-4","E-26\/200.954\/2021"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"name":"FAPERJ","award":["300926\/2022-7","304645\/2023-0","409552\/2022-4","E-26\/200.954\/2021"],"award-info":[{"award-number":["300926\/2022-7","304645\/2023-0","409552\/2022-4","E-26\/200.954\/2021"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>Quantum walks are a powerful framework for simulating complex quantum systems and designing quantum algorithms, particularly for spatial search on graphs, where the goal is to find a marked vertex efficiently. In this work, we present efficient quantum circuits that implement the evolution operator of continuous-time quantum-walk-based search algorithms for three graph families: complete graphs, complete bipartite graphs, and hypercubes. For complete and complete bipartite graphs, our circuits exactly implement the evolution operator. For hypercubes, we propose an approximate implementation that closely matches the exact evolution operator as the number of vertices increases. Our Qiskit simulations demonstrate that even for low-dimensional hypercubes, the algorithm effectively identifies the marked vertex. Furthermore, the approximate implementation developed for hypercubes can be extended to a broad class of graphs, enabling efficient quantum search in scenarios where exact implementations are impractical.<\/jats:p>","DOI":"10.3390\/e27050454","type":"journal-article","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T10:40:48Z","timestamp":1745404848000},"page":"454","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Circuit Implementations of Continuous-Time Quantum Walks for Quantum Search"],"prefix":"10.3390","volume":"27","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0894-4279","authenticated-orcid":false,"given":"Renato","family":"Portugal","sequence":"first","affiliation":[{"name":"National Laboratory of Scientific Computing (LNCC), Av. Getulio Vargas 333, Petr\u00f3polis 25651-075, Brazil"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7428-9896","authenticated-orcid":false,"given":"Jalil Khatibi","family":"Moqadam","sequence":"additional","affiliation":[{"name":"National Laboratory of Scientific Computing (LNCC), Av. Getulio Vargas 333, Petr\u00f3polis 25651-075, Brazil"}]}],"member":"1968","published-online":{"date-parts":[[2025,4,23]]},"reference":[{"key":"ref_1","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_2","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_3","doi-asserted-by":"crossref","first-page":"012305","DOI":"10.1103\/PhysRevA.82.012305","article-title":"Quantum-walk approach to searching on fractal structures","volume":"82","author":"Agliari","year":"2010","journal-title":"Phys. Rev. A"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"032305","DOI":"10.1103\/PhysRevA.93.032305","article-title":"Continuous-time quantum search on balanced trees","volume":"93","author":"Philipp","year":"2016","journal-title":"Phys. Rev. A"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"022310","DOI":"10.1103\/PhysRevA.101.022310","article-title":"Continuous-time quantum-walk spatial search on the Bollob\u00e1s scale-free network","volume":"101","author":"Osada","year":"2020","journal-title":"Phys. Rev. A"},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"043185","DOI":"10.1103\/PhysRevResearch.4.043185","article-title":"Spatial search by continuous-time quantum walks on renormalized Internet networks","volume":"4","author":"Malmi","year":"2022","journal-title":"Phys. Rev. Res."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"169","DOI":"10.4086\/toc.2008.v004a008","article-title":"A Quantum Algorithm for the Hamiltonian NAND Tree","volume":"4","author":"Farhi","year":"2008","journal-title":"Theory Comput."},{"key":"ref_8","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_9","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1126\/science.1229957","article-title":"Universal Computation by Multiparticle Quantum Walk","volume":"339","author":"Childs","year":"2013","journal-title":"Science"},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1038\/s41534-017-0050-2","article-title":"Quantum logic using correlated one-dimensional quantum walks","volume":"4","author":"Lahini","year":"2018","journal-title":"npj Quantum Inf."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"043617","DOI":"10.1103\/PhysRevA.99.043617","article-title":"Experimental realization of a momentum-space quantum walk","volume":"99","author":"Dadras","year":"2019","journal-title":"Phys. Rev. A"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"065301","DOI":"10.1088\/1361-6455\/ab63ad","article-title":"Quantum search with a continuous-time quantum walk in momentum space","volume":"53","author":"Delvecchio","year":"2020","journal-title":"J. Phys. B At. Mol. Opt. Phys."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1524","DOI":"10.1364\/OPTICA.396228","article-title":"Experimental realization of continuous-time quantum walks on directed graphs and their application in PageRank","volume":"7","author":"Wang","year":"2020","journal-title":"Optica"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"054036","DOI":"10.1103\/PhysRevApplied.16.054036","article-title":"Quantum Spatial Search in Two-Dimensional Waveguide Arrays","volume":"16","author":"Benedetti","year":"2021","journal-title":"Phys. Rev. Appl."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"050501","DOI":"10.1103\/PhysRevLett.128.050501","article-title":"Deterministic Search on Star Graphs via Quantum Walks","volume":"128","author":"Qu","year":"2022","journal-title":"Phys. Rev. Lett."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"11511","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_17","doi-asserted-by":"crossref","first-page":"055303","DOI":"10.1088\/1751-8121\/aa53a9","article-title":"Efficient quantum circuits for continuous-time quantum walks on composite graphs","volume":"50","author":"Loke","year":"2017","journal-title":"J. Phys. A Math. Theor."},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Santos, J., Chagas, B., and Chaves, R. (2021). Quantum Walks in a Superconducting Quantum Computer. WQUANTUM, Sociedade Brasileira de Computa\u00e7\u00e3o.","DOI":"10.5753\/wquantum.2021.17223"},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"1687","DOI":"10.1103\/PhysRevA.48.1687","article-title":"Quantum random walks","volume":"48","author":"Aharonov","year":"1993","journal-title":"Phys. Rev. A"},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1007\/s11128-020-02938-5","article-title":"Implementation of quantum walks on IBM quantum computers","volume":"19","author":"Acasiete","year":"2020","journal-title":"Quantum Inf. Process."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1007\/s11128-023-03957-8","article-title":"Quantum circuits for discrete-time quantum walks with position-dependent coin operator","volume":"22","author":"Nzongani","year":"2023","journal-title":"Quantum Inf. Process."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"022408","DOI":"10.1103\/PhysRevA.103.022408","article-title":"Comparison of quantum-walk implementations on noisy intermediate-scale quantum computers","volume":"103","author":"Georgopoulos","year":"2021","journal-title":"Phys. Rev. A"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/s11128-023-03878-6","article-title":"Circuit implementation of discrete-time quantum walks via the shunt decomposition method","volume":"22","year":"2023","journal-title":"Quantum Inf. Process."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Razzoli, L., Cenedese, G., Bondani, M., and Benenti, G. (2024). Efficient Implementation of Discrete-Time Quantum Walks on Quantum Computers. Entropy, 26.","DOI":"10.3390\/e26040313"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Lug\u00e3o, P., Portugal, R., Sabri, M., and Tanaka, H. (2024). Multimarked Spatial Search by Continuous-Time Quantum Walk. ACM Trans. Quantum Comput., 5.","DOI":"10.1145\/3706064"},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"L030201","DOI":"10.1103\/PhysRevA.104.L030201","article-title":"Generalized quantum-classical correspondence for random walks on graphs","volume":"104","author":"Frigerio","year":"2021","journal-title":"Phys. Rev. A"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"062202","DOI":"10.1103\/PhysRevA.103.062202","article-title":"Quantum-walk-based search algorithms with multiple marked vertices","volume":"103","author":"Bezerra","year":"2021","journal-title":"Phys. Rev. A"},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/s11128-023-03842-4","article-title":"Walking on vertices and edges by continuous-time quantum walk","volume":"22","author":"Silva","year":"2023","journal-title":"Quantum Inf. Process."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/5\/454\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:20:18Z","timestamp":1760030418000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/27\/5\/454"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,23]]},"references-count":28,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2025,5]]}},"alternative-id":["e27050454"],"URL":"https:\/\/doi.org\/10.3390\/e27050454","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2025,4,23]]}}}