Richard Cleve - RankMe

54 papers A* 18A 4Journal 27Unranked 4

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Linear gate bounds against natural functions for position-verification. Quantum Vahid R. Asadi, Richard Cleve, Eric Culf, Alex May
2022	J	`jnl`	Constant gap between conventional strategies and those based on C*-dynamics for self-embezzlement. Quantum Richard Cleve, Benoit Collins, Li Liu, Vern I. Paulsen
2017	A*	`conf`	Efficient Quantum Algorithms for Simulating Lindblad Evolution. ICALP Richard Cleve, Chunhao Wang
2016	J	`jnl`	Near-linear constructions of exact unitary 2-designs. Quantum Inf. Comput. Richard Cleve, Debbie W. Leung, Li Liu, Chunhao Wang
2014	—	`conf`	Characterization of Binary Constraint System Games. ICALP (1) Richard Cleve, Rajat Mittal
2014	J	`jnl`	Computing with a full memory: Catalytic space. Electron. Colloquium Comput. Complex. Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman
2014	A*	`conf`	Computing with a full memory: catalytic space. STOC Harry Buhrman, Richard Cleve, Michal Koucký, Bruno Loff, Florian Speelman
2014	A*	`conf`	Exponential improvement in precision for simulating sparse Hamiltonians. STOC Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma
2014	J	`jnl`	Gate-efficient discrete simulations of continuous-time quantum query algorithms. Quantum Inf. Comput. Dominic W. Berry, Richard Cleve, Sevag Gharibian
2013	J	`jnl`	Quantum entanglement and the communication complexity of the inner product function. Theor. Comput. Sci. Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp
2012	J	`jnl`	Reconstructing Strings from Substrings with Quantum Queries CoRR Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
2012	—	`conf`	Reconstructing Strings from Substrings with Quantum Queries. SWAT Richard Cleve, Kazuo Iwama, François Le Gall, Harumichi Nishimura, Seiichiro Tani, Junichi Teruyama, Shigeru Yamashita
2009	J	`jnl`	Discrete-Query Quantum Algorithm for NAND Trees. Theory Comput. Andrew M. Childs, Richard Cleve, Stephen P. Jordan, David L. Yonge-Mallo
2009	A*	`conf`	Efficient discrete-time simulations of continuous-time quantum query algorithms. STOC Richard Cleve, Daniel Gottesman, Michele Mosca, Rolando D. Somma, David L. Yonge-Mallo
2009	J	`jnl`	Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's. Quantum Inf. Comput. Richard Cleve, Dmitry Gavinsky, Rahul Jain
2008	J	`jnl`	Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems. Comput. Complex. Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay
2008	—	`conf`	Quantum Algorithms for Evaluating Min-MaxTrees. TQC Richard Cleve, Dmitry Gavinsky, David L. Yonge-Mallo
2007	A	`conf`	Perfect Parallel Repetition Theorem for Quantum XOR Proof Systems. CCC Richard Cleve, William Slofstra, Falk Unger, Sarvagya Upadhyay
2006	A*	`conf`	New Limits on Fault-Tolerant Quantum Computation. FOCS Harry Buhrman, Richard Cleve, Monique Laurent, Noah Linden, Alexander Schrijver, Falk Unger
2006	J	`jnl`	Quantum lower bounds for the Goldreich-Levin problem. Inf. Process. Lett. Mark Adcock, Richard Cleve, Kazuo Iwama, Raymond H. Putra, Shigeru Yamashita
2005	J	`jnl`	Classical and quantum fingerprinting with shared randomness and one-sided error. Quantum Inf. Comput. Rolf T. Horn, A. J. Scott, Jonathan Walgate, Richard Cleve, A. I. Lvovsky, Barry C. Sanders
2004	A	`conf`	Consequences and Limits of Nonlocal Strategies. CCC Richard Cleve, Peter Høyer, Benjamin Toner, John Watrous
2004	J	`jnl`	The query complexity of order-finding. Inf. Comput. Richard Cleve
2003	A*	`conf`	Exponential algorithmic speedup by a quantum walk. STOC Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman
2002	A	`conf`	A Quantum Goldreich-Levin Theorem with Cryptographic Applications. STACS Mark Adcock, Richard Cleve
2002	J	`jnl`	Editorial. Quantum Inf. Comput. Richard Cleve
2002	J	`jnl`	Sharp Quantum versus Classical Query Complexity Separations. Algorithmica J. Niel de Beaudrap, Richard Cleve, John Watrous
2001	J	`jnl`	Quantum lower bounds by polynomials. J. ACM Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
2000	A*	`conf`	Fast parallel circuits for the quantum Fourier transform. FOCS Richard Cleve, John Watrous
2000	J	`jnl`	Quantum Entanglement and Communication Complexity. SIAM J. Comput. Harry Buhrman, Richard Cleve, Wim van Dam
2000	A	`conf`	The Query Complexity of Order-Finding. CCC Richard Cleve
1999	J	`jnl`	Bounds for Small-Error and Zero-Error Quantum Algorithms CoRR Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka
1999	A*	`conf`	Bounds for Small-Error and Zero-Error Quantum Algorithms. FOCS Harry Buhrman, Richard Cleve, Ronald de Wolf, Christof Zalka
1998	J	`jnl`	Interpolating Arithmetic Read-Once Formulas in Parallel. SIAM J. Comput. Nader H. Bshouty, Richard Cleve
1998	J	`jnl`	On quantum algorithms. Complex. Richard Cleve, Artur Ekert, Leah Henderson, Chiara Macchiavello, Michele Mosca
1998	—	`conf`	Quantum Entanglement and the Communication Complexity of the Inner Product Function. QCQC Richard Cleve, Wim van Dam, Michael Nielsen, Alain Tapp
1998	J	`jnl`	Quantum Lower Bounds by Polynomials CoRR Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
1998	A*	`conf`	Quantum Lower Bounds by Polynomials. FOCS Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
1998	A*	`conf`	Quantum vs. Classical Communication and Computation. STOC Harry Buhrman, Richard Cleve, Avi Wigderson
1996	J	`jnl`	Oracles and Queries That Are Sufficient for Exact Learning. J. Comput. Syst. Sci. Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
1995	J	`jnl`	Oracles and Queries That Are Sufficient for Exact Learning Electron. Colloquium Comput. Complex. Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
1995	J	`jnl`	Size-Depth Tradeoffs for Algebraic Formulas. SIAM J. Comput. Nader H. Bshouty, Richard Cleve, Wayne Eberly
1994	A*	`conf`	Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). COLT Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon
1993	J	`jnl`	A Note on Constructive Lower Bounds for the Ramsey Numbers J. Comb. Theory B Fan R. K. Chung, Richard Cleve, Paul Dagum
1992	J	`jnl`	Computing Algebraic Formulas Using a Constant Number of Registers. SIAM J. Comput. Michael Ben-Or, Richard Cleve
1992	A*	`conf`	On the Exact Learning of Formulas in Parallel (Extended Abstract) FOCS Nader H. Bshouty, Richard Cleve
1991	A*	`conf`	Size-Depth Tradeoffs for Algebraic Formulae FOCS Nader H. Bshouty, Richard Cleve, Wayne Eberly
1991	J	`jnl`	Towards Optimal Simulations of Formulas by Bounded-Width Programs. Comput. Complex. Richard Cleve
1990	A*	`conf`	Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S. CRYPTO Richard Cleve
1990	A*	`conf`	Towards Optimal Simulations of Formulas by Bounded-Width Programs STOC Richard Cleve
1989	A*	`conf`	Controlled Gradual Disclosure Schemes for Random Bits and Their Applications. CRYPTO Richard Cleve
1989	—	`—`	Methodologies for designing block ciphers and cryptographic protocols. Richard Cleve
1988	A*	`conf`	Computing Algebraic Formulas Using a Constant Number of Registers STOC Michael Ben-Or, Richard Cleve
1986	A*	`conf`	Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract) STOC Richard Cleve