Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > AUTHORS > HARUMICHI NISHIMURA:
All reports by Author Harumichi Nishimura:

TR04-110 | 24th November 2004
Tomoyuki Yamakami, Harumichi Nishimura

An Application of Quantum Finite Automata to Interactive Proof Systems

Quantum finite automata have been studied intensively since
their introduction in late 1990s as a natural model of a
quantum computer with finite-dimensional quantum memory space.
This paper seeks their direct application
to interactive proof systems in which a mighty quantum prover
communicates with a ... more >>>


TR03-059 | 18th May 2003
Harumichi Nishimura, Tomoyuki Yamakami

Polynomial time quantum computation with advice

Revisions: 2

Advice is supplementary information that enhances the computational
power of an underlying computation. This paper focuses on advice that
is given in the form of a pure quantum state. The notion of advised
quantum computation has a direct connection to non-uniform quantum
circuits and tally languages. The paper examines the ... more >>>




ISSN 1433-8092 | Imprint