Richard Cleve

According to our database1, Richard Cleve authored at least 40 papers between 1986 and 2017.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Efficient Quantum Algorithms for Simulating Lindblad Evolution.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Near-linear constructions of exact unitary 2-designs.
Quantum Information & Computation, 2016

2014
Gate-efficient discrete simulations of continuous-time quantum query algorithms.
Quantum Information & Computation, 2014

Computing with a full memory: Catalytic space.
Electronic Colloquium on Computational Complexity (ECCC), 2014

Exponential improvement in precision for simulating sparse Hamiltonians.
Proceedings of the Symposium on Theory of Computing, 2014

Characterization of Binary Constraint System Games.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013
Quantum entanglement and the communication complexity of the inner product function.
Theor. Comput. Sci., 2013

2012
Reconstructing Strings from Substrings with Quantum Queries.
Proceedings of the Algorithm Theory - SWAT 2012, 2012

2009
Discrete-Query Quantum Algorithm for NAND Trees.
Theory of Computing, 2009

Entanglement-resistant two-prover interactive proof systems and non-adaptive pir's.
Quantum Information & Computation, 2009

Efficient discrete-time simulations of continuous-time quantum query algorithms.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008
Perfect Parallel Repetition Theorem for Quantum Xor Proof Systems.
Computational Complexity, 2008

Quantum Algorithms for Evaluating Min-MaxTrees.
Proceedings of the Theory of Quantum Computation, 2008

2006
Quantum lower bounds for the Goldreich-Levin problem.
Inf. Process. Lett., 2006

New Limits on Fault-Tolerant Quantum Computation.
Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2006), 2006

2005
Classical and quantum fingerprinting with shared randomness and one-sided error.
Quantum Information & Computation, 2005

2004
The query complexity of order-finding.
Inf. Comput., 2004

Consequences and Limits of Nonlocal Strategies.
Proceedings of the 19th Annual IEEE Conference on Computational Complexity (CCC 2004), 2004

2003
Exponential algorithmic speedup by a quantum walk.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

2002
Editorial.
Quantum Information & Computation, 2002

Sharp Quantum versus Classical Query Complexity Separations.
Algorithmica, 2002

A Quantum Goldreich-Levin Theorem with Cryptographic Applications.
Proceedings of the STACS 2002, 19th Annual Symposium on Theoretical Aspects of Computer Science, Antibes, 2002

2001
Quantum lower bounds by polynomials.
J. ACM, 2001

2000
Quantum Entanglement and Communication Complexity.
SIAM J. Comput., 2000

Fast parallel circuits for the quantum Fourier transform.
Proceedings of the 41st Annual Symposium on Foundations of Computer Science, 2000

1999
Bounds for Small-Error and Zero-Error Quantum Algorithms.
Proceedings of the 40th Annual Symposium on Foundations of Computer Science, 1999

1998
Interpolating Arithmetic Read-Once Formulas in Parallel.
SIAM J. Comput., 1998

On quantum algorithms.
Complexity, 1998

Quantum vs. Classical Communication and Computation.
Proceedings of the Thirtieth Annual ACM Symposium on the Theory of Computing, 1998

1996
Oracles and Queries That Are Sufficient for Exact Learning.
J. Comput. Syst. Sci., 1996

1995
Size-Depth Tradeoffs for Algebraic Formulas.
SIAM J. Comput., 1995

1994
Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract).
Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, 1994

1993
A Note on Constructive Lower Bounds for the Ramsey Numbers R(3, t).
J. Comb. Theory, Ser. B, 1993

1992
Computing Algebraic Formulas Using a Constant Number of Registers.
SIAM J. Comput., 1992

On the Exact Learning of Formulas in Parallel (Extended Abstract)
Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, 1992

1991
Towards Optimal Simulations of Formulas by Bounded-Width Programs.
Computational Complexity, 1991

Size-Depth Tradeoffs for Algebraic Formulae
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

1990
Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S.
Proceedings of the Advances in Cryptology, 1990

1989
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications.
Proceedings of the Advances in Cryptology, 1989

1986
Limits on the Security of Coin Flips when Half the Processors Are Faulty (Extended Abstract)
Proceedings of the 18th Annual ACM Symposium on Theory of Computing, 1986


  Loading...