{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:12Z","timestamp":1725550032721},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291060"},{"type":"electronic","value":"9783540320241"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11560586_18","type":"book-chapter","created":{"date-parts":[[2005,10,20]],"date-time":"2005-10-20T14:08:27Z","timestamp":1129817307000},"page":"215-227","source":"Crossref","is-referenced-by-count":0,"title":["Quantum Algorithms for a Set of Group Theoretic Problems"],"prefix":"10.1007","author":[{"given":"Stephen A.","family":"Fenner","sequence":"first","affiliation":[]},{"given":"Yong","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","unstructured":"Mosca, M.: Quantum Computer Algorithms. PhD thesis, University of Oxford, Oxford (1999)"},{"key":"18_CR2","doi-asserted-by":"crossref","unstructured":"Jozsa, R.: Quantum factoring, discrete algorithm and the hidden subgroup problem, Manuscript (2000)","DOI":"10.1109\/5992.909000"},{"key":"18_CR3","doi-asserted-by":"crossref","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 the Theory of Computing, pp. 1\u20139 (2003)","DOI":"10.1145\/780542.780544"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"167902","DOI":"10.1103\/PhysRevLett.87.167902","volume":"87","author":"H. Buhrman","year":"2001","unstructured":"Buhrman, H., Cleve, R., Watrous, J., de Wolf, R.: Quantum fingerprinting. Physical Review Letters\u00a087, 167902 (2001)","journal-title":"Physical Review Letters"},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Ta-Shma, A.: Adiabatic quantum state generation and statistical zero knowledge. In: Proceedings of the 35th ACM Symposium on the Theory of Computing, pp. 20\u201329 (2003)","DOI":"10.1145\/780542.780546"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Quantum algorithms for solvable groups. In: Proceedings of the 33rd ACM Symposium on the Theory of Computing, pp. 60\u201367 (2001)","DOI":"10.1145\/380752.380759"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Beals, R., Babai, L.: Las Vegas algorithms for matrix groups. In: Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, pp. 427\u2013436 (1993)","DOI":"10.1109\/SFCS.1993.366844"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Ivanyos, G., Magniez, F., Santha, M.: Efficient quantum algorithms for some instances of the non-abelian hidden subgroup problem. In: Proceedings of 13th ACM Symposium on Parallelism in Algorithms and Architectures, pp. 263\u2013270 (2001)","DOI":"10.1145\/378580.378679"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1006\/jcss.1999.1651","volume":"59","author":"L. Fortnow","year":"1999","unstructured":"Fortnow, L., Rogers, J.: Complexity limitations on quantum computation. Journal of Computer and System Sciences\u00a059, 240\u2013252 (1999)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/S0304-3975(96)00100-4","volume":"180","author":"V. Arvind","year":"1997","unstructured":"Arvind, V., Vinodchandran, N.V.: Solvable black-box group problems are low for PP. Theoretical Computer Science\u00a0180, 17\u201345 (1997)","journal-title":"Theoretical Computer Science"},{"key":"18_CR11","first-page":"88","volume":"5","author":"L. Babai","year":"1992","unstructured":"Babai, L.: Bounded round interactive proofs in finite groups. SIAM Journal on Computing\u00a05, 88\u2013111 (1992)","journal-title":"SIAM Journal on Computing"},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"Watrous, J.: Succinct quantum proofs for properties of finite groups. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (2000)","DOI":"10.1109\/SFCS.2000.892141"},{"volume-title":"Theory of Groups of Finite Order","year":"1955","key":"18_CR13","unstructured":"Burnside, W. (ed.): Theory of Groups of Finite Order. Dover Publications, Inc., Mineola (1955)"},{"key":"18_CR14","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2000","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2000)"},{"key":"18_CR15","doi-asserted-by":"crossref","unstructured":"Babai, L., Szemer\u00e9di, E.: On the complexity of matrix group problems I. In: Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, pp. 229\u2013240 (1984)","DOI":"10.1109\/SFCS.1984.715919"},{"key":"18_CR16","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1006\/jcss.1995.1024","volume":"50","author":"L. Babai","year":"1995","unstructured":"Babai, L., Cooperman, G., Finkelstein, L., Luks, E., Seress, A.: Fast Monte Carlo algorithms for permutation groups. Journal of Computer and System Sciences\u00a050, 296\u2013307 (1995)","journal-title":"Journal of Computer and System Sciences"},{"key":"18_CR17","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1145\/116825.116852","volume":"38","author":"O. Goldreich","year":"1991","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proof systems. Journal of the ACM\u00a038, 691\u2013729 (1991)","journal-title":"Journal of the ACM"},{"key":"18_CR18","unstructured":"Vadhan, S.: A study of statistical zero knowledge proofs. PhD thesis, MIT (1999)"},{"key":"18_CR19","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Sahai, A., Vadhan, S.: Honest-verifier statistical zero-knowledge equals general statistical zero-knowledge. In: Proceedings of the 30th ACM Symposium on the Theory of Computing, pp. 399\u2013408 (1998)","DOI":"10.1145\/276698.276852"},{"key":"18_CR20","doi-asserted-by":"crossref","unstructured":"Babai, L.: Local expansion of vertex-transitive graphs and random generation in finite graphs. In: Proceedings of the 23rd ACM Symposium on the Theory of Computing, pp. 164\u2013174 (1991)","DOI":"10.1145\/103418.103440"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11560586_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T04:36:33Z","timestamp":1683261393000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11560586_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291060","9783540320241"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/11560586_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}