#### Filter Results:

- Full text PDF available (63)

#### Publication Year

1991

2018

- This year (5)
- Last 5 years (12)
- Last 10 years (33)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Attila Kondacs, John Watrous
- FOCS
- 1997

In this paper, we introduce 1-way and 2-way quantum nite state automata (1qfa's and 2qfa's), which are the quantum analogues of deterministic, nondeter-ministic and probabilistic 1-way and 2-way niteâ€¦ (More)

- Andris Ambainis, John Watrous
- Theor. Comput. Sci.
- 2002

We introduce 2-way finite automata with quantum and classical states (2qcfa's). This is a variant on the 2-way quantum finite automata (2qfa) model which may be simpler to implement than unrestrictedâ€¦ (More)

- Chris Marriott, John Watrous
- computational complexity
- 2004

This paper studies quantum Arthurâ€“Merlin games, which are Arthurâ€“Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum information. As in theâ€¦ (More)

Parallelization, amplification, and exponential time simulation of quantum interactive proof systems

- Alexei Y. Kitaev, John Watrous
- STOC
- 2000

In this paper we consider quantum interactive proof systems, which are interactive proof systems in which the prover and verifier may perform quantum computations and exchange quantum information. Weâ€¦ (More)

- John Watrous
- FOCS
- 2000

In this paper we consider a quantum computational variant of nondeterminism based on the notion of a quantum proof, which is a quantum state that plays a role similar to a certificate in an NP-typeâ€¦ (More)

- Richard Cleve, Peter HÃ¸yer, Benjamin Toner, John Watrous
- Proceedings. 19th IEEE Annual Conference onâ€¦
- 2004

This paper investigates various aspects of the nonlocal effects that can arise when entangled quantum information is shared between two parties. A natural framework for studying nonlocality is thatâ€¦ (More)

We define and analyze quantum computational variants of random walks on one-dimensional lattices. In particular, we analyze a quantum analog of the symmetric random walk, which we call theâ€¦ (More)

- John Watrous
- STOC
- 2006

This paper proves that several interactive proof systems are zero-knowledge against general quantum attacks. This includes the well-known Goldreich-Micali-Wigderson classical zero-knowledge protocolsâ€¦ (More)

- John Watrous
- J. Comput. Syst. Sci.
- 1999

This paper investigates the computational power of space-bounded quantum Turing machines. The following facts are proved for space-constructible space bounds s satisfying s(n) = Î©(log n). 1. Anyâ€¦ (More)

- John Watrous
- FOCS
- 2002

In this paper we propose a definition for honest verifier quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZKHV. We proveâ€¦ (More)