★grads.net/bibliography

WIKINDX Resources

Report/Documentation:

BibTeX citation key: Cleve2008a

R. Cleve, D. Gottesman, M. Mosca, R. D. Somma, and D. L. Yonge-Mallo, “Efficient discrete-time simulations of continuous-time quantum query algorithms,” arXiv, Nov. 26, 2008.
Added by: D. L. Yonge-Mallo 2009-06-03 15:53:00 Last edited by: D. L. Yonge-Mallo 2009-06-03 16:10:18

Categories: Quantum computing
Keywords: continuous-time, discrete-time, quantum algorithms, query complexity, simulation
Creators: Cleve, Gottesman, Mosca, Somma, Yonge-Mallo
Publisher: arXiv

Number of views: 36
Popularity index: 69.23%

Abstract

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. Interesting algorithms have been discovered in this model, such as an algorithm for evaluating NAND trees more efficiently than any classical algorithm. Subsequent work has shown that there also exists an efficient algorithm for NAND trees in the discrete query model; however, there is no efficient conversion known for continuous-time query algorithms for arbitrary problems.
We show that any quantum algorithm in the continuous-time query model whose total query time is T can be simulated by a quantum algorithm in the discrete query model that makes O[T log(T) / log(log(T))] queries. This is the first 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 \Omega[T log(log(T))/log (T)] in the continuous-time query model.
Added by: D. L. Yonge-Mallo Last edited by: D. L. Yonge-Mallo

Wikindx

Bookmarks

Resources

Metadata

Help

Statistics

WIKINDX Resources