Follow
John Watrous
John Watrous
IBM Quantum
Verified email at ibm.com
Title
Cited by
Cited by
Year
The Theory of Quantum Information
J Watrous
https://cs.uwaterloo.ca/~watrous/TQI/, 2018
15292018
Quantum fingerprinting
H Buhrman, R Cleve, J Watrous, R de Wolf
Physical Review Letters 87 (16), 167902, 2001
13112001
One-dimensional quantum walks
A Ambainis, E Bach, A Nayak, A Vishwanath, J Watrous
Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing …, 2001
788*2001
On the power of quantum finite state automata
A Kondacs, J Watrous
Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer …, 1997
5601997
Consequences and limits of nonlocal strategies
R Cleve, P Hoyer, B Toner, J Watrous
Computational Complexity, 2004. Proceedings. 19th IEEE Annual Conference on …, 2004
4972004
Necessary and sufficient quantum information characterization of Einstein-Podolsky-Rosen steering
M Piani, J Watrous
Physical Review Letters 114 (6), 060404, 2015
4742015
Quantum computational complexity
J Watrous
Encyclopedia of Complexity and System Science, 2009
3622009
Quantum Arthur–Merlin games
C Marriott, J Watrous
Computational Complexity 14 (2), 122-152, 2005
3042005
Zero-knowledge against quantum attacks
J Watrous
SIAM Journal on Computing 39 (1), 25-58, 2008
3022008
Fast parallel circuits for the quantum Fourier transform
R Cleve, J Watrous
Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on …, 2000
2572000
Toward a general theory of quantum games
G Gutoski, J Watrous
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 565-574, 2007
2542007
Semidefinite programs for completely bounded norms
J Watrous
Arxiv preprint arXiv:0901.4709, 2009
2512009
Quantum simulations of classical random walks and undirected graph connectivity
J Watrous
Computational Complexity, 1999. Proceedings. Fourteenth Annual IEEE …, 1999
2331999
Two-way finite automata with quantum and classical states
A Ambainis, J Watrous
Theoretical Computer Science 287 (1), 299-311, 2002
2312002
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
A Kitaev, J Watrous
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
2312000
On one-dimensional quantum cellular automata
J Watrous
Foundations of Computer Science, 1995. Proceedings., 36th Annual Symposium …, 1995
2181995
QIP = PSPACE
R Jain, Z Ji, S Upadhyay, J Watrous
Journal of the ACM 58 (6), 30, 2011
2172011
Succinct quantum proofs for properties of finite groups
J Watrous
Foundations of Computer Science, 2000. Proceedings. 41st Annual Symposium on …, 2000
1972000
PSPACE has constant-round quantum interactive proof systems
J Watrous
Theoretical Computer Science 292 (3), 575-588, 2003
160*2003
All entangled states are useful for channel discrimination
M Piani, J Watrous
Physical review letters 102 (25), 250501, 2009
1582009
The system can't perform the operation now. Try again later.
Articles 1–20