default search action
John Watrous
- > Home > Persons > John Watrous
Publications
- 2023
- [j28]Soumik Ghosh, John Watrous:
Complexity Limitations on One-turn Quantum Refereed Games. Theory Comput. Syst. 67(2): 383-412 (2023) - 2020
- [j24]Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous:
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) - 2018
- [j23]Vincent Russo, John Watrous:
Extended Nonlocal Games from Quantum-Classical Games. Chic. J. Theor. Comput. Sci. 2018 (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, John Watrous:
Quantum Proofs. Found. Trends Theor. Comput. Sci. 11(1-2): 1-215 (2016) - [c25]Anne Broadbent, Zhengfeng Ji, Fang Song, John Watrous:
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) - 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, Thomas Vidick, John Watrous:
Optimal Counterfeiting Attacks and Generalizations for Wiesner's Quantum Money. TQC 2012: 45-64 - 2011
- [j17]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. J. ACM 58(6): 30:1-30:27 (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, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
QIP = PSPACE. Commun. ACM 53(12): 102-109 (2010) - [c22]Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous:
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) - 2009
- [c21]Rahul Jain, John Watrous:
Parallel Approximation of Non-interactive Zero-sum Quantum Games. CCC 2009: 243-253 - [c20]Rahul Jain, Sarvagya Upadhyay, John Watrous:
Two-Message Quantum Interactive Proofs Are in PSPACE. FOCS 2009: 534-543 - [i12]Rahul Jain, Sarvagya Upadhyay, John Watrous:
Two-message quantum interactive proofs are in PSPACE. CoRR abs/0905.1300 (2009) - 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
- [i9]Gus Gutoski, John Watrous:
Toward a general theory of quantum games. CoRR abs/quant-ph/0611234 (2006) - 2005
- [c17]Gus Gutoski, John Watrous:
Quantum Interactive Proofs with Competing Provers. STACS 2005: 605-616 - 2004
- [j7]Eric Bach, Susan N. Coppersmith, Marcel Paz Goldschen, Robert Joynt, John Watrous:
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 - [i7]Gus Gutoski, John Watrous:
Quantum Interactive Proofs with Competing Provers. CoRR abs/cs/0412102 (2004) - 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) - 2001
- [c11]Andris Ambainis, Eric Bach, Ashwin Nayak, Ashvin Vishwanath, John Watrous:
One-dimensional quantum walks. STOC 2001: 37-49 - 2000
- [c9]Richard Cleve, John Watrous:
Fast parallel circuits for the quantum Fourier transform. FOCS 2000: 526-536 - [c7]Alexei Y. Kitaev, John Watrous:
Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. STOC 2000: 608-617 - 1999
- [i2]Andris Ambainis, John Watrous:
Two-way finite automata with quantum and classical states. CoRR cs.CC/9911009 (1999)
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-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint