2010 - Fellow of the Royal Society of Canada Academy of Science
2008 - CAP-CRM Prize in Theoretical and Mathematical Physics, Canadian Association of Physicists and Centre de Recherches Mathématiques
Richard Cleve mainly focuses on Quantum computer, Discrete mathematics, Quantum information, Quantum algorithm and Qubit. He combines subjects such as Physical system, Operator and Applied mathematics with his study of Quantum computer. The concepts of his Discrete mathematics study are interwoven with issues in Quantum state, Quantum Fourier transform, Controlled NOT gate and Quantum t-design.
His work in Quantum information addresses issues such as Theoretical computer science, which are connected to fields such as Quantum nonlocality. Quantum algorithm connects with themes related to Combinatorics in his study. His Quantum network research focuses on Quantum error correction and how it relates to Quantum gate.
His primary scientific interests are in Discrete mathematics, Quantum algorithm, Quantum computer, Quantum and Quantum information. Richard Cleve interconnects Combinatorics, Qubit, Class, Quantum state and Polynomial in the investigation of issues within Discrete mathematics. The study incorporates disciplines such as Algorithm, Hamiltonian and Quantum network in addition to Quantum algorithm.
His Quantum computer study is concerned with the field of Quantum mechanics as a whole. His studies in Quantum integrate themes in fields like Probabilistic logic and Computation. His Quantum information research incorporates themes from Theoretical computer science and Reduction.
Discrete mathematics, Hilbert space, Quantum algorithm, Hamiltonian and Tensor product are his primary areas of study. He combines subjects such as Quadratic equation and Quantum, Qubit with his study of Discrete mathematics. His research investigates the connection with Quantum and areas like Electronic circuit which intersect with concerns in Logarithm.
His studies deal with areas such as Entropy and Quantum entanglement as well as Hilbert space. His research integrates issues of Pauli exclusion principle and Linear combination in his study of Quantum algorithm. His biological study spans a wide range of topics, including Transformation, Quantum information, Special case, Constant and Quantum state.
This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.
Elementary gates for quantum computation.
Adriano Barenco;Charles H. Bennett;Richard Cleve;David P. DiVincenzo.
Physical Review A (1995)
HOW TO SHARE A QUANTUM SECRET
Richard Cleve;Daniel Gottesman;Hoi-Kwong Lo.
Physical Review Letters (1999)
QUANTUM ALGORITHMS REVISITED
Richard Cleve;Artur Ekert;Chiara Macchiavello;Michele Mosca.
Proceedings of The Royal Society A: Mathematical, Physical and Engineering Sciences (1998)
Harry Buhrman;Richard Cleve;John Watrous;Ronald de Wolf.
Physical Review Letters (2001)
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs;Richard Cleve;Enrico Deotto;Edward Farhi.
symposium on the theory of computing (2003)
Quantum lower bounds by polynomials
Robert Beals;Harry Buhrman;Richard Cleve;Michele Mosca.
Journal of the ACM (2001)
Limits on the security of coin flips when half the processors are faulty
symposium on the theory of computing (1986)
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
Dominic W. Berry;Dominic W. Berry;Graeme Ahokas;Richard Cleve;Richard Cleve;Barry C. Sanders;Barry C. Sanders.
Communications in Mathematical Physics (2007)
SUBSTITUTING QUANTUM ENTANGLEMENT FOR COMMUNICATION
Richard Cleve;Harry Buhrman.
Physical Review A (1997)
Nonlocality and communication complexity
Harry Buhrman;Richard R. Cleve;Serge Massar;Ronald De Wolf.
Reviews of Modern Physics (2010)
Profile was last updated on December 6th, 2021.
Research.com Ranking is based on data retrieved from the Microsoft Academic Graph (MAG).
The ranking h-index is inferred from publications deemed to belong to the considered discipline.
If you think any of the details on this page are incorrect, let us know.
We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below: