D. Puzzuoli and J. Watrous. Ancilla dimension in quantum channel discrimination. Annales Henri Poincaré 18(4): 1153–1184, 2017.

[pdf]

A. Broadbent, Z. Ji, F. Song, J. Watrous. Zero-knowledge proof systems for QMA. Manuscript, 2016.

Also available as arXiv.org e-Print 1604.02804.

[pdf]

T. Vidick and J. Watrous. Quantum proofs. Foundations and Trends in Theoretical Computer Science 11(1&2): 1–215, 2016.

[html]

N. Johnston, R. Mittal, V., Russo, and J. Watrous. Extended nonlocal games and monogamy-of-entanglement games. Proceedings of the Royal Society A 472(2189): 20160003, 2016.

Also available as arXiv.org e-Print 1510.02083.

[pdf]

T. Cooney, C. Hirche, C. Morgan, J. Olson, K. Seshadreesan, J. Watrous, M. Wilde. Operational meaning of quantum measures of recovery. Physical Review A 94(2): 022310, 2016.

Also available as arXiv.org e-Print 1512.05324.

[pdf]

D. Leung and J. Watrous. On the complementary quantum capacity of the depolarizing channel. Manuscript, 2015.

Also available as arXiv.org e-Print 1510.01366.

[pdf]

S. Bandyopadhyay, A. Cosentino, N. Johnston, V. Russo, J. Watrous, and N. Yu. Limitations on separable measurements by convex optimization. IEEE Transactions on Information Theory 61(6): 3593–3604, 2015.

Also available as arXiv.org e-Print 1408.6981.

[pdf]

M. Piani and J. Watrous. Necessary and sufficient quantum information characterization of Einstein-Podolsky-Rosen steering. Physical Review Letters 114(6): 060404, 2015.

Also available as arXiv.org e-Print 1406.0530.

[pdf]

D. Leung, B. Toner, and J. Watrous. Coherent state exchange in multi-prover quantum interactive proof systems. Chicago Journal of Theoretical Computer Science 2013: article 11, 2013.

Also available as arXiv.org e-Print 0804.4118.

[pdf]

J. Watrous. Simpler semidefinite programs for completely bounded norms. Chicago Journal of Theoretical Computer Science 2013: article 8, 2013.

Also available as arXiv.org e-Print 1207.5726.

[pdf]

A. Molina, T. Vidick, and J. Watrous. Optimal counterfeiting attacks and generalizations for Wiesner's quantum money. Proceedings of the 7th Conference on Theory of Quantum Computation, Communication, and Cryptography, volume 7582 of Lecture Notes in Computer Science, pages 45–64, 2013.

Also available as arXiv.org e-Print 1202.4010.

[pdf]

A. Molina and J. Watrous. Hedging bets with correlated quantum strategies. Proceedings of the Royal Society A 468(2145): 2614-2629, 2012.

Also available as arXiv.org e-Print 1104.1140.

[pdf]

T. Ito, H. Kobayashi, and J. Watrous. Quantum interactive proofs with weak error bounds. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, pages 266–275, 2012.

Also available as arXiv.org e-Print 1012.4427.

[pdf]

R. Jain, Z. Ji, S. Upadhyay, and J. Watrous. QIP = PSPACE. Journal of the ACM 58(6): article 30, 2011.

A preliminary version appeared in Proceedings of the 42nd ACM Symposium on Theory of Computing, 2010.

Also available as arXiv.org e-Print 0907.4737.

[pdf]

J. Watrous. An introduction to quantum information and quantum circuits. ACM SIGACT News 42(2): 52–67, 2011.

[pdf]

S. Beigi, P. Shor, and J. Watrous. Quantum interactive proofs with short messages. Theory of Computing 7: 101–117, 2011.

Also available as arXiv.org e-Print 1004.0411.

[pdf]

W. Matthews, M. Piani, and J. Watrous. Entanglement in channel discrimination with restricted measurements. Physical Review A 82(3): 032302, 2010.

Also available as arXiv.org e-Print 1004.0888.

[pdf]

A. Harrow, A. Hassidim, D. Leung, and J. Watrous. Adaptive versus non-adaptive strategies for quantum channel discrimination. Physical Review A 81(3): 032339, 2010.

Also available as arXiv.org e-Print 0909.0256.

[pdf]

R. Jozsa, B. Kraus, A. Miyake, and J. Watrous. Matchgate and space-bounded quantum computations are equivalent. Proceedings of the Royal Society A 446: 809–830, 2010.

Also available as arXiv.org e-Print 0908.1467.

[pdf]

R. Jain, S. Upadhyay, and J. Watrous. Two-message quantum interactive proofs are in PSPACE. Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pages 534–543, 2009.

Also available as arXiv.org e-Print 0905.1300.

[pdf]

J. Watrous. Semidefinite programs for completely bounded norms. Theory of Computing 5: 11, 2009.

Also available as arXiv.org e-Print 0901.4709.

[pdf]

M. Piani and J. Watrous. All entangled states are useful for channel discrimination. Physical Review Letters 102(25): 250501, 2009.

Also available as arXiv.org e-Print 0901.2118.

[pdf]

J. Watrous. Zero-knowledge against quantum attacks. SIAM Journal on Computing 39(1): 25–58, 2009.

A preliminary version appeared in Proceedings of the 38th ACM Symposium on Theory of Computing, pages 296–305, 2006.

[pdf]

S. Aaronson and J. Watrous. Closed timelike curves make quantum and classical computing equivalent. Proceedings of the Royal Society A 465(2102): 631–647, 2009.

Also available as arXiv.org e-Print 0808.2669.

[pdf]

R. Jain and J. Watrous. Parallel approximation of non-interactive zero-sum quantum games. Proceedings of the 24th Annual IEEE Conference on Computational Complexity, pages 243–253, 2009.

Also available as arXiv.org e-Print 0808.2775.

[pdf]

J. Watrous. Mixing doubly stochastic quantum channels with the completely depolarizing channel. Quantum Information and Computation 9(5&6): 406–413, 2009.

Also available as arXiv.org e-Print 0807.2668.

[pdf]

J. Watrous. Quantum computational complexity. Encyclopedia of Complexity and System Science, Springer, 2009.

Also available as arXiv.org e-Print 0804.3401.

[pdf]

J. Watrous. Distinguishing quantum operations having few Kraus operators. Quantum Information and Computation 8(9): 819–833, 2008.

Also available as arXiv.org e-Print 0710.0902.

[pdf]

G. Gutoski and J. Watrous. Toward a general theory of quantum games. Proceedings of the 39th ACM Symposium on Theory of Computing, pages 565–574, 2007.

[pdf]

J. Watrous. Bipartite subspaces having no bases distinguishable by local operations and classical communication. Physical Review Letters 95(8): 080505, 2005.

[pdf]

B. Rosgen and J. Watrous. On the hardness of distinguishing mixed-state quantum computations. Proceedings of the 20th Annual IEEE Conference on Computational Complexity, pages 344–354, 2005.

[pdf]

C. Marriott and J. Watrous. Quantum Arthur-Merlin games. Computational Complexity, 14(2): 122–152, 2005.

A preliminary version appeared in Proceedings of the 19th Annual IEEE Conference on Computational Complexity, pages 275–285, 2004.

[pdf]

G. Gutoski and J. Watrous. Quantum interactive proofs with competing provers. Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science, volume 3404 of Lecture Notes in Computer Science, pages 605–616, Springer-Verlag, 2005.

[pdf]

J. Watrous. Notes on super-operator norms induced by Schatten norms. Quantum Information and Computation, 5(1): 58–68, 2005.

[pdf]

E. Bach, S. Coppersmith, M. Goldschen, R. Joynt, and J. Watrous. One-dimensional quantum walks with absorbing boundaries. Journal of Computer and System Sciences 69(4): 562–592, 2004.

[pdf]

J. Watrous. Many copies may be required for entanglement distillation. Physical Review Letters, 93(1): 010502, 2004.

[pdf]

R. Cleve, P. Hoyer, B. Toner, and J. Watrous. Consequences and limits of nonlocal strategies. Proceedings of the 19th Annual IEEE Conference on Computational Complexity, pages 236–249, 2004.

[pdf]

J. Watrous. On the complexity of simulating space-bounded quantum computations. Computational Complexity, 12: 48–84, 2003.

A preliminary version appeared with the title "Quantum and classical space-bounded processes with algebraic transition amplitudes" in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 341–351, 1999.

[pdf]

H. Gerhardt and J. Watrous. Continuous-time quantum walks on the symmetric group. Proceedings of the 7th International Workshop on Randomization and Approximation Techniques in Computer Science, 2003.

[pdf]

J. Watrous. PSPACE has constant-round quantum interactive proof systems. Theoretical Computer Science, 292(3): 575–588, 2003.

A preliminary version appeared in Proceedings of the 40th Annual IEEE Symposium on Foundations of Computer Science, pages 112–119, 1999.

[pdf]

J. Watrous. Limits on the power of quantum statistical zero-knowledge. Manuscript, 2003.

A preliminary version appeared in Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science, pages 459–468, 2002.

[pdf]

J. de Beaudrap, R. Cleve, and J. Watrous. Sharp quantum vs. classical query complexity separations. Algorithmica, 34(4): 449–461, 2002.

[pdf]

A. Ambainis and J. Watrous. Two-way finite automata with quantum and classical states. Theoretical Computer Science, 287(1): 299–311, 2002.

[pdf]

H. Buhrman, R. Cleve, J. Watrous, and R. de Wolf. Quantum fingerprinting. Physical Review Letters, 87(16): 167902, 2001.

[pdf]

J. Watrous. Quantum algorithms for solvable groups. Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 60–67, 2001.

[pdf]

A. Ambainis, E. Bach, A. Nayak, A. Vishwanath, and J. Watrous. One-dimensional quantum walks. Proceedings of the 33rd ACM Symposium on Theory of Computing, pages 37–49, 2001.

[pdf]

J. Watrous. Quantum simulations of classical random walks and undirected graph connectivity. Journal of Computer and System Sciences, 62(2): 376–391, 2001.

A preliminary version appeared in Proceedings of the 14th Annual IEEE Conference on Computational Complexity, pages 180–187, 1999.

[pdf]

J. Watrous. Succinct quantum proofs for properties of finite groups. Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 537–546, 2000.

[pdf]

R. Cleve and J. Watrous. Fast parallel circuits for the quantum Fourier transform. Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pages 526–536, 2000.

[pdf]

A. Kitaev and J. Watrous. Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. Proceedings of the 32nd ACM Symposium on Theory of Computing, pages 608–617, 2000.

[pdf]

J. Watrous. Space-bounded quantum complexity. Journal of Computer and System Sciences, 59(2): 281–326, 1999.

A preliminary version appeared with the title "Relationships between quantum and classical space-bounded complexity classe" in Proceedings of the 13th Annual IEEE Conference on Computational Complexity, pages 210–227, 1998.

[pdf]

A. Kondacs and J. Watrous. On the power of quantum finite state automata. Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science, pages 66–75, 1997.

[pdf]

J. Watrous. On one-dimensional quantum cellular automata. Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science, pages 528–537, 1995.

[pdf]

J. Watrous. A polynomial-time algorithm for the Artin-Whaples approximation theorem. Number Theory: Fourth Conference of the Canadian Number Theory Association (1995), 397–407.