default search action
John Watrous
Person information
- affiliation: University of Waterloo, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j28]Soumik Ghosh, John Watrous:
Complexity Limitations on One-turn Quantum Refereed Games. Theory Comput. Syst. 67(2): 383-412 (2023) - 2022
- [j27]John Bostanci, John Watrous
:
Quantum game theory and the complexity of approximating quantum Nash equilibria. Quantum 6: 882 (2022) - 2021
- [j26]Bryan Coutts, Mark Girard
Certifying optimality for convex quantum channel optimization problems. Quantum 5: 448 (2021) - [i20]John Bostanci, John Watrous:
Quantum game theory and the complexity of approximating quantum Nash equilibria. CoRR abs/2102.00512 (2021) - 2020
- [j25]Colin Do-Yan Lee, John Watrous:
Detecting mixed-unitary quantum channels is NP-hard. Quantum 4: 253 (2020) - [j24]Anne Broadbent, Zhengfeng Ji, Fang Song
Zero-Knowledge Proof Systems for QMA. SIAM J. Comput. 49(2): 245-283 (2020) - [i19]Soumik Ghosh, John Watrous:
Complexity limitations on one-turn quantum refereed games. CoRR abs/2002.01509 (2020)
2010 – 2019
- 2019
- [i18]Colin Do-Yan Lee, John Watrous:
Detecting mixed-unitary quantum channels is NP-hard. CoRR abs/1902.03164 (2019) - 2018
- [j23]Vincent Russo, John Watrous:
Extended Nonlocal Games from Quantum-Classical Games. Chic. J. Theor. Comput. Sci. 2018 (2018) - [i17]Sanketh Menda, John Watrous:
Oracle Separations for Quantum Statistical Zero-Knowledge. CoRR abs/1801.08967 (2018) - [i16]Abel Molina, John Watrous:
Revisiting the simulation of quantum Turing machines by quantum circuits. CoRR abs/1808.01701 (2018) - 2016
- [j22]Thomas Vidick
Quantum Proofs. Found. Trends Theor. Comput. Sci. 11(1-2): 1-215 (2016) - [c25]Anne Broadbent, Zhengfeng Ji
Zero-Knowledge Proof Systems for QMA. FOCS 2016: 31-40 - [i15]Anne Broadbent, Zheng-Feng Ji, Fang Song, John Watrous:
Zero-knowledge proof systems for QMA. CoRR abs/1604.02804 (2016) - 2015
- [j21]Somshubhro Bandyopadhyay, Alessandro Cosentino, Nathaniel Johnston, Vincent Russo, John Watrous, Nengkun Yu
Limitations on Separable Measurements by Convex Optimization. IEEE Trans. Inf. Theory 61(6): 3593-3604 (2015) - 2013
- [j20]Debbie W. Leung, Benjamin Toner, John Watrous:
Coherent state exchange in multi-prover quantum interactive proof systems. Chic. J. Theor. Comput. Sci. 2013 (2013) - [j19]John Watrous:
Simpler semidefinite programs for completely bounded norms. Chic. J. Theor. Comput. Sci. 2013 (2013) - 2012
- [j18]Kousha Etessami, Dieter van Melkebeek, Seth Pettie, John Watrous, Salil P. Vadhan:
Special Section on the Forty-Third Annual ACM Symposium on Theory of Computing (STOC 2011). SIAM J. Comput. 41(5): 1233-1234 (2012) - [c24]Tsuyoshi Ito, Hirotada Kobayashi, John Watrous:
Quantum interactive proofs with weak error bounds. ITCS 2012: 266-275 - [c23]Abel Molina
Optimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money. TQC 2012: 45-64 - 2011
- [j17]Rahul Jain
QIP = PSPACE. J. ACM 58(6): 30:1-30:27 (2011) - [j16]John Watrous:
Guest column: an introduction to quantum information and quantum circuits 1. SIGACT News 42(2): 52-67 (2011) - [j15]Salman Beigi, Peter W. Shor, John Watrous:
Quantum Interactive Proofs with Short Messages. Theory Comput. 7(1): 101-117 (2011) - 2010
- [j14]Rahul Jain
QIP = PSPACE. Commun. ACM 53(12): 102-109 (2010) - [c22]Rahul Jain
QIP = PSPACE. STOC 2010: 573-582 - [i14]Salman Beigi, Peter W. Shor, John Watrous:
Quantum interactive proofs with short messages. CoRR abs/1004.0411 (2010) - [i13]Tsuyoshi Ito, Hirotada Kobayashi, John Watrous:
Quantum interactive proofs with weak error bounds. CoRR abs/1012.4427 (2010)
2000 – 2009
- 2009
- [j13]John Watrous:
Mixing doubly stochastic quantum channels with the completely depolarizing channel. Quantum Inf. Comput. 9(5&6): 406-413 (2009) - [j12]John Watrous:
Zero-Knowledge against Quantum Attacks. SIAM J. Comput. 39(1): 25-58 (2009) - [j11]John Watrous:
Semidefinite Programs for Completely Bounded Norms. Theory Comput. 5(1): 217-238 (2009) - [c21]Rahul Jain
Parallel Approximation of Non-interactive Zero-sum Quantum Games. CCC 2009: 243-253 - [c20]Rahul Jain
Two-Message Quantum Interactive Proofs Are in PSPACE. FOCS 2009: 534-543 - [r1]John Watrous:
Quantum Computational Complexity. Encyclopedia of Complexity and Systems Science 2009: 7174-7201 - [i12]Rahul Jain, Sarvagya Upadhyay, John Watrous:
Two-message quantum interactive proofs are in PSPACE. CoRR abs/0905.1300 (2009) - 2008
- [j10]John Watrous:
Distinguishing quantum operations having few Kraus operators. Quantum Inf. Comput. 8(8): 819-833 (2008) - [i11]Scott Aaronson, John Watrous:
Closed Timelike Curves Make Quantum and Classical Computing Equivalent. CoRR abs/0808.2669 (2008) - [i10]Scott Aaronson, John Watrous:
Closed Timelike Curves Make Quantum and Classical Computing Equivalent. Electron. Colloquium Comput. Complex. TR08 (2008) - 2007
- [c19]Gus Gutoski, John Watrous:
Toward a general theory of quantum games. STOC 2007: 565-574 - 2006
- [c18]John Watrous:
Zero-knowledge against quantum attacks. STOC 2006: 296-305 - [i9]Gus Gutoski, John Watrous:
Toward a general theory of quantum games. CoRR abs/quant-ph/0611234 (2006) - 2005
- [j9]Chris Marriott, John Watrous:
Quantum Arthur-Merlin games. Comput. Complex. 14(2): 122-152 (2005) - [j8]John Watrous:
Notes on super-operator norms induced by schatten norms. Quantum Inf. Comput. 5(1): 58-68 (2005) - [c17]Gus Gutoski, John Watrous:
Quantum Interactive Proofs with Competing Provers. STACS 2005: 605-616 - [i8]Chris Marriott, John Watrous:
Quantum Arthur-Merlin Games. CoRR abs/cs/0506068 (2005) - 2004
- [j7]Eric Bach, Susan N. Coppersmith
One-dimensional quantum walks with absorbing boundaries. J. Comput. Syst. Sci. 69(4): 562-592 (2004) - [c16]Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous:
Consequences and Limits of Nonlocal Strategies. CCC 2004: 236-249 - [c15]Chris Marriott, John Watrous:
Quantum Arthur-Merlin Games. CCC 2004: 275-285 - [i7]Gus Gutoski, John Watrous:
Quantum Interactive Proofs with Competing Provers. CoRR abs/cs/0412102 (2004) - [i6]Bill Rosgen, John Watrous:
On the hardness of distinguishing mixed-state quantum computations. CoRR cs.CC/0407056 (2004) - 2003
- [j6]John Watrous:
On the complexity of simulating space-bounded quantum computations. Comput. Complex. 12(1-2): 48-84 (2003) - [j5]John Watrous:
PSPACE has constant-round quantum interactive proof systems. Theor. Comput. Sci. 292(3): 575-588 (2003) - [c14]Heath Gerhardt, John Watrous:
Continuous-Time Quantum Walks on the Symmetric Group. RANDOM-APPROX 2003: 290-301 - 2002
- [j4]J. Niel de Beaudrap, Richard Cleve, John Watrous:
Sharp Quantum versus Classical Query Complexity Separations. Algorithmica 34(4): 449-461 (2002) - [j3]Andris Ambainis, John Watrous:
Two-way finite automata with quantum and classical state. Theor. Comput. Sci. 287(1): 299-311 (2002) - [c13]John Watrous:
Arthur and Merlin in a Quantum World. CCC 2002: 161 - [c12]John Watrous:
imits on the Power of Quantum Statistical Zero-Knowledge. FOCS 2002: 459- - 2001
- [j2]John Watrous:
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. J. Comput. Syst. Sci. 62(2): 376-391 (2001) - [c11]Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous:
One-dimensional quantum walks. STOC 2001: 37-49 - [c10]John Watrous:
Quantum algorithms for solvable groups. STOC 2001: 60-67 - 2000
- [c9]Richard Cleve, John Watrous:
Fast parallel circuits for the quantum Fourier transform. FOCS 2000: 526-536 - [c8]John Watrous:
Succinct quantum proofs for properties of finite groups. FOCS 2000: 537-546 - [c7]Alexei Y. Kitaev, John Watrous:
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. STOC 2000: 608-617 - [i5]John Watrous:
Succinct quantum proofs for properties of finite groups. CoRR cs.CC/0009002 (2000)
1990 – 1999
- 1999
- [j1]John Watrous:
Space-Bounded Quantum Complexity. J. Comput. Syst. Sci. 59(2): 281-326 (1999) - [c6]John Watrous:
Quantum Simulations of Classical Random Walks and Undirected Graph Connectivity. CCC 1999: 180-187 - [c5]John Watrous:
PSPACE Has Constant-Round Quantum Interactive Proof Systems. FOCS 1999: 112-119 - [c4]John Watrous:
On Quantum and Classical Space-bounded Processes with Algebraic Transition Amplitudes. FOCS 1999: 341-351 - [i4]John Watrous:
PSPACE has 2-round quantum interactive proof systems. CoRR cs.CC/9901015 (1999) - [i3]John Watrous:
On quantum and classical space-bounded processes with algebraic transition amplitudes. CoRR cs.CC/9911008 (1999) - [i2]Andris Ambainis, John Watrous:
Two-way finite automata with quantum and classical states. CoRR cs.CC/9911009 (1999) - 1998
- [c3]John Watrous:
Relationships Between Quantum and Classical Space-Bounded Complexity Classes. CCC 1998: 210-227 - [i1]John Watrous:
Quantum simulations of classical random walks and undirected graph connectivity. CoRR cs.CC/9812012 (1998) - 1997
- [c2]Attila Kondacs, John Watrous:
On the Power of Quantum Finite State Automata. FOCS 1997: 66-75 - 1995
- [c1]John Watrous:
On One-Dimensional Quantum Cellular Automata. FOCS 1995: 528-537
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: