Fetching the paper…
Reading the bibliography…
We show how to efficiently simulate continuous-time quantum query algorithms that run in time T in a manner that preserves the query complexity (within a polylogarithmic factor) while also incurring a small overhead cost in the total number of gates between queries.
J. Huyghebaert and H. De Raedt, Product formula methods for time-dependent Schrodinger problems
1990
Earlier work this paper cites.
E. Farhi and S. Gutmann, Analog analogue of a digital quantum computation
1998
Earlier work this paper cites.
L. Grover and T. Rudolph, Creating superpositions that correspond to efficiently integrable probability distributions
2002
Earlier work this paper cites.
A. Ambainis, A. M. Childs, B. W. Reichardt, R. Špalek, and S. Zhang, Any AND-OR formula of size N N can be evaluated in time N 1 / 2 + o ( 1 ) N^{1/2+o(1)} on a quantum computer
2007
Earlier work this paper cites.
D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, Efficient quantum algorithms for simulating sparse Hamiltonians
2007
Cited alongside, same era.
E. Farhi, J. Goldstone, and S. Gutmann, A quantum algorithm for the Hamiltonian NAND tree
2008
Cited alongside, same era.
R. Cleve, D. Gottesman, M. Mosca, R. Somma, and D. Yonge-Mallo, Efficient discrete-time simulations of continuous-time quantum query algorithms
2009
Cited alongside, same era.
A. M. Childs, R. Cleve, S. P. Jordan, and D. Yeung, Discrete-query quantum algorithm for NAND trees
2009
Cited alongside, same era.
N. Wiebe, D. W. Berry, P. Høyer, and B. C. Sanders, Higher order decompositions of ordered operator exponentials
2010
Later among the works it cites.
2011
Later among the works it cites.
A. Papageorgiou and C. Zhang, On the efficiency of quantum algorithms for Hamiltonian simulation
2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…