{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,18]],"date-time":"2026-06-18T21:30:17Z","timestamp":1781818217772,"version":"3.54.5"},"reference-count":58,"publisher":"MDPI AG","issue":"7","license":[{"start":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T00:00:00Z","timestamp":1657497600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>We study an oracle operation, along with its circuit design, which combined with the Grover diffusion operator boosts the probability of finding the minimum or maximum solutions on a weighted directed graph. We focus on the geometry of sequentially connected bipartite graphs, which naturally gives rise to solution spaces describable by Gaussian distributions. We then demonstrate how an oracle that encodes these distributions can be used to solve for the optimal path via amplitude amplification. And finally, we explore the degree to which this algorithm is capable of solving cases that are generated using randomized weights, as well as a theoretical application for solving the Traveling Salesman problem.<\/jats:p>","DOI":"10.3390\/e24070963","type":"journal-article","created":{"date-parts":[[2022,7,11]],"date-time":"2022-07-11T21:57:53Z","timestamp":1657576673000},"page":"963","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Gaussian Amplitude Amplification for Quantum Pathfinding"],"prefix":"10.3390","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7664-9194","authenticated-orcid":false,"given":"Daniel","family":"Koch","sequence":"first","affiliation":[{"name":"Air Force Research Lab, Information Directorate, Rome, NY 13441, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Massimiliano","family":"Cutugno","sequence":"additional","affiliation":[{"name":"Air Force Research Lab, Information Directorate, Rome, NY 13441, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Samuel","family":"Karlson","sequence":"additional","affiliation":[{"name":"Air Force Academy, Colorado Springs, CO 80840, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saahil","family":"Patel","sequence":"additional","affiliation":[{"name":"Air Force Research Lab, Information Directorate, Rome, NY 13441, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laura","family":"Wessing","sequence":"additional","affiliation":[{"name":"Air Force Research Lab, Information Directorate, Rome, NY 13441, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul M.","family":"Alsing","sequence":"additional","affiliation":[{"name":"Air Force Research Lab, Information Directorate, Rome, NY 13441, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"1968","published-online":{"date-parts":[[2022,7,11]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Grover, L.K. (1996). A fast quantum mechanical algorithm for database search. arXiv.","DOI":"10.1145\/237814.237866"},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","article-title":"Tight bounds on quantum searching","volume":"46","author":"Boyer","year":"1998","journal-title":"Fortschr. Phys."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"1510","DOI":"10.1137\/S0097539796300933","article-title":"Strengths and Weaknesses of Quantum Computing","volume":"26","author":"Bennett","year":"1997","journal-title":"Siam J. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Farhi, E., and Gutmann, S. (1998). Analog analogue of a digital quantum computation. Phys. Rev. A, 57.","DOI":"10.1103\/PhysRevA.57.2403"},{"key":"ref_5","unstructured":"Brassard, G., Hoyer, P., and Tapp, A. (1998, January 13\u201317). Quantum Counting. Proceedings of the LNCS 1443: 25th International Colloquium on Automata, Languages, and Programming (ICALP), Aalborg, Denmark."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1090\/conm\/305\/05215","article-title":"Quantum Amplitude Amplification and Estimation","volume":"305","author":"Brassard","year":"2002","journal-title":"Ams Contemp. Math."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Childs, A.M., and Goldstone, J. (2004). Spatial search by quantum walk. Phys. Rev. A, 70.","DOI":"10.1103\/PhysRevA.70.022314"},{"key":"ref_8","unstructured":"Ambainis, A. (2010). Variable time amplitude amplification and a faster quantum algorithm for solving systems of linear equations. arXiv."},{"key":"ref_9","unstructured":"Singleton, R.L., Rogers, M.L., and Ostby, D.L. (2021). Grover\u2019s Algorithm with Diffusion and Amplitude Steering. arXiv."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Kwon, H., and Bae, J. (2021). Quantum amplitude-amplification operators. Phys. Rev. A, 104.","DOI":"10.1103\/PhysRevA.104.062438"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Lloyd, S. (1999). Quantum search without entanglement. Phys. Rev. A, 61.","DOI":"10.1103\/PhysRevA.61.010301"},{"key":"ref_12","unstructured":"Viamontes, G.F., Markov, I.L., and Hayes, J.P. (2004). Is Quantum Search Practical?. arXiv."},{"key":"ref_13","unstructured":"Regev, O., and Schiff, L. (2012). Impossibility of a Quantum Speed-up with a Faulty Oracle. arXiv."},{"key":"ref_14","unstructured":"Seidel, R., Becker, C.K.-U., Bock, S., Tcholtchev, N., Gheorge-Pop, I.-D., and Hauswirth, M. (2021). Automatic Generation of Grover Quantum Oracles for Arbitrary Data Structures. arXiv."},{"key":"ref_15","unstructured":"Nielsen, M.A., and Chuang, I.L. (2000). Quantum Computation and Quantum Information, Cambridge University Press."},{"key":"ref_16","doi-asserted-by":"crossref","unstructured":"Long, G.L., Zhang, W.L., Li, Y.S., and Niu, L. (1999). Arbitrary Phase Rotation of the Marked State Cannot Be Used for Grover\u2019s Quantum Search Algorithm. Commun. Theor. Phys., 32.","DOI":"10.1088\/0253-6102\/32\/3\/335"},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/S0375-9601(99)00631-3","article-title":"Phase matching in quantum searching","volume":"262","author":"Long","year":"1999","journal-title":"Phys. Lett. A"},{"key":"ref_18","doi-asserted-by":"crossref","unstructured":"Hoyer, P. (2000). Arbitrary phases in quantum amplitude amplification. Phys. Rev. A, 62.","DOI":"10.1103\/PhysRevA.62.052304"},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Younes, A. (2013). Towards More Reliable Fixed Phase Quantum Search Algorithm. Appl. Math. Inf. Sci., 1.","DOI":"10.12785\/amis\/070110"},{"key":"ref_20","doi-asserted-by":"crossref","unstructured":"Li, T., Bao, W.-S., Lin, W.-Q., Zhang, H., and Fu, X.-Q. (2014). Quantum Search Algorithm Based on Multi-Phase. Chinese Phys. Lett., 31.","DOI":"10.1088\/0256-307X\/31\/5\/050301"},{"key":"ref_21","doi-asserted-by":"crossref","unstructured":"Guo, Y., Shi, W., Wang, Y., and Hu, J. (2017). Q-Learning-Based Adjustable Fixed-Phase Quantum Grover Search Algorithm. J. Phys. Soc. Jpn., 86.","DOI":"10.7566\/JPSJ.86.024006"},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1140\/epjd\/e2003-00030-0","article-title":"Computational leakage: Grover\u2019s algorithm with imperfections","volume":"23","author":"Song","year":"2003","journal-title":"Eur. Phys. J. D"},{"key":"ref_23","first-page":"131","article-title":"Phase diagram for the Grover algorithm with static imperfections","volume":"31","author":"Pomeransky","year":"2004","journal-title":"Eur. Phys. J. D-At. Mol. Opt. Plasma Phys."},{"key":"ref_24","doi-asserted-by":"crossref","unstructured":"Janmark, J., Meyer, D.A., and Wong, T.G. (2014). Global Symmetry is Unnecessary for Fast Quantum Search. Phys. Rev. Lett., 112.","DOI":"10.1103\/PhysRevLett.112.210502"},{"key":"ref_25","doi-asserted-by":"crossref","unstructured":"Gutin, G., and Punnen, A.P. (2007). The Traveling Salesman Problem and Its Variations, Springer.","DOI":"10.1007\/b101971"},{"key":"ref_26","unstructured":"Srinivasan, K., Satyajit, S., Behera, B.K., and Panigrahi, P.K. (2018). Efficient quantum algorithm for solving travelling salesman problem: An IBM quantum experience. arXiv."},{"key":"ref_27","doi-asserted-by":"crossref","unstructured":"Moylett, D.J., Linden, N., and Montanaro, A. (2017). Quantum speedup of the traveling-salesman problem for bounded-degree graphs. Phys. Rev. A, 95.","DOI":"10.1103\/PhysRevA.95.032323"},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Marto\u0148\u00e1k, R., Santoro, G.E., and Tosatti, E. (2004). Quantum annealing of the traveling-salesman problem. Phys. Rev. E, 70.","DOI":"10.1103\/PhysRevE.70.057701"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1781","DOI":"10.1007\/s11128-012-0490-8","article-title":"Adapting the traveling salesman problem to an adiabatic quantum computer","volume":"12","author":"Warren","year":"2013","journal-title":"Quantum Inf. Process."},{"key":"ref_30","doi-asserted-by":"crossref","unstructured":"Warren, R.H. (2020). Solving the traveling salesman problem on a quantum annealer. SN Appl. Sci., 2.","DOI":"10.1007\/s42452-019-1829-x"},{"key":"ref_31","doi-asserted-by":"crossref","unstructured":"Chen, H., Kong, X., Chong, B., Qin, G., Zhou, X., Peng, X., and Du, J. (2011). Experimental demonstration of a quantum annealing algorithm for the traveling salesman problem in a nuclear-magnetic-resonance quantum simulator. Phys. Rev. A, 83.","DOI":"10.1103\/PhysRevA.83.032314"},{"key":"ref_32","doi-asserted-by":"crossref","unstructured":"Bang, J., Yoo, S., Lim, J., Ryu, J., Lee, C., and Lee, J. (2012). Quantum heuristic algorithm for traveling salesman problem. J. Korean Phys. Soc., 61.","DOI":"10.3938\/jkps.61.1944"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"622","DOI":"10.1038\/nature22986","article-title":"On-chip generation of high-dimensional entangled quantum states and their coherent control","volume":"546","author":"Kues","year":"2017","journal-title":"Nature"},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"Low, P.J., White, B.M., Cox, A.A., Day, M.L., and Senko, C. (2020). Practical trapped-ion protocols for universal qudit-based quantum computing. Phys. Rev. Res., 2.","DOI":"10.1103\/PhysRevResearch.2.033128"},{"key":"ref_35","doi-asserted-by":"crossref","unstructured":"Yurtalan, M.A., Shi, J., Kononenko, M., Lupascu, A., and Ashhab, S. (2020). Implementation of a Walsh-Hadamard gate in a superconducting qutrit. Phys. Rev. Lett., 125.","DOI":"10.1103\/PhysRevLett.125.180504"},{"key":"ref_36","doi-asserted-by":"crossref","unstructured":"Lu, H.-H., Hu, Z., Alshaykh, M.S., Moore, A.J., Wang, Y., Imany, P., Weiner, A.M., and Kais, S. (2019). Quantum Phase Estimation with Time-Frequency Qudits in a Single Photon. Adv. Quantum Technol., 3.","DOI":"10.1002\/qute.201900074"},{"key":"ref_37","doi-asserted-by":"crossref","unstructured":"Niu, M.Y., Chuang, I.L., and Shapiro, J.H. (2018). Qudit-Basis Universal Quantum Computation Using \u03c72 Interactions. Phys. Rev. Lett., 120.","DOI":"10.1103\/PhysRevLett.120.160502"},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"1712","DOI":"10.1007\/s11433-014-5551-9","article-title":"Universal quantum computation with qudits","volume":"57","author":"Luo","year":"2014","journal-title":"Sci. China Phys. Mech. Astron."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Li, B., Yu, Z.-H., and Fei, S.-M. (2013). Geometry of Quantum Computation with Qutrits. Sci. Rep., 3.","DOI":"10.1038\/srep02594"},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1038\/nphys1150","article-title":"Quantum computing using shortcuts through higher dimensions","volume":"5","author":"Lanyon","year":"2009","journal-title":"Nat. Phys."},{"key":"ref_41","doi-asserted-by":"crossref","unstructured":"Gokhale, P., Baker, J.M., Duckering, C., Brown, N.C., Brown, K.R., and Chong, F.T. (2019, January 22\u201326). Asymptotic improvements to quantum circuits via qutrits. Proceedings of the ISCA \u201819: 46th International Symposium on Computer Architecture, Phoenix, AZ, USA.","DOI":"10.1145\/3307650.3322253"},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1016\/j.tcs.2006.09.006","article-title":"Synthesis of multi-qudit Hybrid and d-valued Quantum Logic Circuits by Decomposition","volume":"367","author":"Khan","year":"2006","journal-title":"Theor. Comput. Sci."},{"key":"ref_43","doi-asserted-by":"crossref","unstructured":"Muthukrishnan, A., and Stroud, C.R. (2000). Multi-valued Logic Gates for Quantum Computation. Phys. Rev. A, 62.","DOI":"10.1103\/PhysRevA.62.052309"},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"2525","DOI":"10.1088\/0305-4470\/36\/10\/312","article-title":"Quantum gates on hybrid qudits","volume":"36","author":"Daboul","year":"2003","journal-title":"J. Phys. A Math. Gen."},{"key":"ref_45","doi-asserted-by":"crossref","unstructured":"Blok, M.S., Ramasesh, V.V., Schuster, T., O\u2019Brien, K., Kreikebaum, J.M., Dahlen, D., Morvan, A., Yoshida, B., Yao, N.Y., and Siddiqi, I. (2021). Quantum Information Scrambling on a Superconducting Qutrit Processor. Phys. Rev. X, 11.","DOI":"10.1103\/PhysRevX.11.021010"},{"key":"ref_46","doi-asserted-by":"crossref","unstructured":"Hu, X.-M., Zhang, C., Liu, B.-H., Cai, Y., Ye, X.-J., Guo, Y., Xing, W.-B., Huang, C.-X., Huang, Y.-F., and Li, C.-F. (2020). Experimental High-Dimensional Quantum Teleportation. Phys. Rev. Lett., 125.","DOI":"10.1103\/PhysRevLett.125.230501"},{"key":"ref_47","unstructured":"Laplace, P.S. (1810). M\u00e9moire sur les approximations des formules qui sont fonctions de tr\u00e8s grands nombres et sur leur application aux probabilit\u00e9s. M\u00e9moires de l\u2019Acad\u00e9mie Royale des Sciences de Paris, Baudouin."},{"key":"ref_48","unstructured":"Bernoulli, J. (1713). Ars Conjectandi, Thurnisiorum."},{"key":"ref_49","unstructured":"Gauss, C.F. (1809). Theoria Motus Corporum Coelestium in Sectionibus Conicis Solem Ambientium, I.H. Besser."},{"key":"ref_50","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TQE.2020.3012068","article-title":"Subdivided Phase Oracle for NISQ Search Algorithms","volume":"1","author":"Satoh","year":"2020","journal-title":"IEEE Trans. Quantum Eng."},{"key":"ref_51","doi-asserted-by":"crossref","unstructured":"Benchasattabuse, N., Satoh, T., Hajdu\u0161ek, M., and Meter, R.V. (2022). Amplitude Amplification for Optimization via Subdivided Phase Oracle. arXiv.","DOI":"10.1109\/QCE53715.2022.00020"},{"key":"ref_52","unstructured":"Shyamsundar, P. (2021). Non-Boolean Quantum Amplitude Amplification and Quantum Mean Estimation. arXiv."},{"key":"ref_53","unstructured":"Koch, D., Wessing, L., and Alsing, P.M. (2019). Introduction to Coding Quantum Algorithms: A Tutorial Series Using Qiskit. arXiv."},{"key":"ref_54","doi-asserted-by":"crossref","unstructured":"Wang, Y., Hu, Z., Sanders, B.C., and Kais, S. (2020). Qudits and High-Dimensional Quantum Computing. Front. Phys., 10.","DOI":"10.3389\/fphy.2020.589504"},{"key":"ref_55","unstructured":"Farhi, E., Goldstone, J., and Gutmann, S. (2014). A Quantum Approximate Optimization Algorithm. arXiv."},{"key":"ref_56","doi-asserted-by":"crossref","unstructured":"Hadfield, S., Wang, Z., O\u2019Gorman, B., Rieffel, E.G., Venturelli, D., and Biswas, R. (2019). From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz. Algorithms, 12.","DOI":"10.3390\/a12020034"},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, Z.-Q., Love, P.J., Aspuru-Guzik, A., and O\u2019Brien, J.L. (2014). A variational eigenvalue solver on a quantum processor. Nat. Commun., 5.","DOI":"10.1038\/ncomms5213"},{"key":"ref_58","unstructured":"(2021, April 10). IBM 7-Qubit Casablanca and Lagos Architectures. Available online: https:\/\/quantum-computing.ibm.com."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/7\/963\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T23:48:22Z","timestamp":1760140102000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/24\/7\/963"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,11]]},"references-count":58,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2022,7]]}},"alternative-id":["e24070963"],"URL":"https:\/\/doi.org\/10.3390\/e24070963","relation":{},"ISSN":["1099-4300"],"issn-type":[{"value":"1099-4300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,11]]}}}