An application of quantum finite automata to interactive proof systems (extended abstract)

Lecture Notes in Computer Science

Volumn 3317, Issue , 2005, Pages 225-236

  Nishimura, Harumichi ^a   Yamakami, Tomoyuki ^a  

^a TRENT UNIVERSITY   (Canada)

Author keywords

Quantum circuit; Quantum finite automaton; Quantum interactive proof system; Quantum measurement

Indexed keywords

COMMUNICATION SYSTEMS; QUANTUM THEORY;

QUANTUM CIRCUIT; QUANTUM FINITE AUTOMATA; QUANTUM INTERACTIVE PROOF SYSTEM; QUANTUM MEASUREMENT;

FINITE AUTOMATA;

EID: 23944505968     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30500-2_21     Document Type: Conference Paper

References (19)

1. A. Ambainis, M. Beaudry, M. Golovkins, A. Kikusts, M. Mercer, and D. Thérien. Algebraic results on quantum automata. In Proc. 21st STAGS, Lecture Notes in Comput. Sci., Vol.2996, pp.93-104, 2004.
2. L. Babai. Trading group theory for randomness. In Proc. 17th STOC, pp.421-429, 1985.
3. A. Borodin, S. Cook, and N. Pippenger. Parallel computation for well-endowed rings and space-bounded probabilistic machines. Inform. Control 58 (1983) 113-136.
4. A. Brodsky and N. Pippenger. Characterizations of 1-way quantum finite automata. SIAM J. Comput. 31 (2002) 1456-1478.
5. A. Condon. The complexity of space bounded interactive proof systems. In Complexity Theory: Current Research (eds. Ambos-Spies, et al.), Cambridge University Press, pp.147-189, 1993.
6. A. Condon, L. Hellerstein, S. Pottle, and A. Wigderson. On the power of finite automata with both nondeterministic and probabilistic states. SIAM J. Comput. 27 (1998) 739-762.
7. C. Dwork and L. Stockmeyer. Finite state verifiers I: the power of interaction. J. ACM 39 (1992) 800-828.
8. S. Goldwasser, S. Micali and C. Rackoff. The knowledge complexity of interactive proof systems. SIAM J. Comput. 18 (1989) 186-208.
9. S. Goldwasser and M. Sipser. Private coins versus public coins in interactive proof systems. In Proc. 18th STOC, pp.59-68, 1986.
10. J. Gruska. Quantum Computing. McGraw Hill. 1999.
11. A. Kitaev and J. Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In Proc. 32nd STOC, pp.608-617, 2000.
12. H. Kobayashi and K. Matsumoto. Quantum multi-prover interactive proof systems with limited prior entanglement. J. Comput. Syst. Sci. 66 (2003) 429-450.
13. A. Kondacs and J. Watrous. On the power of quantum finite state automata. In Proc. 38th FOCS, pp.66-75, 1997.
14. C. Moore and J. Crutchfield. Quantum automata and quantum grammars. Theor. Comput. Sci. 237 (2000) 275-306
15. M. A. Nielsen and I. L. Chuang. Quantum Computation and Quantum Information. Cambridge University Press, 2000.
16. H. Nishimura and T. Yamakami. Polynomial time quantum computation with advice. Inform. Process. Lett. 90 (2004) 195-204.
17. A. Shamir. IP=PSPACE. J. ACM 39 (1992) 869-877.
18. J. Watrous. On quantum and classical space-bounded processes with algebraic transition amplitudes. In Proc. 40th FOCS, pp.341-351, 1999.
19. J. Watrous. PSPACE has constant-round quantum interactive proof systems. Theor. Comput. Sci. 292 (2003) 575-588.