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

Authors:
Harumichi Nishimura;Tomoyuki Yamakami
Affiliations:
Department of Computer Science, Trent University, Peterborough, Ontario, Canada;Department of Computer Science, Trent University, Peterborough, Ontario, Canada
Venue:
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Year:
2004

Citing 17
Cited 1

Parallel computation for well-endowed rings and space-bounded probabilistic machines

Information and Control
Private coins versus public coins in interactive proof systems

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Trading group theory for randomness

STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems

SIAM Journal on Computing
Finite state verifiers I: the power of interaction

Journal of the ACM (JACM)
IP = PSPACE

Journal of the ACM (JACM)
The complexity of space bounded interactive proof systems

Complexity theory
On the Power of Finite Automata with both Nondeterministic and Probabilistic States

SIAM Journal on Computing
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Quantum automata and quantum grammars

Theoretical Computer Science
Quantum computation and quantum information

Quantum computation and quantum information
Characterizations of 1-Way Quantum Finite Automata

SIAM Journal on Computing
PSPACE has constant-round quantum interactive proof systems

Theoretical Computer Science - Algorithms,automata, complexity and games
On the power of quantum finite state automata

FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
On Quantum and Classical Space-Bounded Processes with Algebraic Transition Amplitudes

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Quantum multi-prover interactive proof systems with limited prior entanglement

Journal of Computer and System Sciences
Polynomial time quantum computation with advice

Information Processing Letters

Automata theory based on quantum logic: Reversibilities and pushdown automata

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Quantum finite automata have been studied intensively since their introduction in late 1990s. This paper seeks their direct application to interactive proof systems in which a mighty quantum prover communicates with a quantum-automaton verifier through a common communication cell.