Fetching the paper…
Reading the bibliography…
Recent work has shown that quantum computers can compute scattering probabilities in massive quantum field theories, with a run time that is polynomial in the number of particles, their energy, and the desired precision.
On the vibrations of polyatomic molecules
N. Rosen and Philip M. Morse · 1932
Earlier work this paper cites.
Bemerkungen zur quantenmechanik des anharmonischen oszillators
G. Pöschl and E. Teller · 1933
Earlier work this paper cites.
Quantum Mechanics
Albert Messiah · 1962
Earlier work this paper cites.
Universal computation by quantum walk
Andrew M. Childs · 1972
Earlier work this paper cites.
The P ( ϕ ) 2 P(\phi)_{2} green’s functions: Asymptotic perturbation expansion
Jonathan Dimock · 1976
Earlier work this paper cites.
Asymptotic perturbation expansion for the S S matrix and the definition of time ordered functions in relativistic quantum field models
J.-P. Eckmann, H. Epstein, and J. Fröhlich · 1976
Earlier work this paper cites.
The scattering matrix is nontrivial for weakly coupled P ( ϕ ) 2 P(\phi)_{2} models
Konrad Osterwalder and Roland Sénéor · 1976
Earlier work this paper cites.
Exact Green’s function for the finite rectangular potential well in one dimension
R. Baltin · 1984
Earlier work this paper cites.
Adiabatic theorems and applications to the quantum Hall effect
J. E. Avron, R. Seiler, and L. G. Yaffe · 1987
Cited alongside, same era.
Linear adiabatic theory. Exponential estimates
G. Nenciu · 1993
Cited alongside, same era.
General decomposition theory of ordered exponentials
Masuo Suzuki · 1993
Cited alongside, same era.
Quantum Computation and Quantum Information
Michael Nielsen and Isaac Chuang · 2000
Cited alongside, same era.
A scheme for efficient quantum computation with linear optics
E. Knill, R. Laflamme, and G. J. Milburn · 2001
Cited alongside, same era.
Universal quantum gates
Jean-Luc Brylinski and Ranee Brylinsky · 2002
Cited alongside, same era.
Computational Complexity A Modern Approach
Sanjeev Arora and Boaz Barak · 2009
Later among the works it cites.
NIST Handbook of Mathematical Functions
F. W. J. Olver, D. W. Lozier, R. F. Boisvert, and C. W. Clark, editors · 2010
Later among the works it cites.
Higher order decompositions of ordered operator exponentials
Nathan Wiebe, Dominic W. Berry, Peter Høyer, and Barry C. Sanders · 2010
Later among the works it cites.
Heun functions and quasi-exactly solvable double-well potentials
Bei-Hua Chen, Yan Wu, and Qiong-Tau Xie · 2012
Later among the works it cites.
A note on the switching adiabatic theorem
Alexander Elgart and George A. Hagedorn · 2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sabine Jansen, Ruedi Seiler, and Mary-Beth Ruskai · 2007
Cited alongside, same era.
Fault-tolerant quantum computation with constant error rate
Dorit Aharonov and Michael Ben-Or · 2008
Cited alongside, same era.
Quantum computation of scattering in scalar quantum field theories
Stephen P. Jordan, Keith S. M. Lee, and John Preskill
Cited in the paper.
Quantum algorithms for fermionic quantum field theories
Stephen P. Jordan, Keith S. M. Lee, and John Preskill
Cited in the paper.
Stephen P. Jordan, Keith S. M. Lee, and John Preskill · 2012
Later among the works it cites.
Universal computation by multiparticle quantum walk
Andrew M. Childs, David Gosset, and Zak Webb · 2013
Later among the works it cites.
Universal quantum computation by scattering in the Fermi-Hubbard model
Ning Bao, Patrick Hayden, Grant Salton, and Nathaniel Thomas · 2014
Later among the works it cites.