{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T11:27:08Z","timestamp":1740137228489,"version":"3.37.3"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2019R1A2C1006337","NRF-2020M3E4A1079678"],"award-info":[{"award-number":["NRF-2019R1A2C1006337","NRF-2020M3E4A1079678"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2019K1A3A1A12071493"],"award-info":[{"award-number":["NRF-2019K1A3A1A12071493"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100010418","name":"Institute for Information and Communications Technology Promotion","doi-asserted-by":"publisher","award":["IITP-2021-2018-0-01402"],"award-info":[{"award-number":["IITP-2021-2018-0-01402"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2020M3H3A1105796"],"award-info":[{"award-number":["NRF-2020M3H3A1105796"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Inf Process"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s11128-021-03290-y","type":"journal-article","created":{"date-parts":[[2021,10,19]],"date-time":"2021-10-19T09:58:42Z","timestamp":1634637522000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Quantum algorithm based on the $$\\varepsilon $$-random linear disequations for the continuous hidden shift problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Eunok","family":"Bae","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2925-1017","authenticated-orcid":false,"given":"Soojoon","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,10,19]]},"reference":[{"key":"3290_CR1","doi-asserted-by":"publisher","first-page":"1474","DOI":"10.1137\/S0097539796298637","volume":"26","author":"DR Simon","year":"1997","unstructured":"Simon, D.R.: On the power of quantum computation. SIAM J. Comput. 26, 1474 (1997)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"3290_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 (1997)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"3290_CR3","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1006\/aama.2000.0699","volume":"25","author":"M Ettinger","year":"2000","unstructured":"Ettinger, M., H\u00f8yer, P.: On quantum algorithms for noncommutative hidden subgroups. Adv. Appl. Math. 25(3), 239 (2000)","journal-title":"Adv. Appl. Math."},{"issue":"1","key":"3290_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.ipl.2004.01.024","volume":"91","author":"M Ettinger","year":"2004","unstructured":"Ettinger, M., H\u00f8yer, P., Knill, E.: The quantum query complexity of the hidden subgroup problem is polynomial. Inf. Process. Lett. 91(1), 43 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"3290_CR5","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1137\/S0097539703436345","volume":"35","author":"G Kuperberg","year":"2005","unstructured":"Kuperberg, G.: A subexponential-time quantum algorithm for the dihedral hidden subgroup problem. SIAM J. Comput. 35(1), 170 (2005)","journal-title":"SIAM J. Comput."},{"key":"3290_CR6","unstructured":"Hallgren, S.: Proceedings of the 37th Annual ACM Symposium on Theory of Computing, STOC\u201905, pp. 468\u2013474 (2005)"},{"key":"3290_CR7","unstructured":"Schmidt, A., Vollmer, U.: Proceedings of the 37th ACM Symposium on Theory of Computing, STOC\u201905, pp. 475\u2013480 (2005)"},{"key":"3290_CR8","unstructured":"Kuperberg, G.: Leibniz International Proceedings in Informatics, LIPIcs\u201913, vol.\u00a022, pp. 20\u201334 (2013)"},{"key":"3290_CR9","doi-asserted-by":"crossref","unstructured":"Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, STOC\u201903, pp. 1\u20139 (2003)","DOI":"10.1145\/780542.780544"},{"issue":"3","key":"3290_CR10","doi-asserted-by":"publisher","first-page":"763","DOI":"10.1137\/S009753970343141X","volume":"36","author":"W van Dam","year":"2006","unstructured":"van Dam, W., Hallgren, S., Ip, L.: Quantum algorithms for some hidden shift problems. SIAM J. Comput. 36(3), 763 (2006)","journal-title":"SIAM J. Comput."},{"key":"3290_CR11","unstructured":"Childs, A.M., van Dam, W.: Proceedings of the 18th Symposium on Discrete Algorithms, SODA\u201907, pp. 1225\u20131232 (2007)"},{"key":"3290_CR12","first-page":"579","volume":"8","author":"G Ivanyos","year":"2008","unstructured":"Ivanyos, G.: On solving systems of random linear disequations. Quantum Inf. Comput. 8, 579 (2008)","journal-title":"Quantum Inf. Comput."},{"issue":"5\u20136","key":"3290_CR13","first-page":"504","volume":"7","author":"AM Childs","year":"2007","unstructured":"Childs, A.M., Wocjan, P.: On the quantum hardness of solving isomorphism problems as nonabelian hidden shift problems. Quantum Inf. Comput. 7(5\u20136), 504 (2007)","journal-title":"Quantum Inf. Comput."},{"issue":"3","key":"3290_CR14","first-page":"215","volume":"9","author":"T Decker","year":"2009","unstructured":"Decker, T., Draisma, J., Wocjan, P.: Efficient quantum algorithm for identifying hidden polynomials. Quantum Inf. Comput. 9(3), 215 (2009)","journal-title":"Quantum Inf. Comput."},{"issue":"9\u201310","key":"3290_CR15","first-page":"790","volume":"14","author":"T Decker","year":"2014","unstructured":"Decker, T., H\u00f8yer, P., Ivanyos, G., Santha, M.: Polynomial time quantum algorithms for certain bivariate hidden polynomial problems. Quantum Inf. Comput. 14(9\u201310), 790 (2014)","journal-title":"Quantum Inf. Comput."},{"issue":"5","key":"3290_CR16","doi-asserted-by":"publisher","first-page":"1987","DOI":"10.1137\/120864416","volume":"42","author":"T Decker","year":"2013","unstructured":"Decker, T., Ivanyos, G., Santha, M., Wocjan, P.: Hidden symmetry subgroup problems. SIAM J. Comput. 42(5), 1987 (2013)","journal-title":"SIAM J. Comput."},{"key":"3290_CR17","unstructured":"Kim, J.S., Bae, E., Lee, S.: Quantum computational algorithm for hidden symmetry subgroup problems on semi-direct product of cyclic groups. arXiv:1307.1183"},{"key":"3290_CR18","unstructured":"van Dam, W., Seroussi, G.: Efficient quantum algorithms for estimating gauss sums. arXiv:quant-ph\/0207131"},{"issue":"3","key":"3290_CR19","doi-asserted-by":"publisher","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O Regev","year":"2002","unstructured":"Regev, O.: Quantum computation and lattice problems. SIAM J. Comput. 33(3), 738 (2002)","journal-title":"SIAM J. Comput."},{"key":"3290_CR20","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-22685-4_14","volume":"6842","author":"D Gavinsky","year":"2011","unstructured":"Gavinsky, D., Roetteler, M., Roland, J.: Quantum algorithm for the Boolean hidden shift problem. Lect. Notes Comput. Sci. 6842, 158 (2011)","journal-title":"Lect. Notes Comput. Sci."},{"key":"3290_CR21","unstructured":"Roetteler, M.: Leibniz International Proceedings in Informatics, LIPIcs\u201916, vol. 61, pp. 8:1\u20138:16 (2016)"},{"key":"3290_CR22","doi-asserted-by":"crossref","unstructured":"Roetteler, M.: Proceedings of MFCS, vol. 2009, pp. 663\u2013674 (2009)","DOI":"10.1007\/978-3-642-03816-7_56"},{"key":"3290_CR23","doi-asserted-by":"crossref","unstructured":"Eisentr\u00e4ger, K., Hallgren, S., Kitaev, A., Song, F.: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, STOC\u201914, pp. 293\u2013302 (2014)","DOI":"10.1145\/2591796.2591860"},{"key":"3290_CR24","unstructured":"Biasse, J.F., Song, F.: Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA\u201916 (2016)"},{"key":"3290_CR25","doi-asserted-by":"crossref","unstructured":"Alagic, G., Russell, A.: Advances in Cryptology, EUROCRYPT\u201917, pp. 65\u201393 (2017)","DOI":"10.1007\/978-3-319-56617-7_3"},{"key":"3290_CR26","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1007\/978-3-030-03326-2_19","volume":"11272","author":"X Bonnetain","year":"2018","unstructured":"Bonnetain, X., Naya-Plasencia, M.: Hidden shift quantum cryptanalysis and implications. Lect. Notes Comput. Sci. 11272, 560 (2018)","journal-title":"Lect. Notes Comput. Sci."},{"key":"3290_CR27","doi-asserted-by":"crossref","unstructured":"Hallgren, S.: Polynomial-time quantum algorithms for Pell\u2019s equation and the principal ideal problem. J. ACM 54(4), 1 (2007)","DOI":"10.1145\/1206035.1206039"}],"container-title":["Quantum Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03290-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11128-021-03290-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11128-021-03290-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T05:04:41Z","timestamp":1725944681000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11128-021-03290-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":27,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["3290"],"URL":"https:\/\/doi.org\/10.1007\/s11128-021-03290-y","relation":{},"ISSN":["1570-0755","1573-1332"],"issn-type":[{"type":"print","value":"1570-0755"},{"type":"electronic","value":"1573-1332"}],"subject":[],"published":{"date-parts":[[2021,10]]},"assertion":[{"value":"9 April 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 October 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 October 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"347"}}