{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T10:18:54Z","timestamp":1781259534380,"version":"3.54.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,11,6]],"date-time":"2010-11-06T00:00:00Z","timestamp":1289001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00453-010-9467-0","type":"journal-article","created":{"date-parts":[[2010,11,5]],"date-time":"2010-11-05T10:10:43Z","timestamp":1288951843000},"page":"480-498","source":"Crossref","is-referenced-by-count":6,"title":["An Efficient Quantum Algorithm for the Hidden Subgroup Problem in Nil-2 Groups"],"prefix":"10.1007","volume":"62","author":[{"given":"G\u00e1bor","family":"Ivanyos","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Luc","family":"Sanselme","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2010,11,6]]},"reference":[{"key":"9467_CR1","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1109\/SFCS.2005.38","volume-title":"Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"D. Bacon","year":"2005","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: Proceedings of the 46th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 469\u2013478 (2005)"},{"key":"9467_CR2","first-page":"427","volume-title":"Proceedings of the 34th IEEE Symposium on Foundations of Computer Science (FOCS)","author":"R. Beals","year":"1993","unstructured":"Beals, R., Babai, L.: Las Vegas algorithms for matrix groups. In: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 427\u2013436 (1993)"},{"key":"9467_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF02940714","volume":"11","author":"C. Chevalley","year":"1936","unstructured":"Chevalley, C.: D\u00e9monstration d\u2019une hypoth\u00e8se de M. Artin. Abh. Math. Semin. Univ. Hamb. 11, 73\u201375 (1936)","journal-title":"Abh. Math. Semin. Univ. Hamb."},{"key":"9467_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/jsco.2002.0540","volume":"34","author":"B. Eick","year":"2002","unstructured":"Eick, B.: Orbit-stabilizer problems and computing normalizers for polycyclic groups. J. Symb. Comput. 34, 1\u201319 (2002)","journal-title":"J. Symb. Comput."},{"key":"9467_CR5","first-page":"1","volume-title":"Proceedings of the 35th ACM Symposium on Theory of Computing (STOC)","author":"K. Friedl","year":"2003","unstructured":"Friedl, K., Ivanyos, G., Magniez, F., Santha, M., Sen, P.: Hidden translation and orbit coset in quantum computing. In: Proceedings of the 35th ACM Symposium on Theory of Computing (STOC), pp. 1\u20139 (2003)"},{"key":"9467_CR6","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1006\/jsco.2002.0559","volume":"34","author":"V. Gebhardt","year":"2002","unstructured":"Gebhardt, V.: Efficient collection in infinite polycyclic groups. J. Symb. Comput. 34, 213\u2013228 (2002)","journal-title":"J. Symb. Comput."},{"key":"9467_CR7","first-page":"68","volume-title":"Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC)","author":"M. Grigni","year":"2001","unstructured":"Grigni, M., Schulman, L., Vazirani, M., Vazirani, U.: Quantum mechanical algorithms for the nonabelian Hidden Subgroup Problem. In: Proceedings of the 33rd ACM Symposium on Theory of Computing (STOC), pp. 68\u201374 (2001)"},{"key":"9467_CR8","volume-title":"Theory of Groups","author":"M. Hall Jr.","year":"1999","unstructured":"Hall, M., Jr.: Theory of Groups, 2nd edn. AMS Chelsea, Providence (1999)","edition":"2"},{"issue":"4","key":"9467_CR9","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. Comput. 32(4), 916\u2013934 (2003)","journal-title":"SIAM J. Comput."},{"key":"9467_CR10","doi-asserted-by":"crossref","DOI":"10.1201\/9781420035216","volume-title":"Handbook of Computational Group Theory","author":"D.F. Holt","year":"2005","unstructured":"Holt, D.F., Eick, B., O\u2019Brien, E.: Handbook of Computational Group Theory. Chapman & Hall\/CRC Press, Boca Raton (2005)"},{"key":"9467_CR11","unstructured":"H\u00f6fling, B.: Efficient multiplication algorithms for finite polycyclic groups. Preprint, available at http:\/\/www-public.tu-bs.de\/bhoeflin\/preprints\/collect.pdf (2004)"},{"issue":"5","key":"9467_CR12","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1142\/S0129054103001996","volume":"14","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. Comput. Sci. 14(5), 723\u2013739 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"9467_CR13","series-title":"Lecture Notes in Computer Science (LNCS)","doi-asserted-by":"crossref","first-page":"586","DOI":"10.1007\/978-3-540-70918-3_50","volume-title":"Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS)","author":"G. Ivanyos","year":"2007","unstructured":"Ivanyos, G., Sanselme, L., Santha, M.: An efficient quantum algorithm for the hidden subgroup problem in extraspecial groups. In: Proceedings of the 24th Symposium on Theoretical Aspects of Computer Science (STACS), Lecture Notes in Computer Science (LNCS), vol.\u00a04393, pp. 586\u2013597. Springer, Berlin (2007)"},{"key":"9467_CR14","unstructured":"Kitaev, A.: Quantum measurements and the Abelian Stabilizer Problem. Technical report. arXiv:quant-ph\/9511026 (1995)"},{"key":"9467_CR15","series-title":"Lecture Notes in Computer Science (LNCS)","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1007\/978-3-540-89994-5_7","volume-title":"Proceedings of the 2008 Conference on Mathematical Methods in Computer Science (MMICS)","author":"H. Krovi","year":"2008","unstructured":"Krovi, H., R\u00f6tteler, M.: An efficient algorithm for the hidden subgroup problem in Weyl-Heisenberg groups. In: Proceedings of the 2008 Conference on Mathematical Methods in Computer Science (MMICS). Lecture Notes in Computer Science (LNCS), vol.\u00a05393, pp. 70\u201388. Springer, Berlin (2008)"},{"key":"9467_CR16","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1016\/S0747-7171(08)80081-8","volume":"9","author":"C.R. Leedham-Green","year":"1990","unstructured":"Leedham-Green, C.R., Soicher, L.H.: Collection from the left and other strategies. J. Symb. Comput. 9, 665\u2013675 (1990)","journal-title":"J. Symb. Comput."},{"key":"9467_CR17","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1112\/S1461157000000127","volume":"1","author":"C.R. Leedham-Green","year":"1998","unstructured":"Leedham-Green, C.R., Soicher, L.H.: Symbolic collection using Deep Thought. LMS J. Comput. Math. 1, 9\u201324 (1998)","journal-title":"LMS J. Comput. Math."},{"key":"9467_CR18","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1109\/SFCS.1992.267813","volume-title":"Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"E.M. Luks","year":"1992","unstructured":"Luks, E.M.: Computing in solvable matrix groups. In: Proceedings of the 33rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 111\u2013120 (1992)"},{"key":"9467_CR19","unstructured":"Mosca, M.: Quantum computer algorithms. PhD thesis, University of Oxford (1999)"},{"key":"9467_CR20","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","volume":"81","author":"N. Meggido","year":"1991","unstructured":"Meggido, N., Papadimitriou, C.: On total functions existence theorems, and computational complexity. Theor. Comput. Sci. 81, 317\u2013324 (1991)","journal-title":"Theor. Comput. Sci."},{"key":"9467_CR21","first-page":"1106","volume-title":"Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"C. Moore","year":"2004","unstructured":"Moore, C., Rockmore, D., Russell, A., Schulman, L.: The power of basis selection in Fourier sampling: Hidden subgroup problems in affine groups. In: Proceedings of the 15th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1106\u20131115 (2004)"},{"key":"9467_CR22","first-page":"536","volume-title":"Proceedings of the 39th ACM Symposium on Theory of Computing (STOC)","author":"C. Moore","year":"2007","unstructured":"Moore, C., Russell, A., Sniady, P.: On the impossibility of a quantum sieve algorithm for graph isomorphism. In: Proceedings of the 39th ACM Symposium on Theory of Computing (STOC), pp. 536\u2013545 (2007)"},{"key":"9467_CR23","volume-title":"Quantum Computation and Quantum Information","author":"M. Nielsen","year":"2000","unstructured":"Nielsen, M., Chuang, I.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"9467_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8594-1","volume-title":"A Course in the Theory of Groups","author":"D.J.S. Robinson","year":"1996","unstructured":"Robinson, D.J.S.: A Course in the Theory of Groups, 2nd edn. Springer, New York (1996)","edition":"2"},{"key":"9467_CR25","unstructured":"R\u00f6tteler, M., Beth, T.: Polynomial-time solution to the Hidden Subgroup Problem for a class of non-abelian groups. Technical report. arXiv:quant-ph\/9812070 (1998)"},{"issue":"3","key":"9467_CR26","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. 33(3), 738\u2013760 (2004)","journal-title":"SIAM J. Comput."},{"key":"9467_CR27","first-page":"51","volume-title":"Proceedings of the 2nd Manitoba Conference on Numerical Mathematics","author":"D. Shanks","year":"1972","unstructured":"Shanks, D.: Five number-theoretic algorithms. In: Proceedings of the 2nd Manitoba Conference on Numerical Mathematics, pp. 51\u201370 (1972)"},{"issue":"5","key":"9467_CR28","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","volume":"26","author":"P. Shor","year":"1997","unstructured":"Shor, P.: 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":"9467_CR29","doi-asserted-by":"crossref","unstructured":"van\u00a0de Woestijne, C.: Deterministic equation solving over finite fields. PhD thesis, Universiteit Leiden. Available at http:\/\/hdl.handle.net\/1887\/4392 (2006)","DOI":"10.1145\/1073884.1073932"},{"key":"9467_CR30","first-page":"76","volume":"11","author":"E. Warning","year":"1936","unstructured":"Warning, E.: Bemerkung zur vorstehenden Arbeit von Herrn Chevalley. Abh Math. Semin. Univ. Hamb. 11, 76\u201383 (1936)","journal-title":"Abh Math. Semin. Univ. Hamb."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9467-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9467-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9467-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T03:47:32Z","timestamp":1685850452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9467-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,11,6]]},"references-count":30,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9467"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9467-0","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,11,6]]}}}