{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:47:49Z","timestamp":1774122469895,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,7,1]],"date-time":"2021-07-01T00:00:00Z","timestamp":1625097600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000015","name":"u.s. department of energy","doi-asserted-by":"publisher","award":["DE-AC05-00OR22725"],"award-info":[{"award-number":["DE-AC05-00OR22725"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["DMS-1928930"],"award-info":[{"award-number":["DMS-1928930"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000015","name":"u.s. department of energy","doi-asserted-by":"publisher","award":["DE-SC0012704"],"award-info":[{"award-number":["DE-SC0012704"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s11128-021-03165-2","type":"journal-article","created":{"date-parts":[[2021,7,10]],"date-time":"2021-07-10T05:02:30Z","timestamp":1625893350000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["Implementation of efficient quantum search algorithms on NISQ computers"],"prefix":"10.1007","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4819-5495","authenticated-orcid":false,"given":"Kun","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Pooja","family":"Rao","sequence":"additional","affiliation":[]},{"given":"Kwangmin","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Hyunkyung","family":"Lim","sequence":"additional","affiliation":[]},{"given":"Vladimir","family":"Korepin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,10]]},"reference":[{"issue":"7497","key":"3165_CR1","doi-asserted-by":"publisher","first-page":"500","DOI":"10.1038\/nature13171","volume":"508","author":"R Barends","year":"2014","unstructured":"Barends, R., Kelly, J., Megrant, A., Veitia, A., Sank, D., Jeffrey, E., White, T.C., Mutus, J., Fowler, A.G., Campbell, B., et al.: Superconducting quantum circuits at the surface code threshold for fault tolerance. Nature 508(7497), 500 (2014)","journal-title":"Nature"},{"issue":"6","key":"3165_CR2","doi-asserted-by":"publisher","first-page":"060504","DOI":"10.1103\/PhysRevLett.117.060504","volume":"117","author":"CJ Ballance","year":"2016","unstructured":"Ballance, C.J., Harty, T.P., Linke, N.M., Sepiol, M.A., Lucas, D.M.: High-fidelity quantum logic gates using trapped-ion hyperfine qubits. Phys. Rev. Lett. 117(6), 060504 (2016)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"3165_CR3","doi-asserted-by":"publisher","first-page":"1918","DOI":"10.1038\/s41467-017-01904-7","volume":"8","author":"C Figgatt","year":"2017","unstructured":"Figgatt, C., Maslov, D., Landsman, K.A., Linke, N.M., Debnath, S., Monroe, C.: Complete 3-qubit grover search on a programmable quantum computer. Nat. Commun. 8(1), 1918 (2017)","journal-title":"Nat. Commun."},{"key":"3165_CR4","doi-asserted-by":"crossref","unstructured":"Google AI Quantum, et\u00a0al.: Hartree-fock on a superconducting qubit quantum computer. Science 369(6507), 1084\u20131089 (2020)","DOI":"10.1126\/science.abb9811"},{"issue":"7779","key":"3165_CR5","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","volume":"574","author":"F Arute","year":"2019","unstructured":"Arute, F., Arya, K., Babbush, R., Bacon, D., Bardin, J.C., Barends, R., Biswas, R., Sergio, B., Fernando, G.S.L., Buell, D.A., et al.: Quantum supremacy using a programmable superconducting processor. Nature 574(7779), 505\u2013510 (2019)","journal-title":"Nature"},{"issue":"6523","key":"3165_CR6","doi-asserted-by":"crossref","first-page":"1460","DOI":"10.1126\/science.abe8770","volume":"370","author":"H-S Zhong","year":"2020","unstructured":"Zhong, H.-S., Wang, H., Deng, Y.-H., Chen, M.-C., Peng, L.-C., Luo, Y.-H., Qin, J., Wu, D., Ding, X., Hu, Y., et al.: Quantum computational advantage using photons. Science 370(6523), 1460\u20131463 (2020)","journal-title":"Science"},{"key":"3165_CR7","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum computation and quantum information, (2010)","DOI":"10.1017\/CBO9780511976667"},{"key":"3165_CR8","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":"3","key":"3165_CR9","doi-asserted-by":"publisher","first-page":"032328","DOI":"10.1103\/PhysRevA.100.032328","volume":"100","author":"AW Cross","year":"2019","unstructured":"Cross, A.W., Bishop, L.S., Sheldon, S., Nation, P.D., Gambetta, J.M.: Validating quantum computers using randomized model circuits. Phys. Rev. A 100(3), 032328 (2019)","journal-title":"Phys. Rev. A"},{"key":"3165_CR10","doi-asserted-by":"crossref","unstructured":"Bharti, K., Cervera-Lierta, A., Kyaw, T.H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J.S., Menke, T., Mok, W.-K., Sim, S., Kwek, L.-C., Aspuru-Guzik, A.: Noisy intermediate-scale quantum (nisq) algorithms. arXiv preprint arXiv:2101.08448, (2021)","DOI":"10.1103\/RevModPhys.94.015004"},{"issue":"2","key":"3165_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"LK Grover","year":"1997","unstructured":"Grover, L.K.: Quantum mechanics helps in searching for a needle in a haystack. Phys. Rev. Lett. 79(2), 325 (1997)","journal-title":"Phys. Rev. Lett."},{"issue":"12","key":"3165_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/s11128-017-1768-7","volume":"16","author":"PR Giri","year":"2017","unstructured":"Giri, P.R., Korepin, V.E.: A review on quantum search algorithms. Quantum Inf. Process. 16(12), 315 (2017)","journal-title":"Quantum Inf. Process."},{"issue":"5","key":"3165_CR13","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"CH Bennett","year":"1997","unstructured":"Bennett, C.H., Bernstein, E., Brassard, G., Vazirani, U.: Strengths and weaknesses of quantum computing. SIAM J. Comput. 26(5), 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"issue":"7671","key":"3165_CR14","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1038\/nature23474","volume":"549","author":"J Biamonte","year":"2017","unstructured":"Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., Lloyd, S.: Quantum machine learning. Nature 549(7671), 195\u2013202 (2017)","journal-title":"Nature"},{"issue":"4\u20135","key":"3165_CR15","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik: Prog. Phys. 46(4\u20135), 493\u2013505 (1998)","journal-title":"Fortschritte der Physik: Prog. Phys."},{"issue":"4","key":"3165_CR16","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C Zalka","year":"1999","unstructured":"Zalka, C.: Grover\u2019s quantum searching algorithm is optimal. Phys. Rev. A 60(4), 2746 (1999)","journal-title":"Phys. Rev. A"},{"key":"3165_CR17","doi-asserted-by":"crossref","unstructured":"Grassl, M., Langenberg, B., Roetteler, M., Steinwandt, R.: Applying grover\u2019s algorithm to aes: quantum resource estimates. In: Post-Quantum Cryptography, pp. 29\u201343. Springer, (2016)","DOI":"10.1007\/978-3-319-29360-8_3"},{"issue":"12","key":"3165_CR18","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s11128-018-2107-3","volume":"17","author":"P Kim","year":"2018","unstructured":"Kim, P., Han, D., Jeong, K.C.: Time-space complexity of quantum search algorithms in symmetric cryptanalysis: applying to aes and sha-2. Quantum Inf. Process. 17(12), 339 (2018)","journal-title":"Quantum Inf. Process."},{"key":"3165_CR19","doi-asserted-by":"crossref","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing grover oracles for quantum key search on aes and lowmc. In: Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp. 280\u2013310. Springer, (2020)","DOI":"10.1007\/978-3-030-45724-2_10"},{"issue":"4","key":"3165_CR20","doi-asserted-by":"publisher","first-page":"042609","DOI":"10.1103\/PhysRevA.102.042609","volume":"102","author":"Y Wang","year":"2020","unstructured":"Wang, Y., Krstic, P.S.: Prospect of using grover\u2019s search in the noisy-intermediate-scale quantum-computer era. Phys. Rev. A 102(4), 042609 (2020)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"3165_CR21","doi-asserted-by":"publisher","first-page":"032319","DOI":"10.1103\/PhysRevA.72.032319","volume":"72","author":"G Kato","year":"2005","unstructured":"Kato, G.: Grover-algorithm-like operator using only single-qubit gates. Phys. Rev. A 72(3), 032319 (2005)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"3165_CR22","doi-asserted-by":"publisher","first-page":"052307","DOI":"10.1103\/PhysRevA.91.052307","volume":"91","author":"A Tulsi","year":"2015","unstructured":"Tulsi, A.: Faster quantum searching with almost any diffusion operator. Phys. Rev. A 91(5), 052307 (2015)","journal-title":"Phys. Rev. A"},{"issue":"6","key":"3165_CR23","doi-asserted-by":"publisher","first-page":"062317","DOI":"10.1103\/PhysRevA.95.062317","volume":"95","author":"Z Jiang","year":"2017","unstructured":"Jiang, Z., Rieffel, E.G., Wang, Z.: Near-optimal quantum circuit for grover\u2019s unstructured search using a transverse field. Phys. Rev. A 95(6), 062317 (2017)","journal-title":"Phys. Rev. A"},{"key":"3165_CR24","doi-asserted-by":"crossref","unstructured":"Grover, L.K., Radhakrishnan, J.: Is partial quantum search of a database any easier? In: Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures, pp. 186\u2013194. ACM, (2005)","DOI":"10.1145\/1073970.1073997"},{"issue":"44","key":"3165_CR25","doi-asserted-by":"publisher","first-page":"L731","DOI":"10.1088\/0305-4470\/38\/44\/L02","volume":"38","author":"VE Korepin","year":"2005","unstructured":"Korepin, V.E.: Optimization of partial search. J. Phys. A Math. General 38(44), L731 (2005)","journal-title":"J. Phys. A Math. General"},{"key":"3165_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s11128-005-0004-z","volume":"5","author":"VE Korepin","year":"2006","unstructured":"Korepin, V.E., Grover, L.K.: Simple algorithm for partial quantum search. Quantum Inf. Process. 5, 5\u201310 (2006)","journal-title":"Quantum Inf. Process."},{"issue":"5","key":"3165_CR27","doi-asserted-by":"publisher","first-page":"052314","DOI":"10.1103\/PhysRevA.66.052314","volume":"66","author":"LK Grover","year":"2002","unstructured":"Grover, L.K.: Trade-offs in the quantum search algorithm. Phys. Rev. A 66(5), 052314 (2002)","journal-title":"Phys. Rev. A"},{"key":"3165_CR28","doi-asserted-by":"crossref","unstructured":"Bria\u0144ski, M., Gwinner, J., Hlembotskyi, V., Jarnicki, W., Pli\u015b, S., Szady, A.: Introducing structure to expedite quantum search. arXiv preprint arXiv:2006.05828, (2020)","DOI":"10.1103\/PhysRevA.103.062425"},{"issue":"3","key":"3165_CR29","doi-asserted-by":"publisher","first-page":"032346","DOI":"10.1103\/PhysRevA.101.032346","volume":"101","author":"K Zhang","year":"2020","unstructured":"Zhang, K., Korepin, V.E.: Depth optimization of quantum search algorithms beyond grover\u2019s algorithm. Phys. Rev. A 101(3), 032346 (2020)","journal-title":"Phys. Rev. A"},{"key":"3165_CR30","unstructured":"Liu, J., Zhou, H.: Hardware efficient quantum search algorithm. arXiv preprint arXiv:2103.14196, (2021)"},{"key":"3165_CR31","doi-asserted-by":"crossref","unstructured":"Mandviwalla, A., Ohshiro, K., Ji, B.: Implementing grover\u2019s algorithm on the ibm quantum computers. In: 2018 IEEE International Conference on Big Data (Big Data), pp. 2531\u20132537. IEEE, (2018)","DOI":"10.1109\/BigData.2018.8622457"},{"key":"3165_CR32","unstructured":"Gwinner, J., Bria\u0144ski, M., Burkot, W., Czerwi\u0144ski, \u0141., Hlembotskyi, V.: Benchmarking 16-element quantum search algorithms on ibm quantum processors. arXiv preprint arXiv:2007.06539, (2020)"},{"key":"3165_CR33","doi-asserted-by":"crossref","unstructured":"Satoh, T., Ohkura, Y., Van\u00a0Meter, R.: Subdivided phase oracle for nisq search algorithms. arXiv preprint arXiv:2001.06575, (2020)","DOI":"10.1109\/TQE.2020.3012068"},{"key":"3165_CR34","unstructured":"Hlembotskyi, V., Burczy\u0144ski, R., Jarnicki, W., Szady, A., Tu\u0142owiecki, J.: Efficient unstructured search implementation on current ion-trap quantum processors. arXiv preprint arXiv:2010.03841, (2020)"},{"issue":"19","key":"3165_CR35","doi-asserted-by":"publisher","first-page":"4329","DOI":"10.1103\/PhysRevLett.80.4329","volume":"80","author":"LK Grover","year":"1998","unstructured":"Grover, L.K.: Quantum computers can search rapidly by using almost any transformation. Phys. Rev. Lett. 80(19), 4329 (1998)","journal-title":"Phys. Rev. Lett."},{"key":"3165_CR36","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., Hoyer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math. 305, 53\u201374 (2002)","journal-title":"Contemp. Math."},{"issue":"5","key":"3165_CR37","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/s11128-018-1864-3","volume":"17","author":"M Almazrooie","year":"2018","unstructured":"Almazrooie, M., Samsudin, A., Abdullah, R., Mutter, K.N.: Quantum reversible circuit of aes-128. Quantum Inf. Process. 17(5), 112 (2018)","journal-title":"Quantum Inf. Process."},{"key":"3165_CR38","unstructured":"Langenberg, B., Pham, H., Steinwandt, R.: Reducing the cost of implementing aes as a quantum circuit. Technical report, Cryptology ePrint Archive, Report 2019\/854, (2019)"},{"issue":"5","key":"3165_CR39","doi-asserted-by":"publisher","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","volume":"52","author":"A Barenco","year":"1995","unstructured":"Barenco, A., Bennett, C.H., Cleve, R., DiVincenzo, D.P., Margolus, N., Shor, P., Sleator, T., Smolin, J.A., Weinfurter, H.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"3165_CR40","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s11128-006-0024-3","volume":"5","author":"VE Korepin","year":"2006","unstructured":"Korepin, V.E., Liao, J.: Quest for fast partial search algorithm. Quantum Inf. Process. 5(3), 209\u2013226 (2006)","journal-title":"Quantum Inf. Process."},{"issue":"5","key":"3165_CR41","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1143\/PTP.116.783","volume":"116","author":"VE Korepin","year":"2006","unstructured":"Korepin, V.E., Vallilo, B.C.: Group theoretical formulation of a quantum partial search algorithm. Prog. Theor. Phys. 116(5), 783\u2013793 (2006)","journal-title":"Prog. Theor. Phys."},{"issue":"5","key":"3165_CR42","doi-asserted-by":"publisher","first-page":"052313","DOI":"10.1103\/PhysRevA.61.052313","volume":"61","author":"RM Gingrich","year":"2000","unstructured":"Gingrich, R.M., Williams, C.P., Cerf, N.J.: Generalized quantum search with parallelism. Phys. Rev. A 61(5), 052313 (2000)","journal-title":"Phys. Rev. A"},{"issue":"2","key":"3165_CR43","doi-asserted-by":"publisher","first-page":"022311","DOI":"10.1103\/PhysRevA.93.022311","volume":"93","author":"D Maslov","year":"2016","unstructured":"Maslov, D.: Advantages of using relative-phase toffoli gates with an application to multiple control toffoli optimization. Phys. Rev. A 93(2), 022311 (2016)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"3165_CR44","first-page":"361","volume":"4","author":"G Song","year":"2004","unstructured":"Song, G., Klappenecker, A.: Optimal realizations of simplified toffoli gates. Quantum Inf. Comput. 4(5), 361\u2013372 (2004)","journal-title":"Quantum Inf. Comput."},{"key":"3165_CR45","doi-asserted-by":"crossref","unstructured":"Tannu, S.S., Qureshi, M.: Ensemble of diverse mappings: Improving reliability of quantum computers by orchestrating dissimilar mistakes. In: Proceedings of the 52nd Annual IEEE\/ACM International Symposium on Microarchitecture, pp. 253\u2013265 (2019)","DOI":"10.1145\/3352460.3358257"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03165-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-021-03165-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03165-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T16:07:22Z","timestamp":1672762042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-021-03165-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7]]},"references-count":45,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["3165"],"URL":"https:\/\/doi.org\/10.1007\/s11128-021-03165-2","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"value":"1570-0755","type":"print"},{"value":"1573-1332","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,7]]},"assertion":[{"value":"21 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 July 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"233"}}