Fetching the paper…
Reading the bibliography…
We present a quantum algorithm for approximating the real time evolution $e^{-iHt}$ of an arbitrary $d$-sparse Hamiltonian to error $\epsilon$, given black-box access to the positions and $b$-bit values of its non-zero matrix entries.
Simulating physics with computers
Richard P. Feynman · 1982
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
Adiabatic quantum state generation and statistical zero knowledge
Dorit Aharonov and Amnon Ta-Shma · 2003
Earlier work this paper cites.
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs, Richard Cleve, Enrico Deotto, Edward Farhi, Sam Gutmann, and Daniel A. Spielman · 2003
Earlier work this paper cites.
A new quantum ripple-carry addition circuit
Steven A. Cuccaro, Thomas G. Draper, Samuel A. Kutin, and David Petrie Moulton · 2004
Earlier work this paper cites.
Efficient quantum algorithms for simulating sparse Hamiltonians
Dominic W. Berry, Graeme Ahokas, Richard Cleve, and Barry C. Sanders · 2007
Earlier work this paper cites.
Quantum random access memory
Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone · 2008
Earlier work this paper cites.
Quantum algorithm for linear systems of equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Earlier work this paper cites.
Efficient quantum circuits for arbitrary sparse unitaries
Stephen P. Jordan and Pawel Wocjan · 2009
Earlier work this paper cites.
Span programs and quantum query complexity: The general adversary bound is nearly tight for every boolean function
Ben W. Reichardt · 2009
Earlier work this paper cites.
On the relationship between continuous- and discrete-time quantum walk
Andrew M. Childs · 2010
Earlier work this paper cites.
Limitations on the simulation of non-sparse Hamiltonians
Andrew M. Childs and Robin Kothari · 2010
Earlier work this paper cites.
Theory of Quantum Computation, Communication, and Cryptography , pages 94–103
Andrew M. Childs and Robin Kothari · 2011
Cited alongside, same era.
Black-box Hamiltonian simulation and unitary implementation
Dominic W. Berry and Andrew M. Childs · 2012
Cited alongside, same era.
Hamiltonian simulation using linear combinations of unitary operations
Andrew M. Childs and Nathan Wiebe · 2012
Cited alongside, same era.
Hamiltonian complexity
Tobias J Osborne · 2012
Cited alongside, same era.
Exponential improvement in precision for simulating sparse Hamiltonians
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma · 2014
Cited alongside, same era.
Simulating Hamiltonian dynamics with a truncated Taylor series
Dominic W. Berry, Andrew M. Childs, Richard Cleve, Robin Kothari, and Rolando D. Somma · 2015
Toward the first quantum simulation with quantum speedup
Andrew M. Childs, Dmitri Maslov, Yunseong Nam, Neil J. Ross, and Yuan Su · 2017
Later among the works it cites.
Hamiltonian simulation by uniform spectral amplification
Guang Hao Low and Isaac L Chuang · 2017
Later among the works it cites.
Optimal Hamiltonian simulation by quantum signal processing
Guang Hao Low and Isaac L. Chuang · 2017
Later among the works it cites.
Shantanav Chakraborty, András Gilyén, and Stacey Jeffery · 2018
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.
Hamiltonian simulation with nearly optimal dependence on all parameters
Dominic W. Berry, Andrew M. Childs, and Robin Kothari · 2015
Cited alongside, same era.
Corrected quantum walk for optimal Hamiltonian simulation
Dominic W. Berry and Leonardo Novo · 2016
Cited alongside, same era.
Hamiltonian simulation by qubitization
Guang Hao Low and Isaac L Chuang · 2016
Cited alongside, same era.
Methodology of resonant equiangular composite quantum gates
Guang Hao Low, Theodore J. Yoder, and Isaac L. Chuang · 2016
Cited alongside, same era.
Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
Andrew M. Childs, Robin Kothari, and Rolando D. Somma · 2017
Cited alongside, same era.
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2018
Closest in time.
Product decomposition of periodic functions in quantum signal processing
Jeongwan Haah · 2018
Closest in time.
Quantum algorithm for simulating real time evolution of lattice Hamiltonians
Jeongwan Haah, Matthew B Hastings, Robin Kothari, and Guang Hao Low · 2018
Closest in time.
Private communication
Aram W. Harrow and Robin Kothari · 2018
Closest in time.
Hamiltonian simulation in the interaction picture
Guang Hao Low and Nathan Wiebe · 2018
Closest in time.
Black-box quantum state preparation without arithmetic
Yuval R. Sanders, Guang Hao Low, Artur Scherer, and Dominic W. Berry · 2018
Closest in time.
A quantum algorithm for simulating non-sparse Hamiltonians
Chunhao Wang and Leonard Wossnig · 2018
Closest in time.