Fetching the paper…
Reading the bibliography…
We present the problem of approximating the time-evolution operator $e^{-i\hat{H}t}$ to error $\epsilon$, where the Hamiltonian $\hat{H}=(\langle G|\otimes\hat{\mathcal{I}})\hat{U}(|G\rangle\otimes\hat{\mathcal{I}})$ is the projection of a unitary oracle $\hat{U}$ onto the state $|G\rangle$ created by another unitary oracle.
M. Abramowitz, I. A. Stegun, and Others, “Handbook of mathematical functions,” Applied mathematics series 55
1966
Earlier work this paper cites.
G. Meinardus, Approximation of Functions: Theory and Numerical Methods , Springer Tracts in Natural Philosophy, Vol. 13 (Springer Berlin Heidelberg, Berlin, Heidelberg, 1967)
1967
Earlier work this paper cites.
J. McClellan, T. Parks, and L. Rabiner, “A computer program for designing optimum FIR linear phase digital filters,” IEEE Transactions on Audio and Electroacoustics 21
1973
Earlier work this paper cites.
S. Lloyd, “Universal Quantum Simulators,” Science 273
1996
Earlier work this paper cites.
L. K. Grover, “A fast quantum mechanical algorithm for database search,” Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC ’96 STOC ’96, 212 (1996)
1996
Earlier work this paper cites.
L. J. Karam and J. H. McClellan, “Chebyshev digital FIR filter design,” Signal Processing 76
1999
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 ACM symposium on Theory of computing - STOC ’03 , STOC ’03 (ACM Press, New York, New York, USA, 2003) p. 20
2003
Earlier work this paper cites.
A. M. Childs, R. Cleve, E. Deotto, E. Farhi, S. Gutmann, and D. A. Spielman, “Exponential algorithmic speedup by a quantum walk,” in Proceedings of the thirty-fifth ACM symposium on Theory of computing - STOC ’03 , STOC ’03 (ACM Press, New York, New York, USA, 2003) p. 59
2003
Earlier work this paper cites.
M. Szegedy, “Quantum Speed-Up of Markov Chain Based Algorithms,” in 45th Annual IEEE Symposium on Foundations of Computer Science , FOCS ’04 (IEEE, Washington, DC, USA, 2004) pp. 32–41
2004
Earlier work this paper cites.
J. P. Boyd, “Rootfinding for a transcendental equation without a first guess: Polynomialization of Kepler’s equation through Chebyshev polynomial expansion of the sine,” Applied Numerical Mathematics 57
2007
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum Algorithm for Linear Systems of Equations,” Physical Review Letters 103
2009
Earlier work this paper cites.
A. M. Childs, “On the Relationship Between Continuous- and Discrete-Time Quantum Walk,” Communications in Mathematical Physics 294
2010
Earlier work this paper cites.
A. M. Childs and R. Kothari, “Limitations on the Simulation of Non-sparse Hamiltonians,” Quantum Information & Computation 10
2010
Earlier work this paper cites.
A. M. Childs and N. Wiebe, “Hamiltonian Simulation Using Linear Combinations of Unitary Operations,” Quantum Information & Computation 12
2012
Earlier work this paper cites.
D. W. Berry and A. M. Childs, “Black-box Hamiltonian simulation and unitary implementation,” Quantum Information & Computation 12
2012
Earlier work this paper cites.
R. D. Somma and S. Boixo, “Spectral Gap Amplification,” SIAM Journal on Computing 42
2013
Earlier work this paper cites.
S. Lloyd, M. Mohseni, and P. Rebentrost, “Quantum principal component analysis,” Nature Physics 10
2014
Cited alongside, same era.
M.-H. Yung, J. D. Whitfield, S. Boixo, D. G. Tempel, and A. Aspuru-Guzik, “Introduction to Quantum Algorithms for Physics and Chemistry,” in Quantum Information and Computation for Chemistry (John Wiley & Sons, Inc., 2014) pp. 67–106
2014
Cited alongside, same era.
D. Wecker, B. Bauer, B. K. Clark, M. B. Hastings, and M. Troyer, “Gate-count estimates for performing quantum chemistry on small quantum computers,” Physical Review A 90
2014
Cited alongside, same era.
R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, C. Neill, P. O’Malley, P. Roushan, A. Vainsencher, J. Wenner, A. N. Korotkov, A. N. Cleland, and J. M. Martinis, “Superconducting quantum circuits at the surface code threshold for fault tolerance,” Nature 508
2014
A. M. Childs, R. Kothari, and R. D. Somma, “Quantum Algorithm for Systems of Linear Equations with Exponentially Improved Dependence on Precision,” SIAM Journal on Computing 46
2017
Closest in time.
A. N. Chowdhury and R. D. Somma, “Quantum algorithms for Gibbs sampling and hitting-time estimation,” Quantum Information & Computation 17
2017
Closest in time.
F. G. Brandao and K. M. Svore, “Quantum Speed-Ups for Solving Semidefinite Programs,” 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , 415 (2017)
2017
Closest in time.
M. Reiher, N. Wiebe, K. M. Svore, D. Wecker, and M. Troyer, “Elucidating reaction mechanisms on quantum computers,” Proceedings of the National Academy of Sciences 114
2017
Closest in time.
I. D. Kivlichan, N. Wiebe, R. Babbush, and A. Aspuru-Guzik, “Bounding the costs of quantum simulation of many-body physics in real space,” Journal of Physics A: Mathematical and Theoretical 50
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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 - STOC ’14 , STOC ’14 (ACM Press, New York, New York, USA, 2014) pp. 283–292
2014
Cited alongside, same era.
R. Kothari, Efficient algorithms in quantum query complexity , Ph.D. thesis , University of Waterloo (2014)
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,” Physical Review Letters 113
2014
Cited alongside, same era.
D. W. Berry, A. M. Childs, and R. Kothari, “Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters,” in 2015 IEEE 56th Annual Symposium on Foundations of Computer Science , FOCS ’15 (IEEE, Washington, DC, USA, 2015) pp. 792–809
2015
Cited alongside, same era.
D. Poulin, M. B. Hastings, D. Wecker, N. Wiebe, A. C. Doherty, and M. Troyer, “The Trotter step size required for accurate quantum simulation of quantum chemistry,” Quantum Information & Computation 15
2015
Cited alongside, same era.
G. H. Low, T. J. Yoder, and I. L. Chuang, “Quantum Imaging by Coherent Enhancement,” Physical Review Letters 114
2015
Cited alongside, same era.
R. Babbush, D. W. Berry, I. D. Kivlichan, A. Y. Wei, P. J. Love, and A. Aspuru-Guzik, “Exponentially more precise quantum simulation of fermions in second quantization,” New Journal of Physics 18
2016
Cited alongside, same era.
P. J. J. O’Malley, R. Babbush, I. D. Kivlichan, J. Romero, J. R. McClean, R. Barends, J. Kelly, P. Roushan, A. Tranter, N. Ding, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, A. G. Fowler, E. Jeffrey, E. Lucero, A. Megrant, J. Y. Mutus, M. Neeley, C. Neill, C. Quintana, D. Sank, A. Vainsencher, J. Wenner, T. C. White, P. V. Coveney, P. J. Love, H. Neven, A. Aspuru-Guzik, and J. M. Martinis, “Scalable Quantum Simulation of Molecular Energies,” Physical Review X 6
2016
Cited alongside, same era.
2017
Closest in time.
S. Kimmel, C. Y.-Y. Lin, G. H. Low, M. Ozols, and T. J. Yoder, “Hamiltonian simulation with optimal sample complexity,” npj Quantum Information 3
2017
Closest in time.
A. Daskin and S. Kais, “An ancilla-based quantum simulation framework for non-unitary matrices,” Quantum Information Processing 16
2017
Closest in time.
2018
Closest in time.
J. Haah, M. Hastings, R. Kothari, and G. H. Low, “Quantum Algorithm for Simulating Real Time Evolution of Lattice Hamiltonians,” in 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) , FOCS ’18 (IEEE, Washington, DC, USA, 2018) pp. 350–360
2018
Closest in time.
2018
Closest in time.
A. M. Childs, D. Maslov, Y. Nam, N. J. Ross, and Y. Su, “Toward the first quantum simulation with quantum speedup,” Proceedings of the National Academy of Sciences 115
2018
Closest in time.
2018
Closest in time.
A. Gilyén, Y. Su, G. H. Low, and N. Wiebe, “Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics,” in Proceedings of the 51st Annual ACM Symposium on Theory of Computing - STOC ’19 (ACM Press, New York, New York, USA, 2019) pp. 193–204
2019
Closest in time.
2019
Closest in time.
G. H. Low, “Hamiltonian simulation with nearly optimal dependence on spectral norm,” in Proceedings of the 51st Annual ACM Symposium on Theory of Computing - STOC ’19 (ACM Press, New York, New York, USA, 2019) pp. 491–502
2019
Closest in time.