#### Filter Results:

- Full text PDF available (61)

#### Publication Year

1992

2018

- This year (3)
- Last 5 years (25)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami
- ISAAC
- 2003

This paper introduces quantum “multiple-Merlin”-Arthur proof systems in which Arthur receives multiple quantum proofs that are unentangled with each other. Although classical multi-proof systems are… (More)

- Kohtaro Tadaki, Tomoyuki Yamakami, Jack C. H. Lin
- SOFSEM
- 2004

A theory of one-tape (one-head) linear-time Turing machines is essentially different from its polynomial-time counterpart since these machines are closely related to finite state automata. This paper… (More)

- Harumichi Nishimura, Tomoyuki Yamakami
- Electronic Colloquium on Computational Complexity
- 2003

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… (More)

- Tomoyuki Yamakami
- MFCS
- 1999

The notion of quantum Turing machines is a basis of quantum complexity theory. We discuss a general model of multi-tape, multihead Quantum Turing machines with multi final states that also allow tape… (More)

- Tomoyuki Yamakami
- Int. J. Found. Comput. Sci.
- 2003

Quantum functions are functions that can be computed by means of quantum mechanical device. This paper investigates quantum functions that take classical bit inputs. We explore basic properties and… (More)

- Tomoyuki Yamakami
- ISAAC
- 2009

We discuss the power and limitation of various “advice,” when it is given particularly to weak computational models of one-tape linear-time Turing machines and one-way finite (state) automata. Of… (More)

- Tomoyuki Yamakami
- Theor. Comput. Sci.
- 2011

We examine the computational complexity of context-free languages, mainly concentrating on two well-known structural properties—immunity and pseudorandomness. An infinite language is REG-immune… (More)

- Akinori Kawachi, Takeshi Koshiba, Harumichi Nishimura, Tomoyuki Yamakami
- Journal of Cryptology
- 2005

We introduce a computational problem of distinguishing between two specific quantum states as a new cryptographic problem to design a quantum cryptographic scheme that is “secure” against any… (More)

In formal language theory, one of the most fundamental tools, known as pumping lemmas, is extremely useful for regular and context-free languages. However, there are natural properties for which the… (More)

- Stephen A. Cook, Russell Impagliazzo, Tomoyuki Yamakami
- Inf. Comput.
- 1997

We show that any two complexity classes satisfying some general conditions are distinct relative to a generic oracle i the corresponding type-2 classes are distinct. 3