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