Fetching the paper…
Reading the bibliography…
We study the problem of simulating the dynamics of spin systems when the initial state is supported on a subspace of low energy of a Hamiltonian $H$.
On colouring the nodes of a network
Rowland Leonard Brooks · 1941
Earlier work this paper cites.
Two soluble models of an antiferromagnetic chain
Elliott Lieb, Theodore Schultz, and Daniel Mattis · 1961
Earlier work this paper cites.
Validity of many-body approximation methods for a solvable model:(i). exact solutions and perturbation theory
H. J. Lipkin, N. Meshkov, and A.J. Glick · 1965
Earlier work this paper cites.
Simulating physics with computers
Richard P. Feynman · 1982
Earlier work this paper cites.
Fractal decomposition of exponential operators with applications to many-body theories and monte carlo simulations
Masuo Suzuki · 1990
Earlier work this paper cites.
General theory of fractal path integrals with applications to many-body theories and statistical physics
Masuo Suzuki · 1991
Earlier work this paper cites.
Renormalization of hamiltonians
Stanisław D. Głazek and Kenneth G. Wilson · 1993
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
Monte Carlo Methods in Statistical Physics
Mark E.J. Newman and Gerard T. Barkema · 1998
Earlier work this paper cites.
Quantum computation by adiabatic evolution
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser · 2000
Earlier work this paper cites.
Simulating physical phenomena by quantum networks
Rolando Somma, Gerardo Ortiz, James E. Gubernatis, Emanuel Knill, and Raymond Laflamme · 2002
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.
Fault-tolerant quantum computation by anyons
A. Yu Kitaev · 2003
Earlier work this paper cites.
Rigorous results on valence-bond ground states in antiferromagnets
Ian Affleck, Tom Kennedy, Elliott H. Lieb, and Hal Tasaki · 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
Cited alongside, same era.
Tensor-entanglement renormalization group approach as a unified method for symmetry breaking and topological phase transitions
Zheng-Cheng Gu, Michael Levin, and Xiao-Gang Wen · 2008
Cited alongside, same era.
Algorithms for entanglement renormalization
Glen Evenbly and Guifré Vidal · 2009
Cited alongside, same era.
Higher order decompositions of ordered operator exponentials
Nathan Wiebe, Dominic Berry, Peter Høyer, and Barry C. Sanders · 2010
Cited alongside, same era.
Fast quantum algorithms for traversing paths of eigenstates
Sergio Boixo, Emanuel Knill, and Rolando D. Somma · 2010
Cited alongside, same era.
A trotter-suzuki approximation for lie groups with applications to hamiltonian simulation
Rolando D. Somma · 2016
Later among the works it cites.
Connecting global and local energy distributions in quantum spin models on a lattice
Itai Arad, Tomotaka Kuwahara, and Zeph Landau · 2016
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.
Exponentially more precise quantum simulation of fermions in the configuration interaction representation
Ryan Babbush et al · 2017
Later among the works it cites.
Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
Andrew M. Childs, Robin Kothari, and Rolando D. Somma · 2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sergey Bravyi and Barbara Terhal · 2010
Cited alongside, same era.
Solving frustration-free spin systems
Niel de Beaudrap, Matthias Ohliger, Tobias J. Osborne, and Jens Eisert · 2010
Cited alongside, same era.
Quantum Phase Transitions, 2nd Edition
Subir Sachdev · 2011
Cited alongside, same era.
Schrieffer–wolff transformation for quantum many-body systems
Sergey Bravyi, David P DiVincenzo, and Daniel Loss · 2011
Cited alongside, same era.
Quantum algorithms for quantum field theories
Stephen P. Jordan, Keith S.M. Lee, and John Preskill · 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.
Gate-count estimates for performing quantum chemistry on small quantum computers
Dave Wecker, Bela Bauer, Bryan K. Clark, Matthew B. Hastings, and Matthias Troyer · 2014
Cited alongside, same era.
Guang Hao Low and Isaac L. Chuang · 2017
Later among the works it cites.
Quantum algorithm for simulating real time evolution of lattice hamiltonians
Jeongwan Haah, Matthew Hastings, Robin Kothari, and Guang Hao Low · 2018
Later among the works it cites.
Hamiltonian simulation by qubitization
Guang Hao Low and Isaac L. Chuang · 2019
Later among the works it cites.
A random compiler for fast hamiltonian simulation
Earl Campbell · 2019
Later among the works it cites.
Nearly optimal lattice simulation by product formulas
Andrew M. Childs and Yuan Su · 2019
Later among the works it cites.
Well-conditioned multiproduct hamiltonian simulation
Guang Hao Low, Vadym Kliuchnikov, and Nathan Wiebe · 2019
Later among the works it cites.
Hamiltonian simulation algorithms for near-term quantum hardware
Laura Clinton, Johannes Bausch, and Toby Cubitt · 2020
Closest in time.
Theory of trotter error with commutator scaling
Andrew M. Childs, Yuan Su, Minh C. Tran, Nathan Wiebe, and Shuchen Zhu · 2021
Closest in time.