John Watrous | Academic Influence

John Watrous 's AcademicInfluence.com Rankings

John Watrous

Computer Science

#2863

World Rank

#2996

Historical Rank

Theoretical Computer Science

#127

World Rank

#127

Historical Rank

Database

#7966

World Rank

#8299

Historical Rank

computer-science Degrees

Download Badge

Computer Science

John Watrous 's Degrees

PhD Computer Science University of Oxford

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is John Watrous Influential?

(Suggest an Edit or Addition)

According to Wikipedia, John Harrison Watrous is the Technical Director of IBM Quantum Education at IBM and was a professor of computer science at the David R. Cheriton School of Computer Science at the University of Waterloo, a member of the Institute for Quantum Computing, an affiliate member of the Perimeter Institute for Theoretical Physics and a Fellow of the Canadian Institute for Advanced Research. He was a faculty member in the Department of Computer Science at the University of Calgary from 2002 to 2006 where he held a Canada Research Chair in quantum computing.

(See a Problem?)

John Watrous 's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Quantum fingerprinting. (2001) (839)
The Theory of Quantum Information (2018) (808)
One-dimensional quantum walks (2001) (569)
Consequences and limits of nonlocal strategies (2004) (409)
On the power of quantum finite state automata (1997) (378)
Quantum Computational Complexity (2008) (290)
Necessary and sufficient quantum information characterization of Einstein-Podolsky-Rosen steering. (2015) (278)
Quantum Arthur–Merlin games (2004) (250)
Zero-knowledge against quantum attacks (2005) (241)
Fast parallel circuits for the quantum Fourier transform (2000) (226)
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems (2000) (199)
Toward a general theory of quantum games (2006) (197)
Quantum simulations of classical random walks and undirected graph connectivity (1998) (186)
Semidefinite Programs for Completely Bounded Norms (2009) (179)
On one-dimensional quantum cellular automata (1995) (175)
Succinct quantum proofs for properties of finite groups (2000) (172)
PSPACE has constant-round quantum interactive proof systems (1999) (120)
One-dimensional quantum walks with absorbing boundaries (2002) (116)
QIP = PSPACE (2009) (109)
Limits on the power of quantum statistical zero-knowledge (2002) (99)
Closed timelike curves make quantum and classical computing equivalent (2008) (99)
All entangled states are useful for channel discrimination. (2009) (97)
Simpler semidefinite programs for completely bounded norms (2012) (96)
Quantum algorithms for solvable groups (2000) (96)
Notes on super-operator norms induced by schatten norms (2004) (94)
Bipartite subspaces having no bases distinguishable by local operations and classical communication. (2005) (91)
Two-way finite automata with quantum and classical state (1999) (84)
Adaptive versus nonadaptive strategies for quantum channel discrimination (2009) (82)
Space-Bounded Quantum Complexity (1999) (67)
Two-Message Quantum Interactive Proofs Are in PSPACE (2009) (61)
On the complexity of simulating space-bounded quantum computations (2004) (61)
Continuous-Time Quantum Walks on the Symmetric Group (2003) (55)
Matchgate and space-bounded quantum computations are equivalent (2009) (53)
Limitations on Separable Measurements by Convex Optimization (2014) (53)
Optimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money (2012) (47)
Zero-Knowledge Proof Systems for QMA (2016) (45)
Einstein-Podolsky-Rosen steering provides the advantage in entanglement-assisted subchannel discrimination with one-way measurements (2014) (44)
Coherent state exchange in multi-prover quantum interactive proof systems (2008) (39)
Quantum Proofs (2016) (38)
Parallel Approximation of Non-interactive Zero-sum Quantum Games (2008) (38)
Distinguishing quantum operations having few Kraus operators (2007) (35)
Quantum Interactive Proofs with Competing Provers (2004) (34)
Sharp Quantum versus Classical Query Complexity Separations (2002) (31)
Many Copies May Be Required for Entanglement Distillation (2003) (30)
QIP = PSPACE (2010) (28)
Relationships between quantum and classical space-bounded complexity classes (1998) (22)
Operational meaning of quantum measures of recovery (2015) (22)
Extended non-local games and monogamy-of-entanglement games (2015) (22)
Revisiting the simulation of quantum Turing machines by quantum circuits (2018) (21)
Entanglement in channel discrimination with restricted measurements (2010) (20)
Mixing doubly stochastic quantum channels with the completely depolarizing channel (2008) (19)
Space-bounded quantum computation (1998) (19)
Quantum statistical zero-knowledge (2002) (18)
Sharp Quantum vs. Classical Query Complexity Separations (2000) (18)
Quantum interactive proofs with weak error bounds (2010) (16)
On the complementary quantum capacity of the depolarizing channel (2015) (16)
Hedging bets with correlated quantum strategies (2011) (15)
On quantum and classical space-bounded processes with algebraic transition amplitudes (1999) (15)
Ancilla Dimension in Quantum Channel Discrimination (2016) (12)
Guest column: an introduction to quantum information and quantum circuits 1 (2011) (12)
Quantum Interactive Proofs with Short Messages (2010) (12)
QIP = PSPACE (2010) (12)
Certifying optimality for convex quantum channel optimization problems (2018) (9)
PSPACE has 2-round quantum interactive proof systems (1999) (9)
On the Power of 2-Way Quantum Finite State AutomataJohn (1997) (8)
On the Mixed-Unitary Rank of Quantum Channels (2020) (8)
Cs 798: Theory of Quantum Information Linear Algebra and Analysis 1 Linear Algebra (2007) (7)
Detecting mixed-unitary quantum channels is NP-hard (2019) (7)
Bipartite subspaces having no LOCC-distinguishable bases (2005) (6)
Oracle Separations for Quantum Statistical Zero-Knowledge (2018) (6)
Quantum Fourier transforms for extracting hidden linear structures in finite fields (2000) (5)
Quantum game theory and the complexity of approximating quantum Nash equilibria (2021) (5)
An introduction to quantum information and quantum circuits (2011) (4)
On the number of copies required for entanglement distillation (2003) (4)
The quantum game. (2017) (3)
Extended Nonlocal Games from Quantum-Classical Games (2017) (2)
Ribosomal Robotics Approaches Critical Experiments; Government Agencies Watch with Mixed Interest (1998) (2)
Zero-knowledge against quantum attacks (Preliminary version) (2005) (1)
Complexity Limitations on One-turn Quantum Refereed Games (2020) (1)
Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011) (2012) (1)
Time-reversal of rank-one quantum strategyewline functions (2018) (0)
Cs 798: Theory of Quantum Information Overview of Quantum Information; Purifications and Fidelity 1 Overview of Quantum Information (2007) (0)
Arthur and Merlin in a quantum world (2002) (0)
One-Dimensional Quantum Walks Andris Ambainis (2008) (0)
Harmonic and transpositional logic in the first movement of the Schoenberg "Violin concerto" (1986) (0)
Cpsc 519/619: Quantum Computation Lecture 8: Phase Estimation (0)
N ov 2 00 5 Zero-knowledge against quantum attacks ( Preliminary version ) (2022) (0)
Cpsc 519/619: Quantum Computation Lecture 1: Overview of Quantum Information Quantum Information (0)
Time-reversal of rank-one quantum strategy functions (2018) (0)
Cpsc 519/619: Quantum Computation Lecture 9: Phase Estimation (continued); the Quantum Fourier Transform Phase Estimation (continued) (0)
Sharp Quantum versus Classical Query Complexity Separations 1 (2006) (0)
D ec 2 00 1 Sharp quantum vs . classical query complexity separations (2001) (0)
02 02 11 1 v 1 2 0 Fe b 20 02 Quantum statistical zero-knowledge (2002) (0)
Cs 798: Theory of Quantum Information Operator Decompositions and Norms; Operator-vector Correspondence 1.1 the Spectral Decomposition (2007) (0)
Cpsc 519/619: Quantum Computation Lecture 17: General Quantum Errors; Css Codes General Quantum Errors (0)
A pr 2 00 4 Consequences and Limits of Nonlocal Strategies (2004) (0)
Cpsc 519/619: Quantum Computation Lecture 7: Arithmetic/number-theoretic Problems; Reversible Computation Arithmetic/number-theoretic Problems (0)
Cpsc 519/619: Quantum Computation Density Matrices (0)
Ancilla Dimension in Quantum Channel Discrimination (2016) (0)
Entropy and noiseless coding (2007) (0)
Cpsc 519/619: Quantum Computation Lecture 22: Quantum Computational Complexity Promise Problems and Complexity Classes (0)

This paper list is powered by the following services:

Other Resources About John Watrous

en.wikipedia.org

What Schools Are Affiliated With John Watrous ?

John Watrous is affiliated with the following schools:

Image Attributions

Image Source for John Watrous