Richard Cleve | Academic Influence

Richard Cleve's AcademicInfluence.com Rankings

Richard Cleve

Computer Science

#3616

World Rank

#3798

Historical Rank

Database

#8094

World Rank

#8438

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Richard Cleve's Degrees

PhD Computer Science University of Oxford
Bachelors Mathematics University of British Columbia

Similar Degrees You Can Earn

Why Is Richard Cleve Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Richard Erwin Cleve is a Canadian professor of computer science at the David R. Cheriton School of Computer Science at the University of Waterloo, where he holds the Institute for Quantum Computing Chair in quantum computing, and an associate member of the Perimeter Institute for Theoretical Physics.

(See a Problem?)

Richard Cleve's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

HOW TO SHARE A QUANTUM SECRET (1999) (1184)
Quantum algorithms revisited (1997) (1010)
Quantum fingerprinting. (2001) (839)
Exponential algorithmic speedup by a quantum walk (2002) (793)
Quantum lower bounds by polynomials (1998) (765)
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians (2005) (575)
Limits on the security of coin flips when half the processors are faulty (1986) (461)
Exact and approximate unitary 2-designs and their application to fidelity estimation (2009) (455)
Nonlocality and communication complexity (2009) (446)
Simulating Hamiltonian dynamics with a truncated Taylor series. (2014) (432)
Quantum vs. classical communication and computation (1998) (418)
Consequences and limits of nonlocal strategies (2004) (409)
SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION (1997) (342)
Exponential improvement in precision for simulating sparse Hamiltonians (2013) (267)
Fast parallel circuits for the quantum Fourier transform (2000) (226)
Cost of Exactly Simulating Quantum Entanglement with Classical Communication (1999) (225)
Oracles and queries that are sufficient for exact learning (extended abstract) (1994) (177)
Computing Algebraic Formulas Using a Constant Number of Registers (1992) (163)
Quantum Entanglement and the Communication Complexity of the Inner Product Function (1997) (160)
Bounds for small-error and zero-error quantum algorithms (1999) (157)
Experimental realization of an order-finding algorithm with an NMR quantum computer. (2000) (139)
Quantum Entanglement and Communication Complexity (1997) (123)
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems (2007) (119)
Efficient computations of encodings for quantum error correction (1996) (98)
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications (1989) (93)
An Introduction to Quantum Complexity Theory (1999) (92)
A Quantum Goldreich-Levin Theorem with Cryptographic Applications (2001) (87)
Classical simulation of quantum entanglement without local hidden variables (2000) (68)
Characterization of Binary Constraint System Games (2012) (68)
Near-linear constructions of exact unitary 2-designs (2015) (67)
Exact and Approximate Unitary 2-Designs: Constructions and Applications (2006) (63)
Discrete-Query Quantum Algorithm for NAND Trees (2007) (63)
New Limits on Fault-Tolerant Quantum Computation (2006) (61)
Towards optimal simulations of formulas by bounded-width programs (1990) (47)
Computing with a full memory: catalytic space (2014) (46)
The query complexity of order-finding (1999) (45)
Perfect Commuting-Operator Strategies for Linear System Games (2016) (44)
Efficient discrete-time simulations of continuous-time quantum query algorithms (2008) (41)
Quantum stabilizer codes and classical linear codes (1996) (38)
Size-depth tradeoffs for algebraic formulae (1991) (33)
Sharp Quantum versus Classical Query Complexity Separations (2002) (31)
Information-theoretic interpretation of quantum error-correcting codes (1997) (30)
Strong Parallel Repetition Theorem for Quantum XOR Proof Systems (2006) (29)
Efficient Quantum Algorithms for Simulating Lindblad Evolution (2016) (28)
On quantum algorithms (1998) (28)
Computing algebraic formulas with a constant number of registers (1988) (24)
Gate-efficient discrete simulations of continuous-time quantum query algorithms (2012) (24)
Classical simulation of entanglement swapping with bounded communication. (2012) (23)
Interpolating Arithmetic Read-Once Formulas in Parallel (1998) (20)
A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t) (1993) (18)
Methodologies for designing block ciphers and cryptographic protocols (1989) (18)
Sharp Quantum vs. Classical Query Complexity Separations (2000) (18)
Entanglement-Resistant Two-Prover Interactive Proof Systems and Non-Adaptive Private Information Retrieval Systems (2007) (18)
Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's (2009) (17)
Perfect Embezzlement of Entanglement (2016) (17)
Exponential improvement in precision for Hamiltonian-evolution simulation (2013) (14)
Reconstructing Strings from Substrings with Quantum Queries (2012) (14)
Quantum Algorithms for Evaluating Min-MaxTrees (2007) (12)
Classical and quantum fingerprinting with shared randomness and one-sided error (2005) (8)
ar X iv : 0 90 7 . 35 84 v 1 [ qu an t-ph ] 2 1 Ju l 2 00 9 Non-locality and Communication Complexity (2009) (7)
Elementary gates for quantum computation NOVEMBER 1995 (2011) (7)
Communications in Mathematical Physics Efficient Quantum Algorithms for Simulating Sparse Hamiltonians (2007) (6)
Quantum Fourier transforms for extracting hidden linear structures in finite fields (2000) (5)
Quantum lower bounds for the Goldreich-Levin problem (2006) (5)
Eecient Computations of Encodings for Quantum Error Correction Typeset Using Revt E X (1996) (4)
Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S (1990) (3)
Quantum algorithms for hamiltonian simulation (2007) (3)
05 08 13 9 v 2 8 Fe b 20 06 Efficient quantum algorithms for simulating sparse Hamiltonians (2006) (2)
Constant gap between conventional strategies and those based on C*-dynamics for self-embezzlement (2018) (2)
Tight Quantum Bounds by Polynomials ( Preliminary Version ) (1998) (2)
00 07 01 7 v 2 2 0 D ec 2 00 0 Experimental realization of order-finding with a quantum computer (2022) (1)
Lightweight Deployable Mirrors with Tensegrity Supports (2004) (1)
DS-1-11 Reconstructing Strings from Substrings with Quantum Query (2011) (0)
Bell ’ s Theorem and Communication Complexity (0)
INTERPOLATING ARITHMETIC READ-ONCE FORMULAS (1998) (0)
Discrete simulations of continuous-time query algorithms that are efficient with respect to queries , gates and space ∗ (2011) (0)
01 02 5 v 1 1 2 Ja n 19 99 How to share a quantum secret (2008) (0)
Ju n 19 99 An Introduction to Quantum Complexity Theory (1999) (0)
Discrete-query quantum algorithm for NAND trees. (arXiv:quant-ph/0702160v2 UPDATED) (2019) (0)
/ 06 04 14 1 v 2 20 A pr 2 00 6 New Limits on Fault-Tolerant Quantum Computation (2006) (0)
Sharp Quantum versus Classical Query Complexity Separations 1 (2006) (0)
Size-Depth Tradeo s for Algebraic Formulae (1991) (0)
16 0 v 2 6 S ep 2 01 9 Discrete-query quantum algorithm for NAND trees (2019) (0)
D ec 2 00 1 Sharp quantum vs . classical query complexity separations (2001) (0)
UvA-DARE (Digital Academic Repository) Classical simulation of entanglement swapping with bounded communication Branciard, (2012) (0)
Quantum Stabilizer Codes and Classical Linear Codes Typeset Using Revt E X (1996) (0)
1 8 A ug 1 99 7 Quantum Algorithms Revisited (2008) (0)
QCCM Center for Quantum Algorithms (2008) (0)
Near-linear construction of exact unitary 2-designs ( Extended abstract ) (2014) (0)
Hamiltonian simulation with complexity polylogarithmic in the error (2013) (0)
qu an tph / 9 70 80 16 8 A ug 1 99 7 Quantum Algorithms Revisited (1998) (0)
A pr 2 00 4 Consequences and Limits of Nonlocal Strategies (2004) (0)

This paper list is powered by the following services:

Other Resources About Richard Cleve

en.wikipedia.org

What Schools Are Affiliated With Richard Cleve?

Richard Cleve is affiliated with the following schools: