{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,2]],"date-time":"2025-10-02T16:26:49Z","timestamp":1759422409772,"version":"3.37.3"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T00:00:00Z","timestamp":1684454400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T00:00:00Z","timestamp":1684454400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100016201","name":"Rome Laboratory","doi-asserted-by":"publisher","award":["SFFP\u201920, SFFP\u201921"],"award-info":[{"award-number":["SFFP\u201920, SFFP\u201921"]}],"id":[{"id":"10.13039\/100016201","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We use the mapping between two computation frameworks, Adiabatic Grover Search (AGS) and Adiabatic Quantum Computing (AQC), to translate the Grover search algorithm into the AQC regime. We then apply Trotterization on the schedule-dependent Hamiltonian of AGS to obtain the values of variational parameters in the Quantum Approximate Optimization Algorithm (QAOA) framework. The goal is to carry the optimal behavior of Grover search algorithm into the QAOA framework without the iterative machine learning processes.<\/jats:p>","DOI":"10.1007\/s11128-023-03968-5","type":"journal-article","created":{"date-parts":[[2023,5,19]],"date-time":"2023-05-19T15:01:48Z","timestamp":1684508508000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Grover search inspired alternating operator ansatz of quantum approximate optimization algorithm for search problems"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8574-1665","authenticated-orcid":false,"given":"Chen-Fu","family":"Chiang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul M.","family":"Alsing","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,5,19]]},"reference":[{"key":"3968_CR1","doi-asserted-by":"publisher","first-page":"4213","DOI":"10.1038\/ncomms5213","volume":"5","author":"A Peruzzo","year":"2014","unstructured":"Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P.J., Aspuru-Guzik, A., Obrien, J.L.: A variational eigenvalue solver on a photonic quantum processor. Nat. Commun. 5, 4213 (2014)","journal-title":"Nat. Commun."},{"key":"3968_CR2","unstructured":"Farhi, E., Goldstone, J., Gutmann, S.: A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028 (2014)"},{"issue":"2","key":"3968_CR3","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1103\/PhysRevA.58.915","volume":"58","author":"E Farhi","year":"1998","unstructured":"Farhi, E., Gutmann, S.: Quantum computation and decision trees. Phys. Rev. A 58(2), 915 (1998)","journal-title":"Phys. Rev. A"},{"issue":"4","key":"3968_CR4","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1080\/00107151031000110776","volume":"44","author":"J Kempe","year":"2003","unstructured":"Kempe, J.: Quantum random walks: an introductory overview. Contemp. Phys. 44(4), 307\u2013327 (2003)","journal-title":"Contemp. Phys."},{"issue":"18","key":"3968_CR5","doi-asserted-by":"publisher","first-page":"180501","DOI":"10.1103\/PhysRevLett.102.180501","volume":"102","author":"AM Childs","year":"2009","unstructured":"Childs, A.M.: Universal computation by quantum walk. Phys. Rev. Lett. 102(18), 180501 (2009)","journal-title":"Phys. Rev. Lett."},{"issue":"4","key":"3968_CR6","doi-asserted-by":"publisher","first-page":"042330","DOI":"10.1103\/PhysRevA.81.042330","volume":"81","author":"NB Lovett","year":"2010","unstructured":"Lovett, N.B., Cooper, S., Everitt, M., Trevers, M., Kendon, V.: Universal quantum computation using the discrete-time quantum walk. Phys. Rev. A 81(4), 042330 (2010)","journal-title":"Phys. Rev. A"},{"issue":"1","key":"3968_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms11511","volume":"7","author":"X Qiang","year":"2016","unstructured":"Qiang, X., Loke, T., Montanaro, A., Aungskunsiri, K., Zhou, X., O\u2019Brien, J.L., Wang, J.B., Matthews, J.C.: Efficient quantum walk on a quantum processor. Nat. Commun. 7(1), 1\u20136 (2016)","journal-title":"Nat. Commun."},{"issue":"1000","key":"3968_CR8","first-page":"1","volume":"1","author":"PW Shor","year":"1998","unstructured":"Shor, P.W.: Quantum computing. Doc. Math. 1(1000), 1 (1998)","journal-title":"Doc. Math."},{"key":"3968_CR9","unstructured":"Yao, A.C.-C.: Quantum circuit complexity. In: Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science, IEEE. pp. 352\u2013361 (1993)."},{"issue":"6085","key":"3968_CR10","doi-asserted-by":"publisher","first-page":"1130","DOI":"10.1126\/science.1217069","volume":"336","author":"SP Jordan","year":"2012","unstructured":"Jordan, S.P., Lee, K.S., Preskill, J.: Quantum algorithms for quantum field theories. Science 336(6085), 1130\u20131133 (2012)","journal-title":"Science"},{"issue":"3","key":"3968_CR11","doi-asserted-by":"publisher","first-page":"1083","DOI":"10.1103\/RevModPhys.80.1083","volume":"80","author":"C Nayak","year":"2008","unstructured":"Nayak, C., Simon, S.H., Stern, A., Freedman, M., Sarma, S.D.: Non-abelian anyons and topological quantum computation. Rev. Mod. Phys. 80(3), 1083 (2008)","journal-title":"Rev. Mod. Phys."},{"issue":"7","key":"3968_CR12","doi-asserted-by":"publisher","first-page":"070502","DOI":"10.1103\/PhysRevLett.99.070502","volume":"99","author":"A Mizel","year":"2007","unstructured":"Mizel, A., Lidar, D.A., Mitchell, M.: Simple proof of equivalence between adiabatic quantum computation and the circuit model. Phys. Rev. Lett. 99(7), 070502 (2007)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"3968_CR13","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/s11128-017-1552-8","volume":"16","author":"C-F Chiang","year":"2017","unstructured":"Chiang, C.-F., Hsieh, C.-Y.: Resonant transition-based quantum computation. Quantum Inf. Process. 16(5), 120 (2017)","journal-title":"Quantum Inf. Process."},{"key":"3968_CR14","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1038\/ncomms2043","volume":"3","author":"T Morimae","year":"2012","unstructured":"Morimae, T., Fujii, K.: Blind topological measurement-based quantum computation. Nat. Commun. 3, 1036 (2012)","journal-title":"Nat. Commun."},{"issue":"22","key":"3968_CR15","doi-asserted-by":"publisher","first-page":"220503","DOI":"10.1103\/PhysRevLett.98.220503","volume":"98","author":"D Gross","year":"2007","unstructured":"Gross, D., Eisert, J.: Novel schemes for measurement-based quantum computation. Phys. Rev. Lett. 98(22), 220503 (2007)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"3968_CR16","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1038\/nphys1157","volume":"5","author":"HJ Briegel","year":"2009","unstructured":"Briegel, H.J., Browne, D.E., D\u00fcr, W., Raussendorf, R., Van den Nest, M.: Measurement-based quantum computation. Nat. Phys. 5(1), 19\u201326 (2009)","journal-title":"Nat. Phys."},{"issue":"2","key":"3968_CR17","doi-asserted-by":"publisher","first-page":"022312","DOI":"10.1103\/PhysRevA.68.022312","volume":"68","author":"R Raussendorf","year":"2003","unstructured":"Raussendorf, R., Browne, D.E., Briegel, H.J.: Measurement-based quantum computation on cluster states. Phys. Rev. A 68(2), 022312 (2003)","journal-title":"Phys. Rev. A"},{"key":"3968_CR18","unstructured":"Shor, P.W.: Algorithms for quantum computation: discrete logarithms and factoring. In: Foundations of Computer Science, 1994 Proceedings., 35th Annual Symposium On, IEEE. pp. 124\u2013134 (1994)"},{"key":"3968_CR19","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the Twenty-eighth Annual ACM Symposium on Theory of Computing, ACM. pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"2","key":"3968_CR20","doi-asserted-by":"publisher","first-page":"1687","DOI":"10.1103\/PhysRevA.48.1687","volume":"48","author":"Y Aharonov","year":"1993","unstructured":"Aharonov, Y., Davidovich, L., Zagury, N.: Quantum random walks. Phys. Rev. A 48(2), 1687 (1993)","journal-title":"Phys. Rev. A"},{"key":"3968_CR21","unstructured":"Lloyd, S.: Quantum approximate optimization is computationally universal. arXiv preprint arXiv:1812.11075 (2018)"},{"issue":"2","key":"3968_CR22","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1137\/120871997","volume":"42","author":"RD Somma","year":"2013","unstructured":"Somma, R.D., Boixo, S.: Spectral gap amplification. SIAM J. Comput. 42(2), 593\u2013610 (2013)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"3968_CR23","first-page":"181","volume":"11","author":"E Farhi","year":"2011","unstructured":"Farhi, E., Goldston, J., Gosset, D., Gutmann, S., Meyer, H.B., Shor, P.: Quantum adiabatic algorithms, small gaps, and different paths. Quantum Inf. Comput. 11(3), 181\u2013214 (2011)","journal-title":"Quantum Inf. Comput."},{"key":"3968_CR24","unstructured":"Farhi, E., Goldstone, J., Gutmann, S., Sipser, M.: Quantum computation by adiabatic evolution. arXiv preprint quant-ph\/0001106 (2000)"},{"issue":"1","key":"3968_CR25","doi-asserted-by":"publisher","first-page":"015002","DOI":"10.1103\/RevModPhys.90.015002","volume":"90","author":"T Albash","year":"2018","unstructured":"Albash, T., Lidar, D.A.: Adiabatic quantum computation. Rev. Mod. Phys. 90(1), 015002 (2018)","journal-title":"Rev. Mod. Phys."},{"key":"3968_CR26","doi-asserted-by":"publisher","first-page":"79","DOI":"10.22331\/q-2018-08-06-79","volume":"2","author":"J Preskill","year":"2018","unstructured":"Preskill, J.: Quantum computing in the NISQ era and beyond. Quantum 2, 79 (2018)","journal-title":"Quantum"},{"issue":"2","key":"3968_CR27","doi-asserted-by":"publisher","first-page":"022309","DOI":"10.1103\/PhysRevA.94.022309","volume":"94","author":"D Wecker","year":"2016","unstructured":"Wecker, D., Hastings, M.B., Troyer, M.: Training a quantum optimizer. Phys. Rev. A 94(2), 022309 (2016)","journal-title":"Phys. Rev. A"},{"key":"3968_CR28","unstructured":"Crooks, G.E.: Performance of the quantum approximate optimization algorithm on the maximum cut problem. arXiv preprint arXiv:1811.08419 (2018)"},{"key":"3968_CR29","unstructured":"Zhou, L., Wang, S.-T., Choi, S., Pichler, H., Lukin, M.D.: Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices. arXiv preprint arXiv:1812.01041 (2018)"},{"key":"3968_CR30","doi-asserted-by":"crossref","unstructured":"Willsch, M., Willsch, D., Jin, F., De\u00a0Raedt, H., Michielsen, K.: Benchmarking the quantum approximate optimization algorithm. arXiv preprint arXiv:1907.02359 (2019)","DOI":"10.1007\/s11128-020-02692-8"},{"key":"3968_CR31","doi-asserted-by":"publisher","first-page":"021067","DOI":"10.1103\/PhysRevX.10.021067","volume":"10","author":"L Zhou","year":"2020","unstructured":"Zhou, L., Wang, S.-T., Choi, S., Pichler, H., Lukin, M.D.: Quantum approximate optimization algorithm: performance, mechanism, and implementation on near-term devices. Phys. Rev. X 10, 021067 (2020). https:\/\/doi.org\/10.1103\/PhysRevX.10.021067","journal-title":"Phys. Rev. X"},{"issue":"4","key":"3968_CR32","doi-asserted-by":"publisher","first-page":"042308","DOI":"10.1103\/PhysRevA.65.042308","volume":"65","author":"J Roland","year":"2002","unstructured":"Roland, J., Cerf, N.J.: Quantum search by local adiabatic evolution. Phys. Rev. A 65(4), 042308 (2002)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"3968_CR33","doi-asserted-by":"publisher","first-page":"062313","DOI":"10.1103\/PhysRevA.93.062313","volume":"93","author":"TG Wong","year":"2016","unstructured":"Wong, T.G., Meyer, D.A.: Irreconcilable difference between quantum walks and adiabatic quantum computing. Phys. Rev. A 93(6), 062313 (2016)","journal-title":"Phys. Rev. A"},{"issue":"5\u20136","key":"3968_CR34","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1016\/0375-9601(92)90335-J","volume":"165","author":"M Suzuki","year":"1992","unstructured":"Suzuki, M.: General theory of higher-order decomposition of exponential operators and symplectic integrators. Phys. Lett. A 165(5\u20136), 387\u2013395 (1992)","journal-title":"Phys. Lett. A"},{"issue":"1","key":"3968_CR35","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s11128-010-0168-z","volume":"10","author":"A Perdomo-Ortiz","year":"2011","unstructured":"Perdomo-Ortiz, A., Venegas-Andraca, S.E., Aspuru-Guzik, A.: A study of heuristic guesses for adiabatic quantum computation. Quantum Inf. Process. 10(1), 33\u201352 (2011)","journal-title":"Quantum Inf. Process."},{"issue":"16","key":"3968_CR36","doi-asserted-by":"publisher","first-page":"165305","DOI":"10.1088\/1751-8113\/49\/16\/165305","volume":"49","author":"L Zeng","year":"2016","unstructured":"Zeng, L., Zhang, J., Sarovar, M.: Schedule path optimization for adiabatic quantum computing and optimization. J. Phys. A: Math. Theor. 49(16), 165305 (2016)","journal-title":"J. Phys. A: Math. Theor."},{"issue":"4","key":"3968_CR37","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1103\/PhysRevA.57.2403","volume":"57","author":"E Farhi","year":"1998","unstructured":"Farhi, E., Gutmann, S.: Analog analogue of a digital quantum computation. Phys. Rev. A 57(4), 2403 (1998)","journal-title":"Phys. Rev. A"},{"key":"3968_CR38","doi-asserted-by":"publisher","DOI":"10.1017\/9781316995433","volume-title":"Introduction to Quantum Mechanics","author":"DJ Griffiths","year":"2018","unstructured":"Griffiths, D.J., Schroeter, D.F.: Introduction to Quantum Mechanics. Cambridge University Press, Cambridge (2018)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-03968-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-023-03968-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-023-03968-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,10]],"date-time":"2023-06-10T15:20:35Z","timestamp":1686410435000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-023-03968-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,5,19]]},"references-count":38,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2023,5]]}},"alternative-id":["3968"],"URL":"https:\/\/doi.org\/10.1007\/s11128-023-03968-5","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2023,5,19]]},"assertion":[{"value":"27 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This work was supported by the Air Force Research Laboratory Summer Faculty Fellowship Program in year 2020 and 2021 under the guidance of Dr. Alsing. The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"221"}}