{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,6]],"date-time":"2026-05-06T03:18:27Z","timestamp":1778037507848,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T00:00:00Z","timestamp":1724112000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,20]],"date-time":"2024-08-20T00:00:00Z","timestamp":1724112000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2024,9]]},"DOI":"10.1007\/s11432-023-3972-y","type":"journal-article","created":{"date-parts":[[2024,8,23]],"date-time":"2024-08-23T11:24:55Z","timestamp":1724412295000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Quantum search with prior knowledge"],"prefix":"10.1007","volume":"67","author":[{"given":"Xiaoyu","family":"He","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoming","family":"Sun","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jialin","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,20]]},"reference":[{"key":"3972_CR1","series-title":"Technical Report","volume-title":"Efficient DES Key Search","author":"M J Wiener","year":"1994","unstructured":"Wiener M J. Efficient DES Key Search. Technical Report TR-244, 1994"},{"key":"3972_CR2","unstructured":"Daemen J, Rijmen V. AES proposal: rijndael. 1999. https:\/\/www.cs.cmu.edu\/afs\/cs\/project\/pscico-guyb\/realworld\/www\/docs\/rijndael.pdf"},{"key":"3972_CR3","first-page":"72","volume-title":"Proceedings of the International Conference on Computers and Games","author":"R Coulom","year":"2006","unstructured":"Coulom R. Efficient selectivity and backup operators in Monte-Carlo tree search. In: Proceedings of the International Conference on Computers and Games, 2006. 72\u201383"},{"key":"3972_CR4","doi-asserted-by":"publisher","first-page":"1510","DOI":"10.1137\/S0097539796300933","volume":"26","author":"C H Bennett","year":"1997","unstructured":"Bennett C H, Bernstein E, Brassard G, et al. Strengths and weaknesses of quantum computing. SIAM J Comput, 1997, 26: 1510\u20131523","journal-title":"SIAM J Comput"},{"key":"3972_CR5","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1103\/PhysRevLett.79.325","volume":"79","author":"L K Grover","year":"1997","unstructured":"Grover L K. Quantum mechanics helps in searching for a needle in a haystack. Phys Rev Lett, 1997, 79: 325\u2013328","journal-title":"Phys Rev Lett"},{"key":"3972_CR6","doi-asserted-by":"publisher","first-page":"4329","DOI":"10.1103\/PhysRevLett.80.4329","volume":"80","author":"L K Grover","year":"1998","unstructured":"Grover L K. Quantum computers can search rapidly by using almost any transformation. Phys Rev Lett, 1998, 80: 4329\u20134332","journal-title":"Phys Rev Lett"},{"key":"3972_CR7","doi-asserted-by":"crossref","unstructured":"Brassard G, Hoyer P, Mosca M, et al. Quantum amplitude amplification and estimation. 2002. ArXiv:quant-ph\/0005055","DOI":"10.1090\/conm\/305\/05215"},{"key":"3972_CR8","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, 1999, 60: 2746\u20132751","journal-title":"Phys Rev A"},{"key":"3972_CR9","doi-asserted-by":"publisher","first-page":"150501","DOI":"10.1103\/PhysRevLett.95.150501","volume":"95","author":"L K Grover","year":"2005","unstructured":"Grover L K. Fixed-point quantum search. Phys Rev Lett, 2005, 95: 150501","journal-title":"Phys Rev Lett"},{"key":"3972_CR10","doi-asserted-by":"publisher","first-page":"150501","DOI":"10.1103\/PhysRevLett.102.150501","volume":"102","author":"A Mizel","year":"2009","unstructured":"Mizel A. Critically damped quantum search. Phys Rev Lett, 2009, 102: 150501","journal-title":"Phys Rev Lett"},{"key":"3972_CR11","doi-asserted-by":"publisher","first-page":"210501","DOI":"10.1103\/PhysRevLett.113.210501","volume":"113","author":"T J Yoder","year":"2014","unstructured":"Yoder T J, Low G H, Chuang I L. Fixed-point quantum search with an optimal number of queries. Phys Rev Lett, 2014, 113: 210501","journal-title":"Phys Rev Lett"},{"key":"3972_CR12","doi-asserted-by":"publisher","first-page":"129503","DOI":"10.1007\/s11432-021-3468-x","volume":"66","author":"X Y He","year":"2023","unstructured":"He X Y, Sun X M, Yang G, et al. Exact quantum query complexity of weight decision problems via Chebyshev polynomials. Sci China Inf Sci, 2023, 66: 129503","journal-title":"Sci China Inf Sci"},{"key":"3972_CR13","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1038\/nature24270","volume":"550","author":"D Silver","year":"2017","unstructured":"Silver D, Schrittwieser J, Simonyan K, et al. Mastering the game of go without human knowledge. Nature, 2017, 550: 354\u2013359","journal-title":"Nature"},{"key":"3972_CR14","doi-asserted-by":"publisher","first-page":"1140","DOI":"10.1126\/science.aar6404","volume":"362","author":"D Silver","year":"2018","unstructured":"Silver D, Hubert T, Schrittwieser J, et al. A general reinforcement learning algorithm that masters chess, shogi, and go through self-play. Science, 2018, 362: 1140\u20131144","journal-title":"Science"},{"key":"3972_CR15","doi-asserted-by":"publisher","first-page":"129502","DOI":"10.1007\/s11432-021-3382-2","volume":"66","author":"Y L Wang","year":"2023","unstructured":"Wang Y L, Li G X, Wang X. A hybrid quantum-classical Hamiltonian learning algorithm. Sci China Inf Sci, 2023, 66: 129502","journal-title":"Sci China Inf Sci"},{"key":"3972_CR16","first-page":"77","volume-title":"Proceedings of the Conference on Quantum Computation, Communication, and Cryptography","author":"A Montanaro","year":"2010","unstructured":"Montanaro A. Quantum search with advice. In: Proceedings of the Conference on Quantum Computation, Communication, and Cryptography, 2010. 77\u201393"},{"key":"3972_CR17","doi-asserted-by":"publisher","first-page":"1","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, 2017, 8: 1\u20139","journal-title":"Nat Commun"},{"key":"3972_CR18","doi-asserted-by":"publisher","first-page":"182501","DOI":"10.1007\/s11432-021-3334-1","volume":"65","author":"Q L Zheng","year":"2022","unstructured":"Zheng Q L, Zhu P Y, Xue S C, et al. Quantum algorithm and experimental demonstration for the subset sum problem. Sci China Inf Sci, 2022, 65: 182501","journal-title":"Sci China Inf Sci"},{"key":"3972_CR19","doi-asserted-by":"publisher","first-page":"3301","DOI":"10.1109\/TCAD.2023.3244885","volume":"42","author":"X Sun","year":"2023","unstructured":"Sun X, Tian G, Yang S, et al. Asymptotically optimal circuit depth for quantum state preparation and general unitary synthesis. IEEE Trans Comput-Aided Des Integr Circ Syst, 2023, 42: 3301\u20133314","journal-title":"IEEE Trans Comput-Aided Des Integr Circ Syst"},{"key":"3972_CR20","first-page":"63","volume":"2018","author":"A Cross","year":"2018","unstructured":"Cross A. The IBM Q experience and QISKit open-source quantum computing software. Bull Am Phys Soc, 2018, 2018: 63","journal-title":"Bull Am Phys Soc"},{"key":"3972_CR21","volume-title":"Quantum Computation and Quantum Information","author":"M A Nielsen","year":"2002","unstructured":"Nielsen M A, Chuang I. Quantum Computation and Quantum Information. Cambridge: Cambridge University Press, 2002"},{"key":"3972_CR22","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10472-011-9258-6","volume":"61","author":"C D Rosin","year":"2011","unstructured":"Rosin C D. Multi-armed bandits with episode context. Ann Math Artif Intell, 2011, 61: 203\u2013230","journal-title":"Ann Math Artif Intell"},{"key":"3972_CR23","unstructured":"Wang D, You X, Li T, et al. Quantum exploration algorithms for multi-armed bandits. 2020. ArXiv:2007.07049"},{"key":"3972_CR24","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1145\/3055399.3055444","volume-title":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","author":"A Ambainis","year":"2017","unstructured":"Ambainis A, Kokainis M. Quantum algorithm for tree size estimation, with applications to backtracking and 2-player games. In: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, 2017. 989\u20131002"}],"updated-by":[{"DOI":"10.1007\/s11432-024-4206-3","type":"erratum","label":"Erratum","source":"publisher","updated":{"date-parts":[[2024,10,31]],"date-time":"2024-10-31T00:00:00Z","timestamp":1730332800000}}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-023-3972-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11432-023-3972-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-023-3972-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T19:22:52Z","timestamp":1760988172000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11432-023-3972-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,20]]},"references-count":24,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,9]]}},"alternative-id":["3972"],"URL":"https:\/\/doi.org\/10.1007\/s11432-023-3972-y","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,20]]},"assertion":[{"value":"23 August 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 November 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2024","order":6,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Erratum","order":7,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"An Erratum to this paper has been published:","order":8,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11432-024-4206-3","URL":"https:\/\/doi.org\/10.1007\/s11432-024-4206-3","order":9,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 October 2024","order":10,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Erratum","order":11,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"An Erratum to this paper has been published:","order":12,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s11432-024-4206-3","URL":"https:\/\/doi.org\/10.1007\/s11432-024-4206-3","order":13,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"192503"}}