default search action
Richard Cleve
Person information
- affiliation: University of Waterloo, Institute for Quantum Computing, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j21]Richard Cleve, Benoit Collins
, Li Liu, Vern I. Paulsen
Constant gap between conventional strategies and those based on C*-dynamics for self-embezzlement. Quantum 6: 755 (2022)
2010 – 2019
- 2017
- [c26]Richard Cleve, Chunhao Wang:
Efficient Quantum Algorithms for Simulating Lindblad Evolution. ICALP 2017: 17:1-17:14 - 2016
- [j20]Richard Cleve, Debbie W. Leung, Li Liu, Chunhao Wang:
Near-linear constructions of exact unitary 2-designs. Quantum Inf. Comput. 16(9&10): 721-756 (2016) - 2014
- [j19]Dominic W. Berry, Richard Cleve, Sevag Gharibian:
Gate-efficient discrete simulations of continuous-time quantum query algorithms. Quantum Inf. Comput. 14(1-2): 1-30 (2014) - [c25]Richard Cleve, Rajat Mittal:
Characterization of Binary Constraint System Games. ICALP (1) 2014: 320-331 - [c24]Dominic W. Berry
Exponential improvement in precision for simulating sparse Hamiltonians. STOC 2014: 283-292 - [c23]Harry Buhrman, Richard Cleve, Michal Koucký
Computing with a full memory: catalytic space. STOC 2014: 857-866 - [i5]Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman:
Computing with a full memory: Catalytic space. Electron. Colloquium Comput. Complex. TR14 (2014) - 2013
- [j18]Richard Cleve, Wim van Dam, Michael Nielsen
Quantum entanglement and the communication complexity of the inner product function. Theor. Comput. Sci. 486: 11-19 (2013) - 2012
- [c22]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani
Reconstructing Strings from Substrings with Quantum Queries. SWAT 2012: 388-397 - [i4]Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita:
Reconstructing Strings from Substrings with Quantum Queries. CoRR abs/1204.4691 (2012)
2000 – 2009
- 2009
- [j17]Richard Cleve, Dmitry Gavinsky, Rahul Jain:
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. Quantum Inf. Comput. 9(7&8): 648-656 (2009) - [j16]Andrew M. Childs
Discrete-Query Quantum Algorithm for NAND Trees. Theory Comput. 5(1): 119-123 (2009) - [c21]Richard Cleve, Daniel Gottesman
Efficient discrete-time simulations of continuous-time quantum query algorithms. STOC 2009: 409-416 - 2008
- [j15]Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay:
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. Comput. Complex. 17(2): 282-299 (2008) - [c20]Richard Cleve, Dmitry Gavinsky, David L. Yonge-Mallo:
Quantum Algorithms for Evaluating Min-MaxTrees. TQC 2008: 11-15 - 2007
- [c19]Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay:
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. CCC 2007: 109-114 - 2006
- [j14]Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita:
Quantum lower bounds for the Goldreich-Levin problem. Inf. Process. Lett. 97(5): 208-211 (2006) - [c18]Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger:
New Limits on Fault-Tolerant Quantum Computation. FOCS 2006: 411-419 - 2005
- [j13]Rolf T. Horn, A. J. Scott, Jonathan Walgate, Richard Cleve, A. I. Lvovsky, Barry C. Sanders:
Classical and quantum fingerprinting with shared randomness and one-sided error. Quantum Inf. Comput. 5(3): 258-271 (2005) - 2004
- [j12]Richard Cleve:
The query complexity of order-finding. Inf. Comput. 192(2): 162-171 (2004) - [c17]Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous:
Consequences and Limits of Nonlocal Strategies. CCC 2004: 236-249 - 2003
- [c16]Andrew M. Childs
Exponential algorithmic speedup by a quantum walk. STOC 2003: 59-68 - 2002
- [j11]J. Niel de Beaudrap, Richard Cleve, John Watrous:
Sharp Quantum versus Classical Query Complexity Separations. Algorithmica 34(4): 449-461 (2002) - [j10]Richard Cleve:
Editorial. Quantum Inf. Comput. 2(7): 517 (2002) - [c15]Mark Adcock, Richard Cleve:
A Quantum Goldreich-Levin Theorem with Cryptographic Applications. STACS 2002: 323-334 - 2001
- [j9]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum lower bounds by polynomials. J. ACM 48(4): 778-797 (2001) - 2000
- [j8]Harry Buhrman, Richard Cleve, Wim van Dam:
Quantum Entanglement and Communication Complexity. SIAM J. Comput. 30(6): 1829-1841 (2000) - [c14]Richard Cleve:
The Query Complexity of Order-Finding. CCC 2000: 54- - [c13]Richard Cleve, John Watrous:
Fast parallel circuits for the quantum Fourier transform. FOCS 2000: 526-536
1990 – 1999
- 1999
- [c12]Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka:
Bounds for Small-Error and Zero-Error Quantum Algorithms. FOCS 1999: 358-368 - [i3]Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka:
Bounds for Small-Error and Zero-Error Quantum Algorithms. CoRR cs.CC/9904019 (1999) - 1998
- [j7]Richard Cleve, Artur Ekert, Leah Henderson, Chiara Macchiavello, Michele Mosca:
On quantum algorithms. Complex. 4(1): 33-42 (1998) - [j6]Nader H. Bshouty, Richard Cleve:
Interpolating Arithmetic Read-Once Formulas in Parallel. SIAM J. Comput. 27(2): 401-413 (1998) - [c11]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum Lower Bounds by Polynomials. FOCS 1998: 352-361 - [c10]Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp:
Quantum Entanglement and the Communication Complexity of the Inner Product Function. QCQC 1998: 61-74 - [c9]Harry Buhrman, Richard Cleve, Avi Wigderson:
Quantum vs. Classical Communication and Computation. STOC 1998: 63-68 - [i2]Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf:
Quantum Lower Bounds by Polynomials. CoRR quant-ph/9802049 (1998) - 1996
- [j5]Nader H. Bshouty, Richard Cleve, Ricard Gavaldà
Oracles and Queries That Are Sufficient for Exact Learning. J. Comput. Syst. Sci. 52(3): 421-433 (1996) - 1995
- [j4]Nader H. Bshouty, Richard Cleve, Wayne Eberly:
Size-Depth Tradeoffs for Algebraic Formulas. SIAM J. Comput. 24(4): 682-705 (1995) - [i1]Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon:
Oracles and Queries That Are Sufficient for Exact Learning. Electron. Colloquium Comput. Complex. TR95 (1995) - 1994
- [c8]Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon:
Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). COLT 1994: 130-139 - 1993
- [j3]Fan R. K. Chung, Richard Cleve, Paul Dagum:
A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t). J. Comb. Theory B 57(1): 150-155 (1993) - 1992
- [j2]Michael Ben-Or
Computing Algebraic Formulas Using a Constant Number of Registers. SIAM J. Comput. 21(1): 54-58 (1992) - [c7]Nader H. Bshouty, Richard Cleve:
On the Exact Learning of Formulas in Parallel (Extended Abstract). FOCS 1992: 513-522 - 1991
- [j1]Richard Cleve:
Towards Optimal Simulations of Formulas by Bounded-Width Programs. Comput. Complex. 1: 91-105 (1991) - [c6]Nader H. Bshouty, Richard Cleve, Wayne Eberly:
Size-Depth Tradeoffs for Algebraic Formulae. FOCS 1991: 334-341 - 1990
- [c5]Richard Cleve:
Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. CRYPTO 1990: 530-544 - [c4]Richard Cleve:
Towards Optimal Simulations of Formulas by Bounded-Width Programs. STOC 1990: 271-277
1980 – 1989
- 1989
- [b1]Richard Cleve:
Methodologies for designing block ciphers and cryptographic protocols. University of Toronto, Canada, 1989 - [c3]Richard Cleve:
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications. CRYPTO 1989: 573-588 - 1988
- [c2]Michael Ben-Or
Computing Algebraic Formulas Using a Constant Number of Registers. STOC 1988: 254-257 - 1986
- [c1]Richard Cleve:
Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract). STOC 1986: 364-369
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-10-07 21:20 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: