{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T19:02:46Z","timestamp":1767034966277},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540243182"},{"type":"electronic","value":"9783540305002"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-30500-2_21","type":"book-chapter","created":{"date-parts":[[2010,3,1]],"date-time":"2010-03-01T16:39:36Z","timestamp":1267461576000},"page":"225-236","source":"Crossref","is-referenced-by-count":2,"title":["An Application of Quantum Finite Automata to Interactive Proof Systems (Extended Abstract)"],"prefix":"10.1007","author":[{"given":"Harumichi","family":"Nishimura","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomoyuki","family":"Yamakami","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-24749-4_9","volume-title":"STACS 2004","author":"A. Ambainis","year":"2004","unstructured":"Ambainis, A., Beaudry, M., Golovkins, M., \u0136ikusts, A., Mercer, M., Th\u00e9rien, D.: Algebraic results on quantum automata. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol.\u00a02996, pp. 93\u2013104. Springer, Heidelberg (2004)"},{"key":"21_CR2","doi-asserted-by":"crossref","unstructured":"Babai, L.: Trading group theory for randomness. In: Proc. 17th STOC, pp. 421\u2013429 (1985)","DOI":"10.1145\/22145.22192"},{"key":"21_CR3","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/S0019-9958(83)80060-6","volume":"58","author":"A. Borodin","year":"1983","unstructured":"Borodin, A., Cook, S., Pippenger, N.: Parallel computation for well-endowed rings and space-bounded probabilistic machines. Inform. Control\u00a058, 113\u2013136 (1983)","journal-title":"Inform. Control"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1137\/S0097539799353443","volume":"31","author":"A. Brodsky","year":"2002","unstructured":"Brodsky, A., Pippenger, N.: Characterizations of 1-way quantum finite automata. SIAM J. Comput.\u00a031, 1456\u20131478 (2002)","journal-title":"SIAM J. Comput."},{"key":"21_CR5","first-page":"147","volume-title":"Complexity Theory: Current Research","author":"A. Condon","year":"1993","unstructured":"Condon, A.: The complexity of space bounded interactive proof systems. In: Ambos-Spies, et al. (eds.) Complexity Theory: Current Research, pp. 147\u2013189. Cambridge University Press, Cambridge (1993)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"739","DOI":"10.1137\/S0097539794265578","volume":"27","author":"A. Condon","year":"1998","unstructured":"Condon, A., Hellerstein, L., Pottle, S., Wigderson, A.: On the power of finite automata with both nondeterministic and probabilistic states. SIAM J. Comput.\u00a027, 739\u2013762 (1998)","journal-title":"SIAM J. Comput."},{"key":"21_CR7","doi-asserted-by":"publisher","first-page":"800","DOI":"10.1145\/146585.146599","volume":"39","author":"C. Dwork","year":"1992","unstructured":"Dwork, C., Stockmeyer, L.: Finite state verifiers I: the power of interaction. J. ACM\u00a039, 800\u2013828 (1992)","journal-title":"J. ACM"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1137\/0218012","volume":"18","author":"S. Goldwasser","year":"1989","unstructured":"Goldwasser, S., Micali, S., Rackoff, C.: The knowledge complexity of interactive proof systems. SIAM J. Comput.\u00a018, 186\u2013208 (1989)","journal-title":"SIAM J. Comput."},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Goldwasser, S., Sipser, M.: Private coins versus public coins in interactive proof systems. In: Proc. 18th STOC, pp. 59\u201368 (1986)","DOI":"10.1145\/12130.12137"},{"key":"21_CR10","volume-title":"Quantum Computing","author":"J. Gruska","year":"1999","unstructured":"Gruska, J.: Quantum Computing. McGraw Hill, New York (1999)"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Kitaev, A., Watrous, J.: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In: Proc. 32nd STOC, pp. 608\u2013617 (2000)","DOI":"10.1145\/335305.335387"},{"key":"21_CR12","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1016\/S0022-0000(03)00035-7","volume":"66","author":"H. Kobayashi","year":"2003","unstructured":"Kobayashi, H., Matsumoto, K.: Quantum multi-prover interactive proof systems with limited prior entanglement. J. Comput. Syst. Sci.\u00a066, 429\u2013450 (2003)","journal-title":"J. Comput. Syst. Sci."},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Kondacs, A., Watrous, J.: On the power of quantum finite state automata. In: Proc. 38th FOCS, pp. 66\u201375 (1997)","DOI":"10.1109\/SFCS.1997.646094"},{"key":"21_CR14","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1016\/S0304-3975(98)00191-1","volume":"237","author":"C. Moore","year":"2000","unstructured":"Moore, C., Crutchfield, J.: Quantum automata and quantum grammars. Theor. Comput. Sci.\u00a0237, 275\u2013306 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"21_CR15","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":"21_CR16","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.ipl.2004.02.005","volume":"90","author":"H. Nishimura","year":"2004","unstructured":"Nishimura, H., Yamakami, T.: Polynomial time quantum computation with advice. Inform. Process. Lett.\u00a090, 195\u2013204 (2004)","journal-title":"Inform. Process. Lett."},{"key":"21_CR17","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1145\/146585.146609","volume":"39","author":"A. Shamir","year":"1992","unstructured":"Shamir, A.: IP=PSPACE. J. ACM\u00a039, 869\u2013877 (1992)","journal-title":"J. ACM"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Watrous, J.: On quantum and classical space-bounded processes with algebraic transition amplitudes. In: Proc. 40th FOCS, pp. 341\u2013351 (1999)","DOI":"10.1109\/SFFCS.1999.814605"},{"key":"21_CR19","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1016\/S0304-3975(01)00375-9","volume":"292","author":"J. Watrous","year":"2003","unstructured":"Watrous, J.: PSPACE has constant-round quantum interactive proof systems. Theor. Comput. Sci.\u00a0292, 575\u2013588 (2003)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30500-2_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:57:12Z","timestamp":1605761832000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30500-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540243182","9783540305002"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30500-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}