R
Richard Cleve
Researcher at University of Waterloo
Publications - 110
Citations - 18604
Richard Cleve is an academic researcher from University of Waterloo. The author has contributed to research in topics: Quantum algorithm & Quantum computer. The author has an hindex of 45, co-authored 109 publications receiving 16487 citations. Previous affiliations of Richard Cleve include International Computer Science Institute & Perimeter Institute for Theoretical Physics.
Papers
More filters
Journal ArticleDOI
Elementary gates for quantum computation.
Adriano Barenco,Charles H. Bennett,Richard Cleve,David P. DiVincenzo,Norman Margolus,Peter W. Shor,Tycho Sleator,John A. Smolin,Harald Weinfurter +8 more
TL;DR: U(2) gates are derived, which derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number of unitary operations on arbitrarily many bits.
Journal ArticleDOI
How to share a quantum secret
TL;DR: The concept of quantum secret sharing was investigated in this article, where it was shown that the only constraint on the existence of threshold schemes comes from the quantum ''no-cloning theorem''.
Journal ArticleDOI
Quantum algorithms revisited
TL;DR: In this article, a common pattern underpinning quantum algorithms can be identified when quantum computation is viewed as multiparticle interference, and an explicit algorithm for generating any prescribed interference pattern with an arbitrary precision is provided.
Proceedings ArticleDOI
Exponential algorithmic speedup by a quantum walk
TL;DR: A black box graph traversal problem that can be solved exponentially faster on a quantum computer than on a classical computer is constructed and it is proved that no classical algorithm can solve the problem in subexponential time.
Journal ArticleDOI
Quantum fingerprinting
TL;DR: In this article, the authors show that fingerprints consisting of quantum information can be made exponentially smaller than the original strings without any correlations or entanglement between the parties, and they give a test that distinguishes any two unknown quantum fingerprints with high probability.