Fetching the paper…
Reading the bibliography…
The exponential speedups promised by Hamiltonian simulation on a quantum computer depends crucially on structure in both the Hamiltonian $\hat{H}$, and the quantum circuit $\hat{U}$ that encodes its description.
Springer, Berlin, 1967
G. Meinardus, Approximation of functions: Theory and numerical methods · 1967
Earlier work this paper cites.
E. Saff and V. Totik, “Polynomial approximation of piecewise analytic functions,” J. Lond. Math. Soc
1989
Earlier work this paper cites.
S. Lloyd, “Universal quantum simulators,” Science
1996
Earlier work this paper cites.
G. L. Long, Y. S. Li, W. L. Zhang, and L. Niu, “Phase matching in quantum searching,” Phys. Lett
1999
Earlier work this paper cites.
D. Aharonov and A. Ta-Shma, “Adiabatic quantum state generation and statistical zero knowledge,” in Proceedings of the 35th Annual ACM Symposium on Theory of Computing
2003
Earlier work this paper cites.
Cambridge University Press, 1 ed., Jan. 2004
M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information · 2004
Earlier work this paper cites.
A. Hoorfar and M. Hassani, “Inequalities on the lambert w function and hyperpower function,” J. Inequal. Pure and Appl. Math
2008
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Phys. Rev. Lett
2009
Earlier work this paper cites.
A. M. Childs, “On the relationship between continuous- and discrete-time quantum walk,” Commun. Math. Phys
2010
Earlier work this paper cites.
A. M. Childs and R. Kothari, “Limitations on the simulation of non-sparse hamiltonians,” Quantum Info. Comput
2010
Earlier work this paper cites.
B. W. Reichardt, “Reflections for quantum query algorithms,” in Proceedings of the 28th annual ACM-SIAM symposium on Discrete Algorithms
2011
Cited alongside, same era.
A. M. Childs and N. Wiebe, “Hamiltonian simulation using linear combinations of unitary operations,” Quantum Info. Comput
2012
Cited alongside, same era.
D. W. Berry and A. M. Childs, “Black-box hamiltonian simulation and unitary implementation,” Quantum Info. Comput
2012
Cited alongside, same era.
R. D. Somma and S. Boixo, “Spectral gap amplification,” SIAM J. Comput
2013
Cited alongside, same era.
Siam, Philadelphia, 2013
L. N. Trefethen, Approximation theory and approximation practice · 2013
Cited alongside, same era.
S. Lloyd, M. Mohseni, and P. Rebentrost, “Quantum principal component analysis,” Nat. Phys
S. Sachdeva and N. K. Vishnoi, “Faster algorithms via approximation theory,” Found. Trends Theo. Comp. Sci
2014
Later among the works it cites.
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
2015
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 Proceedings of the 56th Annual IEEE Symposium on Foundations of Computer Science (FOCS),
2015
Later among the works it cites.
S. Gharibian, Y. Huang, Z. Landau, S. W. Shin, et al
2015
Later among the works it cites.
2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
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
2014
Cited alongside, same era.
PhD thesis, 2014
R. Kothari, Efficient algorithms in quantum query complexity · 2014
Cited alongside, same era.
A. Paetznick and K. M. Svore, “Repeat-until-success: Non-deterministic decomposition of single-qubit unitaries,” Quantum Info. Comput
2014
Cited alongside, same era.
T. J. Yoder, G. H. Low, and I. L. Chuang, “Fixed-point quantum search with an optimal number of queries,” Phys. Rev. Lett
2014
Cited alongside, same era.
Later among the works it cites.
G. H. Low, T. J. Yoder, and I. L. Chuang, “Methodology of resonant equiangular composite quantum gates,” Phys. Rev. X
2016
Later among the works it cites.
2016
Later among the works it cites.
S. Kimmel, C. Y.-Y. Lin, G. H. Low, M. Ozols, and T. J. Yoder, “Hamiltonian simulation with optimal sample complexity,” Npj Quantum Inf
2017
Closest in time.
G. H. Low and I. L. Chuang, “Optimal hamiltonian simulation by quantum signal processing,” Phys. Rev. Lett
2017
Closest in time.
Y. He, M.-X. Luo, E. Zhang, H.-K. Wang, and X.-F. Wang, “Decompositions of n-qubit toffoli gates with linear circuit complexity,” Int. J. Theor. Phys
2017
Closest in time.