Richard Cleve

Publication Activity (10 Years)

Years Active: 1986-2022
Publications (10 Years): 3

Top Topics

Binary Constraints

Computationally Intensive

Top Venues

Quantum Inf. Comput.

Publications

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 (2022)
Richard Cleve, Chunhao Wang
Efficient Quantum Algorithms for Simulating Lindblad Evolution. ICALP (2017)
Richard Cleve, Debbie W. Leung, Li Liu, Chunhao Wang
Near-linear constructions of exact unitary 2-designs. Quantum Inf. Comput. 16 (9&10) (2016)
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma
Exponential improvement in precision for simulating sparse Hamiltonians. STOC (2014)
Richard Cleve, Rajat Mittal
Characterization of Binary Constraint System Games. ICALP (1) (2014)
Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman
Computing with a full memory: Catalytic space. Electron. Colloquium Comput. Complex. 21 (2014)
Dominic W. Berry, Richard Cleve, Sevag Gharibian
Gate-efficient discrete simulations of continuous-time quantum query algorithms. Quantum Inf. Comput. 14 (1-2) (2014)
Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman
Computing with a full memory: catalytic space. STOC (2014)
Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp
Quantum entanglement and the communication complexity of the inner product function. Theor. Comput. Sci. 486 (2013)
Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
Reconstructing Strings from Substrings with Quantum Queries. SWAT (2012)
Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
Reconstructing Strings from Substrings with Quantum Queries CoRR (2012)
Andrew M. Childs, Richard Cleve, Stephen P. Jordan, David L. Yonge-Mallo
Discrete-Query Quantum Algorithm for NAND Trees. Theory Comput. 5 (1) (2009)
Richard Cleve, Dmitry Gavinsky, Rahul Jain
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. Quantum Inf. Comput. 9 (7&8) (2009)
Richard Cleve, Daniel Gottesman, Michele Mosca, Rolando D. Somma, David L. Yonge-Mallo
Efficient discrete-time simulations of continuous-time quantum query algorithms. STOC (2009)
Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. Comput. Complex. 17 (2) (2008)
Richard Cleve, Dmitry Gavinsky, David L. Yonge-Mallo
Quantum Algorithms for Evaluating Min-MaxTrees. TQC (2008)
Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay
Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. Computational Complexity Conference (2007)
Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita
Quantum lower bounds for the Goldreich-Levin problem. Inf. Process. Lett. 97 (5) (2006)
Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger
New Limits on Fault-Tolerant Quantum Computation. FOCS (2006)
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) (2005)
Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous
Consequences and Limits of Nonlocal Strategies. Computational Complexity Conference (2004)
Richard Cleve
The query complexity of order-finding. Inf. Comput. 192 (2) (2004)
Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman
Exponential algorithmic speedup by a quantum walk. STOC (2003)
Mark Adcock, Richard Cleve
A Quantum Goldreich-Levin Theorem with Cryptographic Applications. STACS (2002)
J. Niel de Beaudrap, Richard Cleve, John Watrous
Sharp Quantum versus Classical Query Complexity Separations. Algorithmica 34 (4) (2002)
Richard Cleve
Editorial. Quantum Inf. Comput. 2 (7) (2002)
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum lower bounds by polynomials. J. ACM 48 (4) (2001)
Richard Cleve, John Watrous
Fast parallel circuits for the quantum Fourier transform. FOCS (2000)
Harry Buhrman, Richard Cleve, Wim van Dam
Quantum Entanglement and Communication Complexity. SIAM J. Comput. 30 (6) (2000)
Richard Cleve
The Query Complexity of Order-Finding. Computational Complexity Conference (2000)
Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka
Bounds for Small-Error and Zero-Error Quantum Algorithms CoRR (1999)
Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka
Bounds for Small-Error and Zero-Error Quantum Algorithms. FOCS (1999)
Richard Cleve, Artur Ekert, Leah Henderson, Chiara Macchiavello, Michele Mosca
On quantum algorithms. Complex. 4 (1) (1998)
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum Lower Bounds by Polynomials. FOCS (1998)
Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp
Quantum Entanglement and the Communication Complexity of the Inner Product Function. QCQC (1998)
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
Quantum Lower Bounds by Polynomials CoRR (1998)
Nader H. Bshouty, Richard Cleve
Interpolating Arithmetic Read-Once Formulas in Parallel. SIAM J. Comput. 27 (2) (1998)
Harry Buhrman, Richard Cleve, Avi Wigderson
Quantum vs. Classical Communication and Computation. STOC (1998)
Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
Oracles and Queries That Are Sufficient for Exact Learning. J. Comput. Syst. Sci. 52 (3) (1996)
Nader H. Bshouty, Richard Cleve, Wayne Eberly
Size-Depth Tradeoffs for Algebraic Formulas. SIAM J. Comput. 24 (4) (1995)
Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
Oracles and Queries That Are Sufficient for Exact Learning Electron. Colloquium Comput. Complex. 2 (15) (1995)
Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon
Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). COLT (1994)
Fan R. K. Chung, Richard Cleve, Paul Dagum
). J. Comb. Theory, Ser. B 57 (1) (1993)
Nader H. Bshouty, Richard Cleve
On the Exact Learning of Formulas in Parallel (Extended Abstract) FOCS (1992)
Michael Ben-Or, Richard Cleve
Computing Algebraic Formulas Using a Constant Number of Registers. SIAM J. Comput. 21 (1) (1992)
Nader H. Bshouty, Richard Cleve, Wayne Eberly
Size-Depth Tradeoffs for Algebraic Formulae FOCS (1991)
Richard Cleve
Towards Optimal Simulations of Formulas by Bounded-Width Programs. Comput. Complex. 1 (1991)
Richard Cleve
Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. CRYPTO (1990)
Richard Cleve
Towards Optimal Simulations of Formulas by Bounded-Width Programs STOC (1990)
Richard Cleve
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications. CRYPTO (1989)
Michael Ben-Or, Richard Cleve
Computing Algebraic Formulas Using a Constant Number of Registers STOC (1988)
Richard Cleve
Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) STOC (1986)