no code implementations • 18 Feb 1998 • Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
We examine the number T of queries that a quantum network requires to compute several Boolean functions on {0, 1}^N in the black-box model.
Quantum Physics Computational Complexity
no code implementations • 6 Jul 2000 • Lieven M. K. Vandersypen, Matthias Steffen, Gregory Breyta, Costantino S. Yannoni, Richard Cleve, Isaac L. Chuang
We report the realization of a nuclear magnetic resonance (NMR) quantum computer which combines the quantum Fourier transform (QFT) with exponentiated permutations, demonstrating a quantum algorithm for order-finding.
Quantum Physics
no code implementations • 15 Dec 2014 • Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, Rolando D. Somma
We describe a simple, efficient method for simulating Hamiltonian dynamics on a quantum computer by approximating the truncated Taylor series of the evolution operator.
Quantum Physics
1 code implementation • 19 Jan 2015 • Richard Cleve, Debbie Leung, Li Liu, Chunhao Wang
A unitary 2-design can be viewed as a quantum analogue of a 2-universal hash function: it is indistinguishable from a truly random unitary by any procedure that queries it twice.
Quantum Physics
no code implementations • 30 Dec 2016 • Richard Cleve, Chunhao Wang
We consider the natural generalization of the Schr\"{o}dinger equation to Markovian open system dynamics: the so-called the Lindblad equation.
Quantum Physics
