{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,2]],"date-time":"2026-01-02T07:10:30Z","timestamp":1767337830938,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T00:00:00Z","timestamp":1651190400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T00:00:00Z","timestamp":1651190400000},"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":["No.62002385","No.61972413"],"award-info":[{"award-number":["No.62002385","No.61972413"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100012166","name":"National Key R &D Program of China","doi-asserted-by":"crossref","award":["No. 2021YFB3100100"],"award-info":[{"award-number":["No. 2021YFB3100100"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["No. 2021M703321"],"award-info":[{"award-number":["No. 2021M703321"]}],"id":[{"id":"10.13039\/501100002858","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-03507-8","type":"journal-article","created":{"date-parts":[[2022,4,29]],"date-time":"2022-04-29T16:03:43Z","timestamp":1651248223000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An improved quantum algorithm for the quantum learning with errors problem"],"prefix":"10.1007","volume":"21","author":[{"given":"Yaru","family":"Wang","sequence":"first","affiliation":[]},{"given":"Haodong","family":"Jiang","sequence":"additional","affiliation":[]},{"given":"Zhi","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qianheng","family":"Duan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,29]]},"reference":[{"issue":"6\/7","key":"3507_CR1","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. Int. J. Theor. Phys. 21(6\/7), 467\u2013488 (1982)","journal-title":"Int. J. Theor. Phys."},{"issue":"5","key":"3507_CR2","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. Comput. 26(5), 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"3507_CR3","unstructured":"Bennett, C.H.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of IEEE international conference on computers, 175-179 (1984)"},{"key":"3507_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7","volume-title":"Post Quantum Cryptography","author":"D Bernstein","year":"2009","unstructured":"Bernstein, D., Buchmann, J., Dahmen, E.: Post Quantum Cryptography. Springer, Berlin, Heidelberg (2009)"},{"issue":"5410","key":"3507_CR5","doi-asserted-by":"publisher","first-page":"2050","DOI":"10.1126\/science.283.5410.2050","volume":"283","author":"HK Lo","year":"1999","unstructured":"Lo, H.K., Chau, H.F.: Unconditional security of quantum key distribution over arbitrarily long distances. Science 283(5410), 2050\u20132056 (1999)","journal-title":"Science"},{"key":"3507_CR6","doi-asserted-by":"crossref","unstructured":"Brassard, G.: Brief history of quantum cryptography: a personal perspective. IEEE in-formation theory workshop on theory and practice in information theoretic security, 19-23 (2005)","DOI":"10.1109\/ITWTPI.2005.1543949"},{"issue":"46","key":"3507_CR7","first-page":"1","volume":"4","author":"C Elliott","year":"2002","unstructured":"Elliott, C.: Building the quantum network. New J. Phys. 4(46), 1\u201312 (2002)","journal-title":"New J. Phys."},{"issue":"4","key":"3507_CR8","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1561\/0400000074","volume":"10","author":"C Peikert","year":"2016","unstructured":"Peikert, C.: A decade of lattice cryptography. Found. Trends Theor. Comput. Sci. 10(4), 283\u2013424 (2016)","journal-title":"Found. Trends Theor. Comput. Sci."},{"issue":"6","key":"3507_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1568318.1568324","volume":"56","author":"O Regev","year":"2009","unstructured":"Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 1\u201340 (2009)","journal-title":"J. ACM"},{"issue":"1","key":"3507_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.3390\/cryptography4010010","volume":"4","author":"G Alagic","year":"2020","unstructured":"Alagic, G., Jeffery, S., Ozols, M., Poremba, A.: On quantum chosen ciphertext attacks and learning with errors. Cryptography 4(1), 1\u201327 (2020)","journal-title":"Cryptography"},{"key":"3507_CR11","doi-asserted-by":"crossref","unstructured":"Grilo, A.B., Kerenidis, I., Zijlstra, T.: Learning with errors problem is easy with quantum samples. Phys. Rev. A, 99(3), (2019)","DOI":"10.1103\/PhysRevA.99.032314"},{"issue":"5","key":"3507_CR12","doi-asserted-by":"publisher","first-page":"1411","DOI":"10.1137\/S0097539796300921","volume":"26","author":"E Bernstein","year":"1997","unstructured":"Bernstein, E., Vazirani, U.: Quantum complexity theory. SIAM J. Comput. 26(5), 1411\u20131473 (1997)","journal-title":"SIAM J. Comput."},{"key":"3507_CR13","volume-title":"Quantum amplitude amplification algorithm: an explanation of availability bias","author":"R Franco","year":"2009","unstructured":"Franco, R.: Quantum amplitude amplification algorithm: an explanation of availability bias. Springer, Berlin, Heidelberg (2009)"},{"key":"3507_CR14","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, 212-219 (1996)","DOI":"10.1145\/237814.237866"},{"issue":"5","key":"3507_CR15","first-page":"53","volume":"305","author":"G Brassar","year":"2002","unstructured":"Brassar, G., Hoyer, P., Moscaand, M.: Quantum amplitude amplification and estimation. Quant. Comput. Quant. Inform. 305(5), 53\u201374 (2002)","journal-title":"Quant. Comput. Quant. Inform."},{"issue":"1907","key":"3507_CR16","first-page":"553","volume":"439","author":"D Deutsch","year":"1992","unstructured":"Deutsch, D., Jozsa, R.: Rapid solution of problems by quantum computation. Proc. R. Soc. Lond. 439(1907), 553\u2013558 (1992)","journal-title":"Proc. R. Soc. Lond."},{"key":"3507_CR17","unstructured":"Brassard, G., Hoyer, P.: An exact quantum polynomial-time algorithm for simon\u2019s problem. In: Proceedings of the 5th Israeli symposium on theory of computing and systems(ISTCS\u201997), 12-23 (1997)"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-022-03507-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-022-03507-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-03507-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T10:02:40Z","timestamp":1727085760000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-022-03507-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,29]]},"references-count":17,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["3507"],"URL":"https:\/\/doi.org\/10.1007\/s11128-022-03507-8","relation":{},"ISSN":["1573-1332"],"issn-type":[{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2022,4,29]]},"assertion":[{"value":"16 January 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 April 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"166"}}