{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,17]],"date-time":"2026-04-17T22:22:43Z","timestamp":1776464563321,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540407706","type":"print"},{"value":"9783540451983","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45198-3_25","type":"book-chapter","created":{"date-parts":[[2011,1,8]],"date-time":"2011-01-08T03:32:30Z","timestamp":1294457550000},"page":"290-301","source":"Crossref","is-referenced-by-count":38,"title":["Continuous-Time Quantum Walks on the Symmetric Group"],"prefix":"10.1007","author":[{"given":"Heath","family":"Gerhardt","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John","family":"Watrous","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Ambainis, A., Kempe, J., Vazirani, U.: Quantum walks on graphs. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 50\u201359 (2001)","DOI":"10.1145\/380752.380758"},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Aharonov, D., Ta Shma, A.: Adiabatic quantum state generation and statistical zero knowledge. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (2003)","DOI":"10.1145\/780542.780546"},{"key":"25_CR3","unstructured":"Ahmadi, A., Belk, R., Tamon, C., Wendler, C.: Mixing in continuous quantum walks on graphs. arXiv.org e-Print quant-ph\/0209106 (2002)"},{"key":"25_CR4","unstructured":"Aldous, D., Fill, J.: Reversible markov chains and random walks on graphs (2002), See http:\/\/stat-www.berkeley.edu\/users\/aldous\/RWG\/book.html"},{"key":"25_CR5","doi-asserted-by":"crossref","unstructured":"Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., Watrous, J.: One-dimensional quantum walks. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, pp. 60\u201369 (2001)","DOI":"10.1145\/380752.380757"},{"key":"25_CR6","unstructured":"Bach, E., Coppersmith, S., Goldschen, M., Joynt, R., Watrous, J.: Onedimensional quantum walks with absorbing boundaries. arXiv.org e-Print quantph\/0207008 (2002)"},{"key":"25_CR7","unstructured":"Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. In: Proceedings of the IEEE International Conference on Computers, Systems, and Signal Processing, pp. 175\u2013179 (1984)"},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Childs, A., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., Spielman, D.: Exponential algorithmic speedup by quantum walk. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (2003)","DOI":"10.1145\/780542.780552"},{"key":"25_CR9","doi-asserted-by":"crossref","unstructured":"Childs, A., Farhi, E., Gutmann, S.: An example of the difference between quantum and classical random walks. Quantum Information Processing\u00a01(35) (2002)","DOI":"10.1023\/A:1019609420309"},{"key":"25_CR10","doi-asserted-by":"crossref","unstructured":"Diaconis, P.: Group Representations in Probability and Statistics. Lecture Notes- Monograph Series. Institute of Mathematical Statistics (1988)","DOI":"10.1214\/lnms\/1215467407"},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1103\/PhysRevA.58.915","volume":"58","author":"E. Farhi","year":"1998","unstructured":"Farhi, E., Gutmann, S.: Quantum computation and decision trees. Physical Review A\u00a058, 915\u2013928 (1998)","journal-title":"Physical Review A"},{"key":"25_CR12","series-title":"Springer Tracts in Modern Physics","volume-title":"Quantum Information: An Introduction to Basic Theoretical Concepts and Experiments","author":"M. Horodecki","year":"2001","unstructured":"Horodecki, M., Horodecki, P., Horodecki, R.: Mixed-state entanglement and quantum communication. In: Quantum Information: An Introduction to Basic Theoretical Concepts and Experiments. Springer Tracts in Modern Physics, vol.\u00a0173, Springer, Heidelberg (2001)"},{"key":"25_CR13","doi-asserted-by":"crossref","unstructured":"Ingram, R.: Some characters of the symmetric group. In: Proc. Amer. Math. Soc., vol.\u00a01, pp. 358\u2013369 (1950)","DOI":"10.1090\/S0002-9939-1950-0036761-1"},{"key":"25_CR14","volume-title":"The Representation Theory of the Symmetric Group","author":"G. James","year":"1981","unstructured":"James, G., Kerber, A.: The Representation Theory of the Symmetric Group. Addison-Wesley, Reading (1981)"},{"key":"25_CR15","doi-asserted-by":"crossref","unstructured":"Kempe, J.: Quantum random walks hit exponentially faster. arXiv.org e-Print quant-ph\/0205083 (2002)","DOI":"10.1007\/978-3-540-45198-3_30"},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Kempe, J.: Quantum random walks \u2013 an introductory overview. Contemporary Physics (2003), See also arXiv.org e-Print quant-ph\/0303081 (to appear)","DOI":"10.1080\/00107151031000110776"},{"key":"25_CR17","doi-asserted-by":"crossref","unstructured":"Kerenidis, I., de Wolf, R.: Exponential lower bound for 2-query locally decodable codes via a quantum argument. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (2003)","DOI":"10.1145\/780542.780560"},{"key":"25_CR18","unstructured":"Mackay, T., Bartlett, S., Stephenson, L., Sanders, B.: Quantum walks in higher dimensions. arXiv.org e-Print quant-ph\/0108004 (2001)"},{"key":"25_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/3-540-45726-7_14","volume-title":"Randomization and Approximation Techniques in Computer Science","author":"C. Moore","year":"2002","unstructured":"Moore, C., Russell, A.: Quantum walks on the hypercube. In: Rolim, J.D.P., Vadhan, S.P. (eds.) RANDOM 2002. LNCS, vol.\u00a02483, p. 164. Springer, Heidelberg (2002)"},{"issue":"5","key":"25_CR20","doi-asserted-by":"publisher","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 Journal on Computing\u00a026(5), 1484\u20131509 (1997)","journal-title":"SIAM Journal on Computing"},{"key":"25_CR21","doi-asserted-by":"crossref","unstructured":"Shor, P., Preskill, J.: Simple proof of security of the BB84 quantum key distribution protocol. arXiv.org e-Print quant-ph\/0003004 (2000)","DOI":"10.1103\/PhysRevLett.85.441"},{"key":"25_CR22","volume-title":"Group Theory and Physics","author":"S. Sternberg","year":"1994","unstructured":"Sternberg, S.: Group Theory and Physics. Cambridge University Press, Cambridge (1994)"},{"key":"25_CR23","doi-asserted-by":"crossref","unstructured":"Yamasaki, T., Kobayashi, H., Imai, H.: Analysis of absorbing times of quantum walks. arXiv.org e-Print quant-ph\/0205045 (2002)","DOI":"10.1007\/3-540-45833-6_26"}],"container-title":["Lecture Notes in Computer Science","Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45198-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,2]],"date-time":"2024-04-02T21:35:24Z","timestamp":1712093724000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45198-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407706","9783540451983"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45198-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003]]}}}