Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Watrous, John - School of Computer Science, University of Waterloo
Limits on the power of quantum statistical zero-knowledge John Watrous
Quantum interactive proofs with short messages Salman Beigi Peter W. Shor John Watrous
Notes on super-operator norms induced by Schatten norms John Watrous
Continuous-time quantum walks on the symmetric group Heath Gerhardt John Watrous
Fast parallel circuits for the quantum Fourier transform Richard Cleve John Watrous
Parallel approximation of non-interactive zero-sum quantum games
Space-Bounded Quantum Complexity John Watrous
On the hardness of distinguishing mixed-state quantum computations Bill Rosgen
Succinct quantum proofs for properties of finite groups John Watrous
Coherent state exchange in multi-prover quantum interactive proof systems
Quantum ArthurMerlin Games Chris Marriott John Watrous
Mixing doubly stochastic quantum channels with the completely depolarizing channel
On the Power of Quantum Finite State Automata Attila Kondacs John Watrousy
Entanglement in channel discrimination with restricted measurements
Adaptive versus non-adaptive strategies for quantum channel discrimination
Quantum Computational Complexity John Watrous
Distinguishing quantum operations having few Kraus operators
Toward a General Theory of Quantum Games Gus Gutoski John Watrous
Bipartite subspaces having no bases distinguishable by local operations and classical communication
Quantum Interactive Proofs with Competing Provers Gus Gutoski John Watrous
One-dimensional quantum walks with absorbing boundaries
Consequences and Limits of Nonlocal Strategies Richard Cleve Peter Hyer Ben Toner John Watrous
On the Complexity of Simulating Space-Bounded Quantum Computations
Quantum Algorithms for Solvable Groups John Watrous
One-Dimensional Quantum Walks Andris Ambainis Eric Bach Ashwin Nayak Ashvin Vishwanath John Watrous
Quantum simulations of classical random walks and undirected graph connectivity
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
All entangled states are useful for channel discrimination Marco Piani1
Many copies may be required for entanglement distillation John Watrous
PSPACE has constant-round quantum interactive proof systems John Watrous
Matchgate and space-bounded quantum computations are equivalent
Semidefinite programs for completely bounded norms John Watrous
Two-message quantum interactive proofs are in PSPACE Rahul Jain Sarvagya Upadhyay John Watrous
Zero-Knowledge Against Quantum Attacks John Watrous
On One-Dimensional Quantum Cellular Automata John Watrous
Hedging bets with correlated quantum strategies Abel Molina and John Watrous
Quantum interactive proofs with weak error bounds Tsuyoshi Ito
An introduction to quantum information and quantum circuits