Sciweavers

Share
STOC
2009
ACM

Efficient discrete-time simulations of continuous-time quantum query algorithms

10 years 9 hour ago
Efficient discrete-time simulations of continuous-time quantum query algorithms
The continuous-time query model is a variant of the discrete query model in which queries can be interleaved with known operations (called "driving operations") continuously in time. We show that any quantum algorithm in this model whose total query time is T can be simulated by a quantum algorithm in the discrete-time query model that makes O(T log T/ log log T) ~O(T) queries. This is the first such upper bound that is independent of the driving operations (i.e., it holds even if the norm of the driving Hamiltonian is very large). A corollary is that any lower bound of T queries for a problem in the discrete-time query model immediately carries over to a lower bound of (T log log T/ log T) ~(T) in the continuous-time query model. Categories and Subject Descriptors
Richard Cleve, Daniel Gottesman, Michele Mosca, Ro
Added 23 Nov 2009
Updated 23 Nov 2009
Type Conference
Year 2009
Where STOC
Authors Richard Cleve, Daniel Gottesman, Michele Mosca, Rolando D. Somma, David L. Yonge-Mallo
Comments (0)
books