{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:26:56Z","timestamp":1740137216542,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2018,4,28]],"date-time":"2018-04-28T00:00:00Z","timestamp":1524873600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s11128-018-1907-9","type":"journal-article","created":{"date-parts":[[2018,4,28]],"date-time":"2018-04-28T11:49:06Z","timestamp":1524916146000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Quantum partial search for uneven distribution of multiple target items"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4819-5495","authenticated-orcid":false,"given":"Kun","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vladimir","family":"Korepin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,4,28]]},"reference":[{"key":"1907_CR1","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 (1996)","DOI":"10.1145\/237814.237866"},{"key":"1907_CR2","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, 325 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"1907_CR3","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1145\/992287.992296","volume":"35","author":"A Ambainis","year":"2004","unstructured":"Ambainis, A.: Quantum search algorithms. ACM SIGACT News 35, 22\u201335 (2004)","journal-title":"ACM SIGACT News"},{"key":"1907_CR4","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, 315 (2017)","journal-title":"Quantum Inf. Process."},{"key":"1907_CR5","volume-title":"Quantum Computation and Quantum Information","author":"MA Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"1907_CR6","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, 3408 (1998)","journal-title":"Phys. Rev. Lett."},{"key":"1907_CR7","doi-asserted-by":"crossref","unstructured":"Brassard, G., H\u00f8yer, P., Tapp, A.: Quantum counting. In: Automata, Languages and Programming, 820\u2013831 (1998)","DOI":"10.1007\/BFb0055105"},{"key":"1907_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1090\/conm\/305\/05215","volume":"305","author":"G Brassard","year":"2002","unstructured":"Brassard, G., H\u00f8yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. Contemp. Math. 305, 53\u201374 (2002)","journal-title":"Contemp. Math."},{"key":"1907_CR9","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s002000050134","volume":"10","author":"NJ Cerf","year":"2000","unstructured":"Cerf, N.J., Grover, L.K., Williams, C.P.: Nested quantum search and NP-hard problems. Appl. Algebra Eng. Commun. Comput. 10, 311\u2013338 (2000)","journal-title":"Appl. Algebra Eng. Commun. Comput."},{"key":"1907_CR10","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10994-012-5316-5","volume":"90","author":"E A\u00efmeur","year":"2013","unstructured":"A\u00efmeur, E., Brassard, G., Gambs, S.: Quantum speed-up for unsupervised learning. Mach. Learn. 90, 261\u2013287 (2013)","journal-title":"Mach. Learn."},{"key":"1907_CR11","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, 195 (2017)","journal-title":"Nature"},{"key":"1907_CR12","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, 1510\u20131523 (1997)","journal-title":"SIAM J. Comput."},{"key":"1907_CR13","doi-asserted-by":"publisher","first-page":"2746","DOI":"10.1103\/PhysRevA.60.2746","volume":"60","author":"C Zalka","year":"1999","unstructured":"Zalka, C.: Grovers quantum searching algorithm is optimal. Phys. Rev. A 60, 2746 (1999)","journal-title":"Phys. Rev. A"},{"key":"1907_CR14","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, 2403 (1998)","journal-title":"Phys. Rev. A"},{"key":"1907_CR15","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, 042308 (2002)","journal-title":"Phys. Rev. A"},{"key":"1907_CR16","doi-asserted-by":"publisher","first-page":"052307","DOI":"10.1103\/PhysRevA.67.052307","volume":"67","author":"N Shenvi","year":"2003","unstructured":"Shenvi, N., Kempe, J., Whaley, K.B.: Quantum random-walk search algorithm. Phys. Rev. A 67, 052307 (2003)","journal-title":"Phys. Rev. A"},{"key":"1907_CR17","unstructured":"Ambainis, A., Kempe, J., Rivosh, A.: Coins make quantum walks faster. In: Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1099-1108 (2005)"},{"key":"1907_CR18","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, ACM (2005)","DOI":"10.1145\/1073970.1073997"},{"key":"1907_CR19","unstructured":"Heiligman, M.: Finding matches between two databases on a quantum computer. arXiv preprint quant-ph\/0006136 (2000)"},{"key":"1907_CR20","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."},{"key":"1907_CR21","doi-asserted-by":"publisher","first-page":"731","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. Gene. 38, 731 (2005)","journal-title":"J. Phys. A: Math. Gene."},{"key":"1907_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11128-006-0037-y","volume":"6","author":"BS Choi","year":"2007","unstructured":"Choi, B.S., Walker, T.A., Braunstein, S.L.: Sure success partial search. Quantum Inf. Process. 6, 1\u20138 (2007)","journal-title":"Quantum Inf. Process."},{"key":"1907_CR23","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, 209\u2013226 (2006)","journal-title":"Quantum Inf. Process."},{"key":"1907_CR24","doi-asserted-by":"publisher","first-page":"5187","DOI":"10.1142\/S0217979207038344","volume":"21","author":"VE Korepin","year":"2007","unstructured":"Korepin, V.E., Xu, Y.: Hierarchical quantum search. Int. J. Mod. Phys. B 21, 5187\u20135205 (2007)","journal-title":"Int. J. Mod. Phys. B"},{"key":"1907_CR25","doi-asserted-by":"publisher","first-page":"5727","DOI":"10.1142\/S0217979209054922","volume":"23","author":"VE Korepin","year":"2009","unstructured":"Korepin, V.E., Xu, Y.: Quantum search algorithms. Int. J. Mod. Phys. B 23, 5727\u20135758 (2009)","journal-title":"Int. J. Mod. Phys. B"},{"key":"1907_CR26","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, 783\u2013793 (2006)","journal-title":"Prog. Theor. Phys."},{"key":"1907_CR27","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching, arXiv preprint quant-ph\/9605034 (1996)"},{"key":"1907_CR28","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s11128-007-0056-3","volume":"6","author":"B-S Choi","year":"2007","unstructured":"Choi, B.-S., Korepin, V.E.: Quantum partial search of a database with several target items. Quantum Inf. Process. 6, 243\u2013254 (2007)","journal-title":"Quantum Inf. Process."},{"key":"1907_CR29","doi-asserted-by":"publisher","first-page":"020301","DOI":"10.1088\/0256-307X\/26\/4\/049401","volume":"26","author":"P-C Zhong","year":"2009","unstructured":"Zhong, P.-C., Bao, W.-S., Wei, Y.: Quantum partial searching algorithm of a database with several target items. Chin. Phys. Lett. 26, 020301 (2009)","journal-title":"Chin. Phys. Lett."}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11128-018-1907-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1907-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-018-1907-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T19:05:22Z","timestamp":1556391922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11128-018-1907-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,4,28]]},"references-count":29,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["1907"],"URL":"https:\/\/doi.org\/10.1007\/s11128-018-1907-9","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2018,4,28]]},"assertion":[{"value":"30 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 April 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 April 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"143"}}