Fetching the paper…
Reading the bibliography…
Linear differential equations are ubiquitous in science and engineering.
G. Dahlquist, “A special stability problem for linear multistep methods”, BIT 3
1963
Earlier work this paper cites.
O. B. Widlund, “A note on unconditionally stable linear multistep methods”, BIT 7
1967
Earlier work this paper cites.
R. D. Grigoreff and J. Schroll, “Über A ( α ) A(\alpha) -stabile Verfahren hoher Konsistenzordnung”, Computing 20
1978
Earlier work this paper cites.
R. P. Feynman, “Simulating physics with computers”, Int. J. Theor. Phys. 21
1982
Earlier work this paper cites.
R. P. Feynman, “Quantum mechanical computers”, Opt. News 11
1985
Earlier work this paper cites.
E. Hairer and G. Wanner, Solving Ordinary Differential Equations II: Stiff and Differential-Algebraic Problems
1991
Earlier work this paper cites.
S. Lloyd, “Universal quantum simulators”, Science 273
1996
Earlier work this paper cites.
L. K. Grover, “Synthesis of quantum superpositions by quantum computation”, Phys. Rev. Lett. 85
2000
Earlier work this paper cites.
L. Grover and T. Rudolph, “Creating superpositions that correspond to efficiently integrable probability distributions”, arXiv:quant-ph/0208112 (2002)
2002
Earlier work this paper cites.
D. Aharonov and A. Ta-Shma, “Adiabatic quantum state generation and statistical zero knowledge”, in Proceedings of the 35th ACM Symposium on Theory of Computing, 2003 (ACM, New York, 2003), pp. 20-29; arXiv:quant-ph/0301023
2003
Cited alongside, same era.
A. M. Childs, “Quantum information processing in continuous time”, Ph.D. thesis, Massachusetts Institute of Technology, 2004
2004
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.
2008
Cited alongside, same era.
J. C. Butcher, Numerical Methods for Ordinary Differential Equations
2008
A. Ambainis, “New developments in quantum algorithms”, Lecture Notes in Computer Science 6281
2010
Closest in time.
2010
Closest in time.
D. W. Berry and A. M. Childs, “Black-box Hamiltonian simulation and unitary implementation”, Quantum Information and Computation 12
2012
Closest in time.
S. P. Jordan, K. S. M. Lee, J. Preskill, “Quantum algorithms for quantum field theories”, Science 336
2012
Closest in time.
A. Ambainis, “Variable time amplitude amplification and quantum algorithms for linear algebra problems”, Symposium on Theoretical Aspects of Computer Science 14
2012
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
A. M. Childs, “On the relationship between continuous- and discrete-time quantum walk”, Commun. Math. Phys. 294
2009
Cited alongside, same era.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations”, Phys. Rev. Lett. 103
2009
Cited alongside, same era.
N. Wiebe, D. W. Berry, P. Høyer, and B. C. Sanders, “Higher order decompositions of ordered operator exponentials”, J. Phys. A: Math. Theor. 43
2010
Cited alongside, same era.
D. Kothe et al
2013
Closest in time.
2013
Closest in time.
B. D. Clader, B. C. Jacobs, and C. R. Sprouse, “Preconditioned quantum linear system algorithm”, Phys. Rev. Lett. 110
2013
Closest in time.