{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T12:31:14Z","timestamp":1725798674068},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662444641"},{"type":"electronic","value":"9783662444658"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44465-8_20","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T10:33:02Z","timestamp":1407839582000},"page":"226-238","source":"Crossref","is-referenced-by-count":0,"title":["An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Decker","sequence":"first","affiliation":[]},{"given":"G\u00e1bor","family":"Ivanyos","sequence":"additional","affiliation":[]},{"given":"Raghav","family":"Kulkarni","sequence":"additional","affiliation":[]},{"given":"Youming","family":"Qiao","sequence":"additional","affiliation":[]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","first-page":"438","volume":"8","author":"D. Bacon","year":"2008","unstructured":"Bacon, D.: How a Clebsch-Gordan transform helps to solve the Heisenberg hidden subgroup problem. Quantum Inf. Comput.\u00a08, 438\u2013467 (2008)","journal-title":"Quantum Inf. Comput."},{"key":"20_CR2","doi-asserted-by":"crossref","unstructured":"Bacon, D., Childs, A., van Dam, W.: From optimal measurement to efficient quantum algorithms for the hidden subgroup problem over semidirect product groups. In: Proc. 46th IEEE FOCS, pp. 469\u2013478 (2005)","DOI":"10.1109\/SFCS.2005.38"},{"key":"20_CR3","volume-title":"Algebraic coding theory","author":"E.R. Berlekamp","year":"1968","unstructured":"Berlekamp, E.R.: Algebraic coding theory. McGraw-Hill, New York (1968)"},{"key":"20_CR4","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1090\/S0025-5718-1970-0276200-X","volume":"24","author":"E.R. Berlekamp","year":"1970","unstructured":"Berlekamp, E.R.: Factoring polynomials over large finite fields. Math. Comput.\u00a024, 713\u2013735 (1970)","journal-title":"Math. Comput."},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"424","DOI":"10.1007\/3-540-44750-4_34","volume-title":"Advances in Cryptology - CRYPTO \u201995","author":"D. Boneh","year":"1995","unstructured":"Boneh, D., Lipton, R.J.: Quantum cryptanalysis of hidden linear functions. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol.\u00a0963, pp. 424\u2013437. Springer, Heidelberg (1995)"},{"key":"20_CR6","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1090\/S0025-5718-1981-0606517-5","volume":"36","author":"D.G. Cantor","year":"1981","unstructured":"Cantor, D.G., Zassenhaus, H.: A New Algorithm for Factoring Polynomials Over Finite Field. Math. Comput.\u00a036, 587\u2013592 (1981)","journal-title":"Math. Comput."},{"key":"20_CR7","first-page":"26","volume":"1","author":"K. Cheung","year":"2001","unstructured":"Cheung, K., Mosca, M.: Decomposing finite abelian groups. Quantum Inf. Comput.\u00a01, 26\u201332 (2001)","journal-title":"Quantum Inf. Comput."},{"key":"20_CR8","first-page":"282","volume":"10","author":"A. Denney","year":"2010","unstructured":"Denney, A., Moore, C., Russell, A.: Finding conjugate stabilizer subgroups in PSL(2;q) and related problems. Quantum Inf. Comput.\u00a010, 282\u2013291 (2010)","journal-title":"Quantum Inf. Comput."},{"key":"20_CR9","doi-asserted-by":"crossref","first-page":"763","DOI":"10.1137\/S009753970343141X","volume":"36","author":"W. Dam van","year":"2006","unstructured":"van Dam, W., Hallgren, S., Ip, L.: Quantum algorithms for some hidden shift problems. SIAM J. Comput.\u00a036, 763\u2013778 (2006)","journal-title":"SIAM J. Comput."},{"key":"20_CR10","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/j.ipl.2004.01.024","volume":"91","author":"M. Ettinger","year":"2004","unstructured":"Ettinger, M., Hoyer, P., Knill, E.: The quantum query complexity of the hidden subgroup problem is polynomial. Inform. Proc. Lett.\u00a091, 43\u201348 (2004)","journal-title":"Inform. Proc. Lett."},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and orbit coset in quantum computing. In: Proc. 35th STOC, pp. 1\u20139 (2003)","DOI":"10.1145\/780542.780544"},{"key":"20_CR12","first-page":"229","volume":"4","author":"D. Gavinsky","year":"2004","unstructured":"Gavinsky, D.: Quantum solution to the hidden subgroup problem for poly-near-Hamiltonian groups. Quantum Inf. Comput.\u00a04, 229\u2013235 (2004)","journal-title":"Quantum Inf. Comput."},{"key":"20_CR13","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"Theory of Quantum Computation, Communication, and Cryptography","author":"D.N. Gon\u00e7alves","year":"2009","unstructured":"Gon\u00e7alves, D.N., Portugal, R., Cosme, C.M.M.: Solutions to the hidden subgroup problem on some metacyclic groups. In: Childs, A., Mosca, M. (eds.) TQC 2009. LNCS, vol.\u00a05906, pp. 1\u20139. Springer, Heidelberg (2009)"},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Grigni, M., Schulman, L., Vazirani, M., Vazirani, U.: Quantum mechanical algorithms for the nonabelian Hidden Subgroup Problem. In: Proc. 33rd ACM STOC, pp. 68\u201374 (2001)","DOI":"10.1145\/380752.380769"},{"key":"20_CR15","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1137\/S009753970139450X","volume":"32","author":"S. Hallgren","year":"2003","unstructured":"Hallgren, S., Russell, A., Ta-Shma, A.: Normal subgroup reconstruction and quantum computation using group representations. SIAM J. Comp.\u00a032, 916\u2013934 (2003)","journal-title":"SIAM J. Comp."},{"key":"20_CR16","first-page":"559","volume":"7","author":"Y. Inui","year":"2007","unstructured":"Inui, Y., Le Gall, F.: Efficient quantum algorithms for the hidden subgroup problem over semi-direct product groups. Quantum Inf. Comput.\u00a07, 559\u2013570 (2007)","journal-title":"Quantum Inf. Comput."},{"key":"20_CR17","first-page":"661","volume":"12","author":"G. Ivanyos","year":"2012","unstructured":"Ivanyos, G.: Finding hidden Borel subgroups of the general linear group. Quantum Inf. Comput.\u00a012, 661\u2013669 (2012)","journal-title":"Quantum Inf. Comput."},{"key":"20_CR18","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1142\/S0129054103001996","volume":"15","author":"G. Ivanyos","year":"2003","unstructured":"Ivanyos, G., Magniez, F., Santha, M.: Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem. Int. J. Found. Comp. Sci.\u00a015, 723\u2013739 (2003)","journal-title":"Int. J. Found. Comp. Sci."},{"issue":"1-2","key":"20_CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/s00453-011-9521-6","volume":"63","author":"G. Ivanyos","year":"2012","unstructured":"Ivanyos, G., Sanselme, L., Santha, M.: An efficient quantum algorithm for the hidden subgroup problem in nil-2 groups. Algorithmica\u00a063(1-2), 91\u2013116 (2012)","journal-title":"Algorithmica"},{"key":"20_CR20","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/5992.909000","volume":"3","author":"R. Jozsa","year":"2001","unstructured":"Jozsa, R.: Quantum factoring, discrete logarithms, and the hidden subgroup problem. Computing in Science and Engineering\u00a03, 34\u201343 (2001)","journal-title":"Computing in Science and Engineering"},{"key":"20_CR21","unstructured":"Yu. Kitaev, A.: Quantum measurements and the Abelian Stabilizer Problem, Technical report arXiv:quant-ph\/9511026 (1995)"},{"key":"20_CR22","unstructured":"Moore, C., Rockmore, D., Russell, A., Schulman, L.: The power of basis selection in Fourier sampling: Hidden subgroup problems in affine groups. In: Proc. 15th ACM-SIAM SODA, pp. 1106\u20131115 (2004)"},{"key":"20_CR23","doi-asserted-by":"crossref","first-page":"738","DOI":"10.1137\/S0097539703440678","volume":"33","author":"O. Regev","year":"2004","unstructured":"Regev, O.: Quantum computation and lattice problems. SIAM J. Comput.\u00a033, 738\u2013760 (2004)","journal-title":"SIAM J. Comput."},{"key":"20_CR24","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"Shor, P.: Algorithms for quantum computation: Discrete logarithm and factoring. SIAM J. Comput.\u00a026, 1484\u20131509 (1997)","journal-title":"SIAM J. Comput."},{"key":"20_CR25","series-title":"Progress in mathematics","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-8176-4840-4","volume-title":"Linear Algebraic groups","author":"T.A. Springer","year":"1998","unstructured":"Springer, T.A.: Linear Algebraic groups, 2nd edn. Progress in mathematics, vol.\u00a09. Birkh\u00e4user, Basel (1998)","edition":"2"},{"key":"20_CR26","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Quantum algorithms for solvable groups. In: Proc. 33rd ACM STOC, pp. 60\u201367 (2001)","DOI":"10.1145\/380752.380759"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2014"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44465-8_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,18]],"date-time":"2019-01-18T20:27:47Z","timestamp":1547843267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44465-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662444641","9783662444658"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44465-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}