John Watrous

From MaRDI portal


List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Zero-knowledge proof systems for QMA
SIAM Journal on Computing
2025-01-14Paper
Complexity limitations on one-turn quantum refereed games
Theory of Computing Systems
2023-05-02Paper
On the mixed-unitary rank of quantum channels
Communications in Mathematical Physics
2022-08-18Paper
Revisiting the simulation of quantum Turing machines by quantum circuits
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
2021-10-29Paper
Extended nonlocal games from quantum-classical games
Chicago Journal of Theoretical Computer Science
2018-08-08Paper
The theory of quantum information
 
2018-03-28Paper
Hedging bets with correlated quantum strategies
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
2017-09-29Paper
Extended non-local games and monogamy-of-entanglement games
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
2017-09-29Paper
Ancilla dimension in quantum channel discrimination
Annales Henri Poincaré
2017-05-19Paper
Limitations on Separable Measurements by Convex Optimization
IEEE Transactions on Information Theory
2017-04-28Paper
Quantum interactive proofs with weak error bounds
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
2016-10-07Paper
Quantum proofs
Foundations and Trends in Theoretical Computer Science
2016-05-23Paper
Optimal counterfeiting attacks and generalizations for Wiesner's quantum money
Theory of Quantum Computation, Communication, and Cryptography
2015-12-03Paper
One-dimensional quantum walks
Proceedings of the thirty-third annual ACM symposium on Theory of computing
2015-02-27Paper
Quantum algorithms for solvable groups
Proceedings of the thirty-third annual ACM symposium on Theory of computing
2015-02-27Paper
Zero-knowledge against quantum attacks
Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing
2014-11-25Paper
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
Proceedings of the thirty-second annual ACM symposium on Theory of computing
2014-09-26Paper
\(\mathrm{QIP} = \mathrm{PSPACE}\)
Proceedings of the forty-second ACM symposium on Theory of computing
2014-08-13Paper
Two-Message Quantum Interactive Proofs Are in PSPACE
2009 50th Annual IEEE Symposium on Foundations of Computer Science
2014-07-25Paper
Simpler semidefinite programs for completely bounded norms
Chicago Journal of Theoretical Computer Science
2014-05-07Paper
scientific article; zbMATH DE number 6292749 (Why is no real title available?)
Chicago Journal of Theoretical Computer Science
2014-05-07Paper
QIP = PSPACE
Journal of the ACM
2014-02-17Paper
scientific article; zbMATH DE number 5899305 (Why is no real title available?)
Theory of Computing
2011-05-24Paper
Semidefinite programs for completely bounded norms
Theory of Computing
2011-05-24Paper
Matchgate and space-bounded quantum computations are equivalent
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
2010-10-02Paper
Continuous-time quantum walks on the symmetric group
Lecture Notes in Computer Science
2010-05-26Paper
Closed timelike curves make quantum and classical computing equivalent
Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
2010-05-19Paper
Zero-knowledge against quantum attacks
SIAM Journal on Computing
2010-03-17Paper
Mixing doubly stochastic quantum channels with the completely depolarizing channel
 
2009-06-23Paper
Distinguishing quantum operations having few Kraus operators
 
2009-02-12Paper
Towards a general theory of quantum games
 
2009-01-05Paper
Notes on super-operator norms induced by Schatten norms
 
2008-09-03Paper
STACS 2005
Lecture Notes in Computer Science
2005-12-02Paper
One-dimensional quantum walks with absorbing boundaries
Journal of Computer and System Sciences
2005-02-23Paper
On the complexity of simulating space-bounded quantum computations
Computational Complexity
2004-12-13Paper
PSPACE has constant-round quantum interactive proof systems
Theoretical Computer Science
2003-05-14Paper
Sharp quantum versus classical query complexity separations
Algorithmica
2003-05-04Paper
Two-way finite automata with quantum and classical states.
Theoretical Computer Science
2003-01-21Paper
Quantum simulations of classical random walks and undirected graph connectivity
Journal of Computer and System Sciences
2001-09-09Paper
Space-bounded quantum complexity
Journal of Computer and System Sciences
2000-11-06Paper
scientific article; zbMATH DE number 1306885 (Why is no real title available?)
 
2000-04-26Paper
scientific article; zbMATH DE number 1335895 (Why is no real title available?)
 
1999-09-13Paper
scientific article; zbMATH DE number 819105 (Why is no real title available?)
 
1996-09-03Paper


Research outcomes over time


This page was built for person: John Watrous