{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,29]],"date-time":"2025-11-29T16:22:28Z","timestamp":1764433348408,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T00:00:00Z","timestamp":1595980800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T00:00:00Z","timestamp":1595980800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"The National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["No. 11974205","No. 11774197"],"award-info":[{"award-number":["No. 11974205","No. 11774197"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2020,8]]},"DOI":"10.1007\/s11128-020-02773-8","type":"journal-article","created":{"date-parts":[[2020,7,29]],"date-time":"2020-07-29T06:03:44Z","timestamp":1596002624000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["A low failure rate quantum algorithm for searching maximum or minimum"],"prefix":"10.1007","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8325-2817","authenticated-orcid":false,"given":"Yanhu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Shijie","family":"Wei","sequence":"additional","affiliation":[]},{"given":"Xiong","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Cen","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Yinan","family":"Tang","sequence":"additional","affiliation":[]},{"given":"Jian","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Hongxiang","family":"Guo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,7,29]]},"reference":[{"key":"2773_CR1","unstructured":"Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update 2016\u20132021 White Paper, Feb. 2017"},{"key":"2773_CR2","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1007\/BF02650179","volume":"21","author":"RP Feynman","year":"1982","unstructured":"Feynman, R.P.: Simulating physics with computers. Theor. Phys. 21, 467\u2013488 (1982)","journal-title":"Theor. Phys."},{"issue":"1","key":"2773_CR3","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/s11424-019-9008-0","volume":"32","author":"C Shao","year":"2019","unstructured":"Shao, C., Li, Y., Li, H.: Quantum algorithm design: techniques and applications. J. Syst. Sci. Complex. 32(1), 375\u2013452 (2019)","journal-title":"J. Syst. Sci. Complex."},{"issue":"400","key":"2773_CR4","first-page":"97","volume":"1985","author":"D Deutsch","year":"1818","unstructured":"Deutsch, D.: Quantum theory, the Church\u2013Turing principle and the universal quantum computer. Proc. R. Soc. Lond. A Math. Phys. Sci. 1985(400), 97\u2013117 (1818)","journal-title":"Proc. R. Soc. Lond. A Math. Phys. Sci."},{"issue":"439","key":"2773_CR5","first-page":"553","volume":"1992","author":"D Deutsch","year":"1907","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. A 1992(439), 553\u2013558 (1907)","journal-title":"Proc. R. Soc. Lond. A"},{"issue":"2","key":"2773_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1137\/S0036144598347011","volume":"41","author":"PW Shor","year":"1999","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41(2), 303\u2013332 (1999)","journal-title":"SIAM Rev."},{"key":"2773_CR7","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, vol. 6, pp. 212\u2013219. ACM Press, New York, USA (1996)","DOI":"10.1145\/237814.237866"},{"issue":"2","key":"2773_CR8","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":"19","key":"2773_CR9","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":"2773_CR10","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1007\/s11128-018-2046-z","volume":"17","author":"AK Bishwas","year":"2018","unstructured":"Bishwas, A.K., Mani, A., Palade, V.: An all-pair quantum SVM approach for big data multiclass classification. Quantum Inf. Process. 17, 282 (2018)","journal-title":"Quantum Inf. Process."},{"key":"2773_CR11","unstructured":"Kerenidis, I., Prakash, A.: Quantum recommendation systems. In: 8th Innovations in Theoretical Computer Science Conference (ITCS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2017)"},{"issue":"3\u20134","key":"2773_CR12","first-page":"316","volume":"15","author":"N Wiebe","year":"2015","unstructured":"Wiebe, N., Kapoor, A., Svore, K.M.: Quantum algorithms for nearest-neighbor methods for supervised and unsupervised learning. Quantum Inf. Comput. 15(3\u20134), 316\u2013356 (2015)","journal-title":"Quantum Inf. Comput."},{"key":"2773_CR13","unstructured":"Lloyd, S., Mohseni, M., Rebentrost, P.: Quantum algorithms for supervised and unsupervised machine learning (2013). arXiv:1307.0411"},{"key":"2773_CR14","unstructured":"Durr, C., Hoyer, P.: A quantum algorithm for finding the minimum (1996). arXiv:quant-ph\/9607014"},{"issue":"4\u20135","key":"2773_CR15","first-page":"493","volume":"46","author":"M Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., et al.: Tight bounds on quantum searching. Progr. Phys. 46(4\u20135), 493\u2013505 (1998)","journal-title":"Progr. Phys."},{"issue":"15","key":"2773_CR16","doi-asserted-by":"publisher","first-page":"3408","DOI":"10.1103\/PhysRevLett.80.3408","volume":"80","author":"IL Chuang","year":"1998","unstructured":"Chuang, I.L., Gershenfeld, N., Kubinec, M.: Experimental implementation of fast quantum searching. Phys. Rev. Lett. 80(15), 3408 (1998)","journal-title":"Phys. Rev. Lett."},{"issue":"5","key":"2773_CR17","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1063\/1.125846","volume":"76","author":"LMK Vandersypen","year":"2000","unstructured":"Vandersypen, L.M.K., Steffen, M., Sherwood, M.H., et al.: Implementation of a three-quantum-bit search algorithm. Appl. Phys. Lett. 76(5), 646\u2013648 (2000)","journal-title":"Appl. Phys. Lett."},{"issue":"7252","key":"2773_CR18","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1038\/nature08121","volume":"460","author":"L DiCarlo","year":"2009","unstructured":"DiCarlo, L., Chow, J.M., Gambetta, J.M., et al.: Demonstration of two-qubit algorithms with a superconducting quantum processor. Nature 460(7252), 240 (2009)","journal-title":"Nature"},{"issue":"5","key":"2773_CR19","doi-asserted-by":"publisher","first-page":"050306","DOI":"10.1103\/PhysRevA.72.050306","volume":"72","author":"KA Brickman","year":"2005","unstructured":"Brickman, K.A., Haljan, P.C., Lee, P.J., et al.: Implementation of Grover\u2019s quantum search algorithm in a scalable system. Phys. Rev. A 72(5), 050306 (2005)","journal-title":"Phys. Rev. A"},{"issue":"7614","key":"2773_CR20","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1038\/nature18648","volume":"536","author":"S Debnath","year":"2016","unstructured":"Debnath, S., Linke, N.M., Figgatt, C., et al.: Demonstration of a small programmable quantum computer with atomic qubits. Nature 536(7614), 63 (2016)","journal-title":"Nature"},{"issue":"1","key":"2773_CR21","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., et al.: Complete 3-qubit Grover search on a programmable quantum computer. Nat. Commun. 8(1), 1918 (2017)","journal-title":"Nat. Commun."},{"issue":"7030","key":"2773_CR22","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1038\/nature03347","volume":"434","author":"P Walther","year":"2005","unstructured":"Walther, P., Resch, K.J., Rudolph, T., et al.: Experimental one-way quantum computing. Nature 434(7030), 169 (2005)","journal-title":"Nature"},{"issue":"1","key":"2773_CR23","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0375-9601(99)00631-3","volume":"262","author":"GL Long","year":"1999","unstructured":"Long, G.L., Li, Y.S., Zhang, W.L., et al.: Phase matching in quantum searching. Phys. Lett. A 262(1), 27\u201334 (1999)","journal-title":"Phys. Lett. A"},{"issue":"4","key":"2773_CR24","doi-asserted-by":"publisher","first-page":"044301","DOI":"10.1103\/PhysRevA.82.044301","volume":"82","author":"Z Diao","year":"2010","unstructured":"Diao, Z.: Exactness of the original Grover search algorithm. Phys. Rev. A 82(4), 044301 (2010)","journal-title":"Phys. Rev. A"},{"issue":"3\u20134","key":"2773_CR25","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0375-9601(02)00055-5","volume":"294","author":"GL Long","year":"2002","unstructured":"Long, G.L., Li, X., Sun, Y.: Phase matching condition for quantum search with a generalized initial state. Phys. Lett. A 294(3\u20134), 143\u2013152 (2002)","journal-title":"Phys. Lett. A"},{"issue":"5","key":"2773_CR26","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1007\/s11128-012-0498-0","volume":"12","author":"FM Toyama","year":"2013","unstructured":"Toyama, F.M., Van Dijk, W., Nogami, Y.: Quantum search with certainty based on modified Grover algorithms: optimum choice of parameters. Quantum Inf. Process. 12(5), 1897\u20131914 (2013)","journal-title":"Quantum Inf. Process."},{"issue":"4","key":"2773_CR27","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1103\/PhysRevA.60.2742","volume":"60","author":"E Biham","year":"1999","unstructured":"Biham, E., Biham, O., Biron, D., et al.: Grover\u2019s quantum search algorithm for an arbitrary initial amplitude distribution. Phys. Rev. A 60(4), 2742 (1999)","journal-title":"Phys. Rev. A"},{"issue":"3","key":"2773_CR28","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1007\/s10701-015-9968-4","volume":"46","author":"G Castagnoli","year":"2016","unstructured":"Castagnoli, G.: Highlighting the mechanism of the quantum speedup by time-symmetric and relational quantum mechanics. Found. Phys. 46(3), 360\u2013381 (2016)","journal-title":"Found. Phys."},{"issue":"1","key":"2773_CR29","doi-asserted-by":"publisher","first-page":"012310","DOI":"10.1103\/PhysRevA.63.012310","volume":"63","author":"E Biham","year":"2000","unstructured":"Biham, E., Biham, O., Biron, D., et al.: Analysis of generalized Grover quantum search algorithms using recursion equations. Phys. Rev. A 63(1), 012310 (2000)","journal-title":"Phys. Rev. A"},{"issue":"5","key":"2773_CR30","doi-asserted-by":"publisher","first-page":"052304","DOI":"10.1103\/PhysRevA.62.052304","volume":"62","author":"P H\u00f8yer","year":"2000","unstructured":"H\u00f8yer, P.: Arbitrary phases in quantum amplitude amplification. Phys. Rev. A 62(5), 052304 (2000)","journal-title":"Phys. Rev. A"},{"issue":"15","key":"2773_CR31","doi-asserted-by":"publisher","first-page":"150501","DOI":"10.1103\/PhysRevLett.95.150501","volume":"95","author":"LK Grover","year":"2005","unstructured":"Grover, L.K.: Fixed-point quantum search. Phys. Rev. Lett. 95(15), 150501 (2005)","journal-title":"Phys. Rev. Lett."},{"key":"2773_CR32","doi-asserted-by":"crossref","unstructured":"Younes, A., Rowe, J., Miller, J.: Quantum search algorithm with more reliable behaviour using partial diffusion. In: Proceedings of the 7th International Conference on Quantum Communication, Measurement and Computing (2004)","DOI":"10.1063\/1.1834408"},{"issue":"6066","key":"2773_CR33","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1126\/science.1214707","volume":"335","author":"S Barz","year":"2012","unstructured":"Barz, S., Kashefi, E., Broadbent, A., et al.: Demonstration of blind quantum computing. Science 335(6066), 303\u2013308 (2012)","journal-title":"Science"},{"issue":"16","key":"2773_CR34","doi-asserted-by":"publisher","first-page":"160501","DOI":"10.1103\/PhysRevLett.100.160501","volume":"100","author":"V Giovannetti","year":"2008","unstructured":"Giovannetti, V., Lloyd, S., Maccone, L.: Quantum random access memory. Phys. Rev. Lett. 100(16), 160501 (2008)","journal-title":"Phys. Rev. Lett."},{"key":"2773_CR35","volume-title":"Mathematical Statistics with Applications","author":"D Wackerly","year":"2014","unstructured":"Wackerly, D., Mendenhall, W., Scheaffer, R.L.: Mathematical Statistics with Applications. Cengage Learning, Boston (2014)"},{"issue":"5","key":"2773_CR36","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., et al.: Elementary gates for quantum computation. Phys. Rev. A 52(5), 3457 (1995)","journal-title":"Phys. Rev. A"},{"key":"2773_CR37","doi-asserted-by":"crossref","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information: 10th Anniversary (2011)","DOI":"10.1017\/CBO9780511976667"},{"issue":"13","key":"2773_CR38","doi-asserted-by":"publisher","first-page":"134507","DOI":"10.1103\/PhysRevB.81.134507","volume":"81","author":"C Rigetti","year":"2010","unstructured":"Rigetti, C., Devoret, M.: Fully microwave-tunable universal gates in superconducting qubits with linear couplings and fixed transition frequencies. Phys. Rev. B 81(13), 134507 (2010)","journal-title":"Phys. Rev. B"},{"issue":"7747","key":"2773_CR39","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1038\/s41586-019-0980-2","volume":"567","author":"V Havl\u00ed\u010dek","year":"2019","unstructured":"Havl\u00ed\u010dek, V., C\u00f3rcoles, A.D., Temme, K., et al.: Supervised learning with quantum-enhanced feature spaces. Nature 567(7747), 209 (2019)","journal-title":"Nature"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02773-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-020-02773-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-020-02773-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,5]],"date-time":"2022-11-05T00:16:22Z","timestamp":1667607382000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-020-02773-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7,29]]},"references-count":39,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2020,8]]}},"alternative-id":["2773"],"URL":"https:\/\/doi.org\/10.1007\/s11128-020-02773-8","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2020,7,29]]},"assertion":[{"value":"4 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 July 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 July 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"270"}}