{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T11:39:17Z","timestamp":1761824357655,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T00:00:00Z","timestamp":1651017600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T00:00:00Z","timestamp":1651017600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61701229","61901218"],"award-info":[{"award-number":["61701229","61901218"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62071015"],"award-info":[{"award-number":["62071015"]}],"id":[{"id":"10.13039\/501100001809","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":[[2022,5]]},"DOI":"10.1007\/s11128-022-03496-8","type":"journal-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T09:03:09Z","timestamp":1651050189000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Quantum partial search algorithm with smaller oracles for multiple target items"],"prefix":"10.1007","volume":"21","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6105-7279","authenticated-orcid":false,"given":"Dan","family":"Li","sequence":"first","affiliation":[]},{"given":"Ling","family":"Qian","sequence":"additional","affiliation":[]},{"given":"Yu-Qian","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Yu-Guang","family":"Yang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,27]]},"reference":[{"key":"3496_CR1","doi-asserted-by":"crossref","unstructured":"Grover, L.K.: A fast quantum mechanical algorithm for database search. In: STOC \u201996: Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing (1996)","DOI":"10.1145\/237814.237866"},{"key":"3496_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 1997PRL 79,2. Phys. Rev. Lett. 79, 325 (1997)","journal-title":"Phys. Rev. Lett."},{"key":"3496_CR3","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"PW Shor","year":"1997","unstructured":"Shor, P.W.: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J. Sci. Stat. Comput. 26, 1484 (1997)","journal-title":"SIAM J. Sci. Stat. Comput."},{"issue":"2","key":"3496_CR4","doi-asserted-by":"publisher","first-page":"022301","DOI":"10.1103\/PhysRevA.99.022301","volume":"99","author":"CH Yu","year":"2019","unstructured":"Yu, C.H., Gao, F., Liu, C.H., Huynh, D., Reynolds, M., Wang, J.B.: Quantum algorithm for visual tracking. Phys. Rev. A. 99(2), 022301 (2019)","journal-title":"Phys. Rev. A."},{"issue":"2","key":"3496_CR5","doi-asserted-by":"publisher","first-page":"022301","DOI":"10.1103\/PhysRevA.99.022301","volume":"99","author":"CH Yu","year":"2019","unstructured":"Yu, C.H., Gao, F., Lin, S., Wang, J.B.: Quantum data compression by principal component analysis. Phys. Rev. A 99(2), 022301 (2019)","journal-title":"Phys. Rev. A"},{"key":"3496_CR6","first-page":"858","volume":"33","author":"CH Yu","year":"2021","unstructured":"Yu, C.H., Gao, F., Wen, Q.Y.: An improved quantum algorithm for ridge regression. IEEE Trans. Knowl. Data Eng. 33, 858\u2013866 (2021)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"3496_CR7","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/s11128-021-03062-8","volume":"20","author":"GB Xu","year":"2021","unstructured":"Xu, G.B., Jiang, D.H.: Novel methods to construct nonlocal sets of orthogonal product states in an arbitrary bipartite high dimensional system. Quantum Inf. Process. 20, 128 (2021)","journal-title":"Quantum Inf. Process."},{"key":"3496_CR8","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1038\/s41598-017-18566-6","volume":"8","author":"D Li","year":"2018","unstructured":"Li, D., Yang, Y.G., Bi, J.L., Yuan, J.B., Xu, J.: Controlled alternate quantum walks based quantum hash function. Sci. Rep. 8, 225 (2018)","journal-title":"Sci. Rep."},{"key":"3496_CR9","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/s11128-019-2534-9","volume":"19","author":"D Li","year":"2020","unstructured":"Li, D., Liu, Y., Yang, Y.G., Xu, J., Yuan, J.B.: Szegedy quantum walks with memory on regular graphs. Quantum Inf. Process. 19, 32 (2020)","journal-title":"Quantum Inf. Process."},{"key":"3496_CR10","doi-asserted-by":"crossref","unstructured":"Pellet-Mary, A., Stehle, D.: On the Hardness of the NTRU Problem. In: Tibouchi M., Wang H. (eds) Advances in Cryptology, ASIACRYPT 2021. Lecture Notes in Computer Science, vol. 13090. Springer, Cham. (2021)","DOI":"10.1007\/978-3-030-92062-3_1"},{"key":"3496_CR11","doi-asserted-by":"crossref","unstructured":"Buchmann, J., Dahmen, E., Hulsing, A.: XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions. In: Yang BY. (eds) Post-Quantum Cryptography. PQCrypto 2011. Lecture Notes in Computer Science, vol. 7071. Springer, Berlin (2011)","DOI":"10.1007\/978-3-642-25405-5_8"},{"key":"3496_CR12","doi-asserted-by":"crossref","unstructured":"Chen, L., Jordan, S., Liu, Y., Moody, D., Peralta, R., Perlner, R., Smith-Tone, D.: Report on Post-Quantum Cryptography. MD, NIST Interagency\/Internal Report (NISTIR), National Institute of Standards and Technology, Gaithersburg (2016)","DOI":"10.6028\/NIST.IR.8105"},{"key":"3496_CR13","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, 339 (2018)","journal-title":"Quantum Inf. Process."},{"key":"3496_CR14","doi-asserted-by":"crossref","unstructured":"Jaques, S., Naehrig, M., Roetteler, M., Virdia, F.: Implementing Grover oracles for quantum key search on AES and LowMC arXiv:1910.01700 [quant-ph] (2019)","DOI":"10.1007\/978-3-030-45724-2_10"},{"key":"3496_CR15","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 2005. Quantum Inf. Process. 5, 5\u201310 (2006)","journal-title":"Quantum Inf. Process."},{"key":"3496_CR16","doi-asserted-by":"crossref","unstructured":"Grover, L.K., Radhakrishnan, J.: Is partial quantum search of a database any easier. arXiv:quant-ph\/0407122 (2004)","DOI":"10.1145\/1073970.1073997"},{"key":"3496_CR17","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s11128-007-0056-3","volume":"6","author":"BS Choi","year":"2007","unstructured":"Choi, B.S., Korepin, V.E.: Quantum partial search of a database with several target items 2007. Quantum Inf. Process. 6, 243 (2007)","journal-title":"Quantum Inf. Process."},{"key":"3496_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s11128-018-1907-9","volume":"17","author":"K Zhang","year":"2018","unstructured":"Zhang, K., Korepin, V.: Quantum partial search for uneven distribution of multiple target items2018. Quantum Inf. Process. 17, 143 (2018)","journal-title":"Quantum Inf. Process."},{"key":"3496_CR19","doi-asserted-by":"publisher","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\u2019 algorithm. Phys. Rev. A 101, 032346 (2020)","journal-title":"Phys. Rev. A"},{"key":"3496_CR20","unstructured":"Farhi, E., Gutmann, S.: Quantum Mechanical Square Root Speedup in a Structured Search Problem. arXiv:9771.1035 [quant-ph] (1997)"},{"key":"3496_CR21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.98.012338","volume":"98","author":"TG Wong","year":"2018","unstructured":"Wong, T.G., Wunscher, K., Lockhart, J., Severini, S.: Quantum walk search on Kronecker graphs. Phys. Rev. A 98, 012338 (2018)","journal-title":"Phys. Rev. A"},{"key":"3496_CR22","doi-asserted-by":"publisher","first-page":"033016","DOI":"10.1103\/PhysRevResearch.1.033016","volume":"1","author":"YK Wang","year":"2019","unstructured":"Wang, Y.K., Wu, S.J., Wang, W.: Controlled quantum search on structured databases. Phys. Rev. Res. 1, 033016 (2019)","journal-title":"Phys. Rev. Res."},{"key":"3496_CR23","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/s11128-018-2158-5","volume":"18","author":"XL Xue","year":"2019","unstructured":"Xue, X.L., Ruan, Y., Liu, Z.H.: Discrete-time quantum walk search on Johnson graphs. Quantum Inf. Process. 18, 50 (2019)","journal-title":"Quantum Inf. Process."},{"key":"3496_CR24","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.99.032301","volume":"99","author":"ML Rhodes","year":"2019","unstructured":"Rhodes, M.L., Wong, T.G.: Quantum walk search on the complete Bipartite graph. Phys. Rev. A 99, 032301 (2019)","journal-title":"Phys. Rev. A"},{"key":"3496_CR25","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., Linke, N.M., Debnath, S., Monroe, C.: Complete 3-Qubit Grover search on a programmable quantum computer. Nat. Commun. 8, 1918 (2017)","journal-title":"Nat. Commun."},{"key":"3496_CR26","doi-asserted-by":"crossref","unstructured":"Boyer, M., Brassard, G., Hoyer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte der Physik Progress Phys. 46(493), 032301, (1998)","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"key":"3496_CR27","doi-asserted-by":"publisher","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, 052313 (2000)","journal-title":"Phys. Rev. A"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03496-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-022-03496-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03496-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,8]],"date-time":"2022-06-08T08:23:39Z","timestamp":1654676619000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-022-03496-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,27]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["3496"],"URL":"https:\/\/doi.org\/10.1007\/s11128-022-03496-8","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2022,4,27]]},"assertion":[{"value":"12 September 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"160"}}