Fetching the paper…
Reading the bibliography…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation.
M. Abramowitz, I. A. Stegun, et al. , “Handbook of mathematical functions,” Applied mathematics series 55
1966
Earlier work this paper cites.
J. McClellan, T. Parks, and L. Rabiner, “A computer program for designing optimum FIR linear phase digital filters,” IEEE Trans. Audio Electroacoust. 21
1973
Earlier work this paper cites.
M. J. D. Powell, Approximation theory and methods (Cambridge University Press, 1981)
1981
Earlier work this paper cites.
R. P. Feynman, “Simulating physics with computers,” International Journal of Theoretical Physics 21
1982
Earlier work this paper cites.
G. J. Sussman and J. Wisdom, “Numerical evidence that the motion of pluto is chaotic,” Science 241
1988
Earlier work this paper cites.
S. Lloyd, “Universal quantum simulators,” Science 273
1996
Earlier work this paper cites.
R. M. Corless, G. H. Gonnet, D. E. G. Hare, D. J. Jeffrey, and D. E. Knuth, “On the lambert w function,” Advances in Computational Mathematics 5
1996
Earlier work this paper cites.
E. Farhi, J. Goldstone, S. Gutmann, and M. Sipser, “Quantum computation by adiabatic evolution,” arXiv preprint quant-ph/0001106 (2000)
2000
Earlier work this paper cites.
D. Aharonov and A. Ta-Shma, “Adiabatic quantum state generation and statistical zero knowledge,” in Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing , STOC ’03 (ACM, New York, NY, USA, 2003) pp. 20–29
2003
Earlier work this paper cites.
M. Szegedy, “Spectra of quantized walks and a δ ϵ \sqrt{\delta\epsilon} rule,” arXiv preprint quant-ph/0401053 (2004)
2004
Earlier work this paper cites.
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information , 1st ed. (Cambridge University Press, 2004)
2004
Earlier work this paper cites.
A. Mizel, D. A. Lidar, and M. Mitchell, “Simple proof of equivalence between adiabatic quantum computation and the circuit model,” Phys. Rev. Lett. 99
2007
Cited alongside, same era.
D. W. Berry, G. Ahokas, R. Cleve, and B. C. Sanders, “Efficient quantum algorithms for simulating sparse hamiltonians,” Commun. Math. Phys. 270
2007
Cited alongside, same era.
A. M. Childs, “Universal computation by quantum walk,” Phys. Rev. Lett. 102
2009
Cited alongside, same era.
T. Caneva, M. Murphy, T. Calarco, R. Fazio, S. Montangero, V. Giovannetti, and G. E. Santoro, “Optimal control at the quantum speed limit,” Phys. Rev. Lett. 103
2009
Cited alongside, same era.
K. Khodjasteh and L. Viola, “Dynamically error-corrected gates for universal quantum computation,” Phys. Rev. Lett. 102
2009
Cited alongside, same era.
A. M. Childs and N. Wiebe, “Hamiltonian simulation using linear combinations of unitary operations,” Quantum Info. Comput. 12
2012
Later among the works it cites.
D. W. Berry and A. M. Childs, “Black-box hamiltonian simulation and unitary implementation,” Quantum Info. Comput. 12
2012
Later among the works it cites.
A. M. Childs, D. Gosset, and Z. Webb, “Universal computation by multiparticle quantum walk,” Science 339
2013
Later among the works it cites.
L. N. Trefethen, Approximation theory and approximation practice (Siam, Philadelphia, 2013)
2013
Later among the works it cites.
I. M. Georgescu, S. Ashhab, and F. Nori, “Quantum simulation,” Rev. Mod. Phys. 86
2014
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Cleve, D. Gottesman, M. Mosca, R. D. Somma, and D. Yonge-Mallo, “Efficient discrete-time simulations of continuous-time quantum query algorithms,” in Proceedings of the Forty-first Annual ACM Symposium on Theory of Computing , STOC ’09 (ACM, New York, NY, USA, 2009) pp. 409–416
2009
Cited alongside, same era.
R. Pachón and L. N. Trefethen, “Barycentric-remez algorithms for best polynomial approximation in the chebfun system,” BIT Numerical Mathematics 49
2009
Cited alongside, same era.
K. Khodjasteh, D. A. Lidar, and L. Viola, “Arbitrarily accurate dynamical control in open quantum systems,” Phys. Rev. Lett. 104
2010
Cited alongside, same era.
A. M. Childs, “On the relationship between continuous- and discrete-time quantum walk,” Commun. Math. Phys. 294
2010
Cited alongside, same era.
A. Oppenheim and R. Schafer, Discrete-time Signal Processing (3rd Ed.) , Prentice-Hall signal processing series (Prentice Hall, 2010)
2010
Cited alongside, same era.
A. M. Childs and R. Kothari, “Theory of quantum computation, communication, and cryptography,” (Springer Berlin Heidelberg, 2011) pp. 94–103
2011
Cited alongside, same era.
D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, “Simulating hamiltonian dynamics with a truncated taylor series,” Phys. Rev. Lett. 114
Cited in the paper.
D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma, “Exponential improvement in precision for simulating sparse hamiltonians,” in Proceedings of the 46th Annual ACM Symposium on Theory of Computing , STOC ’14 (ACM, New York, NY, USA, 2014) pp. 283–292
2014
Later among the works it cites.
T. J. Yoder, G. H. Low, and I. L. Chuang, “Fixed-point quantum search with an optimal number of queries,” Phys. Rev. Lett. 113
2014
Later among the works it cites.
D. W. Berry, A. M. Childs, and R. Kothari, “Hamiltonian simulation with nearly optimal dependence on all parameters,” in Foundations of Computer Science (FOCS), 2015 IEEE 56th Annual Symposium on (2015) pp. 792–809
2015
Later among the works it cites.
2015
Later among the works it cites.