John Watrous

2008
37	EE	Scott Aaronson, John Watrous: Closed Timelike Curves Make Quantum and Classical Computing Equivalent. Electronic Colloquium on Computational Complexity (ECCC) 15(092): (2008)
2007
36	EE	Gus Gutoski, John Watrous: Toward a general theory of quantum games. STOC 2007: 565-574
2006
35	EE	John Watrous: Zero-knowledge against quantum attacks. STOC 2006: 296-305
34	EE	Gus Gutoski, John Watrous: Toward a general theory of quantum games CoRR abs/quant-ph/0611234: (2006)
2005
33	EE	Gus Gutoski, John Watrous: Quantum Interactive Proofs with Competing Provers. STACS 2005: 605-616
32	EE	Chris Marriott, John Watrous: Quantum Arthur-Merlin Games CoRR abs/cs/0506068: (2005)
31	EE	Chris Marriott, John Watrous: Quantum Arthur-Merlin games. Computational Complexity 14(2): 122-152 (2005)
2004
30	EE	Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous: Consequences and Limits of Nonlocal Strategies. IEEE Conference on Computational Complexity 2004: 236-249
29	EE	Chris Marriott, John Watrous: Quantum Arthur-Merlin Games. IEEE Conference on Computational Complexity 2004: 275-285
28	EE	Gus Gutoski, John Watrous: Quantum Interactive Proofs with Competing Provers CoRR abs/cs/0412102: (2004)
27	EE	Bill Rosgen, John Watrous: On the hardness of distinguishing mixed-state quantum computations CoRR cs.CC/0407056: (2004)
26	EE	Eric Bach, Susan Coppersmith, Marcel Paz Goldschen, Robert Joynt, John Watrous: One-dimensional quantum walks with absorbing boundaries. J. Comput. Syst. Sci. 69(4): 562-592 (2004)
2003
25	EE	Heath Gerhardt, John Watrous: Continuous-Time Quantum Walks on the Symmetric Group. RANDOM-APPROX 2003: 290-301
24	EE	John Watrous: On the complexity of simulating space-bounded quantum computations. Computational Complexity 12(1-2): 48-84 (2003)
23		John Watrous: PSPACE has constant-round quantum interactive proof systems. Theor. Comput. Sci. 292(3): 575-588 (2003)
2002
22	EE	John Watrous: imits on the Power of Quantum Statistical Zero-Knowledge. FOCS 2002: 459-
21	EE	John Watrous: Arthur and Merlin in a Quantum World. IEEE Conference on Computational Complexity 2002: 161
20	EE	J. Niel de Beaudrap, Richard Cleve, John Watrous: Sharp Quantum versus Classical Query Complexity Separations. Algorithmica 34(4): 449-461 (2002)
19		Andris Ambainis, John Watrous: Two-way finite automata with quantum and classical state. Theor. Comput. Sci. 287(1): 299-311 (2002)
2001
18	EE	Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous: One-dimensional quantum walks. STOC 2001: 37-49
17	EE	John Watrous: Quantum algorithms for solvable groups. STOC 2001: 60-67
16		John Watrous: Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. J. Comput. Syst. Sci. 62(2): 376-391 (2001)
2000
15		Richard Cleve, John Watrous: Fast parallel circuits for the quantum Fourier transform. FOCS 2000: 526-536
14		John Watrous: Succinct quantum proofs for properties of finite groups. FOCS 2000: 537-546
13	EE	Alexei Kitaev, John Watrous: Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. STOC 2000: 608-617
12	EE	John Watrous: Succinct quantum proofs for properties of finite groups CoRR cs.CC/0009002: (2000)
1999
11	EE	John Watrous: PSPACE Has Constant-Round Quantum Interactive Proof Systems. FOCS 1999: 112-119
10	EE	John Watrous: On Quantum and Classical Space-bounded Processes with Algebraic Transition Amplitudes. FOCS 1999: 341-351
9	EE	John Watrous: Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. IEEE Conference on Computational Complexity 1999: 180-187
8	EE	John Watrous: PSPACE has 2-round quantum interactive proof systems CoRR cs.CC/9901015: (1999)
7	EE	John Watrous: On quantum and classical space-bounded processes with algebraic transition amplitudes CoRR cs.CC/9911008: (1999)
6	EE	Andris Ambainis, John Watrous: Two-way finite automata with quantum and classical states CoRR cs.CC/9911009: (1999)
5		John Watrous: Space-Bounded Quantum Complexity. J. Comput. Syst. Sci. 59(2): 281-326 (1999)
1998
4	EE	John Watrous: Relationships Between Quantum and Classical Space-Bounded Complexity Classes. IEEE Conference on Computational Complexity 1998: 210-227
3	EE	John Watrous: Quantum simulations of classical random walks and undirected graph connectivity CoRR cs.CC/9812012: (1998)
1997
2	EE	Attila Kondacs, John Watrous: On the Power of Quantum Finite State Automata. FOCS 1997: 66-75
1995
1		John Watrous: On One-Dimensional Quantum Cellular Automata. FOCS 1995: 528-537

Coauthor Index

1	Scott Aaronson	[37]
2	Andris Ambainis	[6] [18] [19]
3	Eric Bach	[18] [26]
4	J. Niel de Beaudrap	[20]
5	Richard Cleve	[15] [20] [30]
6	Susan Coppersmith	[26]
7	Heath Gerhardt	[25]
8	Marcel Paz Goldschen	[26]
9	Gus Gutoski	[28] [33] [34] [36]
10	Peter Høyer	[30]
11	Robert Joynt	[26]
12	Alexei Kitaev	[13]
13	Attila Kondacs	[2]
14	Chris Marriott	[29] [31] [32]
15	Ashwin Nayak	[18]
16	Bill Rosgen	[27]
17	Benjamin Toner	[30]
18	Ashvin Vishwanath	[18]

Colors in the list of coauthors