{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:40:02Z","timestamp":1737394802645,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540742395"},{"type":"electronic","value":"9783540742401"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-74240-1_22","type":"book-chapter","created":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T11:04:18Z","timestamp":1188212658000},"page":"250-260","source":"Crossref","is-referenced-by-count":7,"title":["The Quantum Query Complexity of Algebraic Properties"],"prefix":"10.1007","author":[{"given":"Sebastian","family":"D\u00f6rn","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Thierauf","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"publisher","first-page":"750","DOI":"10.1006\/jcss.2002.1826","volume":"64","author":"A. Ambainis","year":"2002","unstructured":"Ambainis, A.: Quantum Lower Bounds by Quantum Arguments. Journal of Computer and System Sciences\u00a064, 750\u2013767 (2002)","journal-title":"Journal of Computer and System Sciences"},{"key":"22_CR2","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1142\/S0219749903000383","volume":"1","author":"A. Ambainis","year":"2003","unstructured":"Ambainis, A.: Quantum walks and their algorithmic applications. International Journal of Quantum Information\u00a01, 507\u2013518 (2003)","journal-title":"International Journal of Quantum Information"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"Ambainis, A.: Quantum walk algorithm for element distinctness. In: Proceedings of FOCS 2004, pp. 22\u201331 (2004)","DOI":"10.1109\/FOCS.2004.54"},{"key":"22_CR4","unstructured":"Ambainis, A.: Quantum Search Algorithms, Technical Report arXiv:quant-ph\/0504012 (2005)"},{"key":"22_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/11672142_13","volume-title":"STACS 2006","author":"A. Ambainis","year":"2006","unstructured":"Ambainis, A., \u0160palek, R.: Quantum Algorithms for Matching and Network Flows. In: Durand, B., Thomas, W. (eds.) STACS 2006. LNCS, vol.\u00a03884. Springer, Heidelberg (2006)"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"778","DOI":"10.1145\/502090.502097","volume":"48","author":"R. Beals","year":"2001","unstructured":"Beals, R., Buhrman, H., Cleve, R., Mosca, M., de Wolf, R.: Quantum lower bounds by polynomials. Journal of ACM\u00a048, 778\u2013797 (2001)","journal-title":"Journal of ACM"},{"issue":"4-5","key":"22_CR7","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P","volume":"46","author":"M. Boyer","year":"1998","unstructured":"Boyer, M., Brassard, G., H\u00f8yer, P., Tapp, A.: Tight bounds on quantum searching. Fortschritte Der Physik\u00a046(4-5), 493\u2013505 (1998)","journal-title":"Fortschritte Der Physik"},{"key":"22_CR8","doi-asserted-by":"crossref","unstructured":"Buhrman, H., D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Magniez, F., Santha, M., de Wolf, R.: Quantum Algorithms for Element Distinctness. In: Proceedings of CCC 2001, pp. 131\u2013137 (2001)","DOI":"10.1109\/CCC.2001.933880"},{"key":"22_CR9","unstructured":"Brassard, G., H\u00f3yer, P., Mosca, M., Tapp, A.: Quantum amplitude amplification and estimation. In: Quantum Computation and Quantum Information: A Millennium Volume. AMS Contemporary Mathematics Series (2000)"},{"key":"22_CR10","doi-asserted-by":"crossref","unstructured":"Buhrman, H., \u0160palek, R.: Quantum Verification of Matrix Products. In: Proceedings of SODA 2006, pp. 880\u2013889 (2006)","DOI":"10.1145\/1109557.1109654"},{"key":"22_CR11","series-title":"Lecture Notes in Computer Science","first-page":"25","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"S. D\u00f6rn","year":"2007","unstructured":"D\u00f6rn, S.: Quantum Complexity Bounds of Independent Set Problems. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 25\u201336. Springer, Heidelberg (2007)"},{"key":"22_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1007\/978-3-540-27836-8_42","volume-title":"Automata, Languages and Programming","author":"C. D\u00fcrr","year":"2004","unstructured":"D\u00fcrr, C., Heiligman, M., H\u00f8yer, P., Mhalla, M.: Quantum query complexity of some graph problems. In: D\u00edaz, J., Karhum\u00e4ki, J., Lepist\u00f6, A., Sannella, D. (eds.) ICALP 2004. LNCS, vol.\u00a03142, pp. 481\u2013493. Springer, Heidelberg (2004)"},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"D\u00f6rn, S.: Quantum Algorithms for Graph Traversals and Related Problems. In: Proceedings of CIE 2007 (2007)","DOI":"10.1117\/12.719158"},{"key":"22_CR14","doi-asserted-by":"crossref","unstructured":"Grover, L.: A fast mechanical algorithm for database search. In: Proceedings of STOC 1996, pp. 212\u2013219 (1996)","DOI":"10.1145\/237814.237866"},{"key":"22_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1007\/978-3-540-24597-1_24","volume-title":"FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science","author":"T. Kavitha","year":"2003","unstructured":"Kavitha, T.: Efficient Algorithms for Abelian Group Isomorphism and Related Problems. In: Pandya, P.K., Radhakrishnan, J. (eds.) FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science. LNCS, vol.\u00a02914, pp. 277\u2013288. Springer, Heidelberg (2003)"},{"key":"22_CR16","doi-asserted-by":"crossref","unstructured":"Kempe, J., Shenvi, N., Whaley, K.B.: Quantum Random-Walk Search Algorithm. Physical Review Letters A\u00a067(5) (2003)","DOI":"10.1103\/PhysRevA.67.052307"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1312","DOI":"10.1007\/11523468_106","volume-title":"Automata, Languages and Programming","author":"F. Magniez","year":"2005","unstructured":"Magniez, F., Nayak, A.: Quantum complexity of testing group commutativity. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 1312\u20131324. Springer, Heidelberg (2005)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Magniez, F., Nayak, A., Roland, J., Santha, M.: Search via Quantum Walk. In: Proceedings of STOC 2007 (2007)","DOI":"10.1145\/1250790.1250874"},{"key":"22_CR19","unstructured":"Magniez, F., Santha, M., Szegedy, M.: Quantum Algorithms for the Triangle Problem. In: Proceedings of SODA 2005, pp. 1109\u20131117 (2005)"},{"key":"22_CR20","volume-title":"Quantum Computation and Quantum Information","author":"M.A. Nielsen","year":"2003","unstructured":"Nielsen, M.A., Chuang, I.L.: Quantum Computation and Quantum Information. Cambridge University Press, Cambridge (2003)"},{"issue":"4","key":"22_CR21","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1137\/S0097539797325387","volume":"29","author":"S. Rajagopalan","year":"2000","unstructured":"Rajagopalan, S., Schulman, L.J.: Verification of identities. SIAM J. Computing\u00a029(4), 1155\u20131163 (2000)","journal-title":"SIAM J. Computing"},{"key":"22_CR22","doi-asserted-by":"crossref","unstructured":"Simon, D.R.: On the power of quantum computation. In: Proceedings of FOCS 1994, pp. 116\u2013123 (1994)","DOI":"10.1109\/SFCS.1994.365701"},{"key":"22_CR23","doi-asserted-by":"crossref","unstructured":"Szegedy, M.: Quantum speed-up of markov chain based algorithms. In: Proceedings of FOCS 2004, pp. 32\u201341 (2004)","DOI":"10.1109\/FOCS.2004.53"}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-74240-1_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T17:27:29Z","timestamp":1737394049000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-74240-1_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540742395","9783540742401"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-74240-1_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}