{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:26:58Z","timestamp":1740137218116,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,4,1]],"date-time":"2021-04-01T00:00:00Z","timestamp":1617235200000},"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":["Grants No. 61972413","61701539"],"award-info":[{"award-number":["Grants No. 61972413","61701539"]}],"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":["61901525"],"award-info":[{"award-number":["61901525"]}],"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":[[2021,4]]},"DOI":"10.1007\/s11128-021-03064-6","type":"journal-article","created":{"date-parts":[[2021,4,10]],"date-time":"2021-04-10T08:02:41Z","timestamp":1618041761000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Using small-scale quantum devices to solve algebraic equations"],"prefix":"10.1007","volume":"20","author":[{"given":"Hongshu","family":"Li","sequence":"first","affiliation":[]},{"given":"Zhi","family":"Ma","sequence":"additional","affiliation":[]},{"given":"Hong","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Qianheng","family":"Duan","sequence":"additional","affiliation":[]},{"given":"Yangyang","family":"Fei","sequence":"additional","affiliation":[]},{"given":"Xiangdong","family":"Meng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,4,10]]},"reference":[{"key":"3064_CR1","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-540-25937-4_5","volume":"3017","author":"F Armknecht","year":"2004","unstructured":"Armknecht, F.: Improving fast algebraic attacks. Lect. Notes Comput. Sci. 3017, 65\u201382 (2004)","journal-title":"Lect. Notes Comput. Sci."},{"key":"3064_CR2","unstructured":"Bard, G.V.: Algorithms for solving linear and polynomial systems of equations over finite fields, with applications to cryptanalysis (2007)"},{"key":"3064_CR3","unstructured":"Bard, G.V., Courtois, N., Jefferson, C.: Efficient methods for conversion and solution of sparse systems of low-degree multivariate polynomials over gf(2) via sat-solvers. System 2007, (2007)"},{"key":"3064_CR4","doi-asserted-by":"crossref","unstructured":"Bardet, M., Faugre, J.C., Salvy, B., Spaenlehauer, P.J.: On the complexity of solving quadratic boolean systems. J. Complex. (2013)","DOI":"10.1016\/j.jco.2012.07.001"},{"key":"3064_CR5","unstructured":"Courtois, N., Bard, G.V.: Algebraic cryptanalysis of the data encryption standard. In: Proceedings of 11th IMA International Conference Cryptography and Coding, Cirencester, UK (2006)"},{"key":"3064_CR6","doi-asserted-by":"crossref","unstructured":"Courtois, N., Klimov, A., Patarin, J., Shamir, A.: Efficient algorithms for solving overdefined systems of multivariate polynomial equations. In: International Conference on Advances in Cryptology-eurocrypt (2000)","DOI":"10.1007\/3-540-45539-6_27"},{"key":"3064_CR7","unstructured":"Cox, D.A., John, L., Donal, O.: Using algebraic geometry (2005)"},{"key":"3064_CR8","doi-asserted-by":"crossref","unstructured":"Dantsin, E., Goerdt, A., Hirsch, E.A., Kannan, R., Kleinberg, J., Papadimitriou, C., Raghavan, P., Sch?Ning, U.: A deterministic (22\/(k+1))n algorithm for k-sat based on local search. Theoret. Comput. 289(1), 69\u201383 (2002)","DOI":"10.1016\/S0304-3975(01)00174-8"},{"issue":"25","key":"3064_CR9","doi-asserted-by":"publisher","first-page":"250501","DOI":"10.1103\/PhysRevLett.121.250501","volume":"121","author":"V Dunjko","year":"2018","unstructured":"Dunjko, V., Ge, Y., Cirac, J.I.: Computational speedups using small quantum devices. Phys. Rev. Lett. 121(25), 250501 (2018)","journal-title":"Phys. Rev. Lett."},{"issue":"1","key":"3064_CR10","doi-asserted-by":"publisher","first-page":"012201","DOI":"10.1063\/1.5119235","volume":"61","author":"Y Ge","year":"2020","unstructured":"Ge, Y., Dunjko, V.: A hybrid algorithm framework for small quantum computers with application to finding Hamiltonian cycles. J. Math. Phys. 61(1), 012201 (2020)","journal-title":"J. Math. Phys."},{"key":"3064_CR11","unstructured":"Herbort, S., Ratz, D.: Improving the efficiency of a nonlinear-system-solver using a componentwise newton method. Institut Fr Angewandte Mathematik Universitt Karlsruhe (1997)"},{"key":"3064_CR12","doi-asserted-by":"crossref","unstructured":"Hochba, D.S.: Approximation algorithms for np-hard problems. ACM Sigact News 28(2), 40\u201352 (1997)","DOI":"10.1145\/261342.571216"},{"key":"3064_CR13","unstructured":"Kannan, R., Karpinski, M., Prmel, H.J.: Approximation algorithms for np-hard problems"},{"key":"3064_CR14","unstructured":"Litman, M.F.: On covering problems of codes. Theory Comput. Syst. (1997)"},{"key":"3064_CR15","unstructured":"LIYao-hui, LIUBao-Jun: Survey of finding real roots of nonlinear equations(in chinese). J.f Wuhan Univ. Sci. Technol. 03, 326\u2013330 (2004)"},{"key":"3064_CR16","doi-asserted-by":"crossref","unstructured":"Miura, H., Hashimoto, Y., Takagi, T.: Extended algorithm for solving underdefined multivariate quadratic equations. In: International Workshop on Post-Quantum Cryptography (2013)","DOI":"10.1007\/978-3-642-38616-9_8"},{"key":"3064_CR17","doi-asserted-by":"publisher","unstructured":"Moser, R.A., Scheder, D.: A full derandomization of sch\u00f6ning\u2019s k-sat algorithm. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC \u201911, p. 245252. Association for Computing Machinery, New York (2011). https:\/\/doi.org\/10.1145\/1993636.1993670","DOI":"10.1145\/1993636.1993670"},{"key":"3064_CR18","unstructured":"Rennela, M., Laarman, A., Dunjko, V.: Hybrid divide-and-conquer approach for tree search algorithms (2020)"},{"key":"3064_CR19","unstructured":"Schoning, T.: A probabilistic algorithm for k-sat and constraint satisfaction problems. In: 40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039), pp. 410\u2013414. IEEE (1999)"},{"key":"3064_CR20","doi-asserted-by":"crossref","unstructured":"Yang, B.Y., Chen, J.M.: Theoretical analysis of xl over small fields. In: Information Security Privacy: Australasian Conference (2004)","DOI":"10.1007\/978-3-540-27800-9_24"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03064-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-021-03064-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03064-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,5]],"date-time":"2021-05-05T20:25:38Z","timestamp":1620246338000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-021-03064-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,4]]},"references-count":20,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,4]]}},"alternative-id":["3064"],"URL":"https:\/\/doi.org\/10.1007\/s11128-021-03064-6","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2021,4]]},"assertion":[{"value":"18 November 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 April 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"140"}}