Fetching the paper…
Reading the bibliography…
Recent work has shown that it can be advantageous to implement a composite channel that partitions the Hamiltonian $H$ for a given simulation problem into subsets $A$ and $B$ such that $H=A+B$, where the terms in $A$ are simulated with a Trotter-Suzuki channel and the $B$ terms are randomly sampled via the QDrift algorithm.
Fractal decomposition of exponential operators with applications to many-body theories and monte carlo simulations
Masuo Suzuki · 1990
Earlier work this paper cites.
Quantum monte carlo methods—recent developments
Masuo Suzuki · 1993
Earlier work this paper cites.
Quantum measurements and the abelian stabilizer problem
A Yu Kitaev · 1995
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
Quantum monte carlo simulations of solids
WMC Foulkes, Lubos Mitas, RJ Needs, and Guna Rajagopal · 2001
Earlier work this paper cites.
Quantum computation and quantum information, 2002
Michael A Nielsen and Isaac Chuang · 2002
Earlier work this paper cites.
Finding exponential product formulas of higher orders
Naomichi Hatano and Masuo Suzuki · 2005
Earlier work this paper cites.
Lieb-robinson bounds and the exponential clustering theorem
Bruno Nachtergaele and Robert Sims · 2006
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.
Simulation of electronic structure hamiltonians using quantum computers
James D Whitfield, Jacob Biamonte, and Alán Aspuru-Guzik · 2011
Earlier work this paper cites.
Much ado about something: why lieb-robinson bounds are useful
Bruno Nachtergaele and Robert Sims · 2011
Earlier work this paper cites.
Scikit-learn: Machine learning in python
Fabian Pedregosa, Gaël Varoquaux, Alexandre Gramfort, Vincent Michel, Bertrand Thirion, Olivier Grisel, Mathieu Blondel, Peter Prettenhofer, Ron Weiss, Vincent Dubourg, et al · 2011
Cited alongside, same era.
Quantum algorithms for quantum field theories
Stephen P Jordan, Keith SM Lee, and John Preskill · 2012
Cited alongside, same era.
Hamiltonian simulation using linear combinations of unitary operations
Andrew M Childs and Nathan Wiebe · 2012
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
Cited alongside, same era.
Elucidating reaction mechanisms on quantum computers
Markus Reiher, Nathan Wiebe, Krysta M Svore, Dave Wecker, and Matthias Troyer · 2017
Cited alongside, same era.
Simulating physics with computers
Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2019
Later among the works it cites.
Quantum algorithms for quantum chemistry and quantum materials science
Bela Bauer, Sergey Bravyi, Mario Motta, and Garnet Kin-Lic Chan · 2020
Later among the works it cites.
Compilation by stochastic hamiltonian sparsification
Yingkai Ouyang, David R White, and Earl T Campbell · 2020
Later among the works it cites.
Time-dependent hamiltonian simulation with l 1 l1 -norm scaling
Dominic W Berry, Andrew M Childs, Yuan Su, Xin Wang, and Nathan Wiebe · 2020
Later among the works it cites.
Openfermion: the electronic structure package for quantum computers
Jarrod R McClean, Nicholas C Rubin, Kevin J Sung, Ian D Kivlichan, Xavier Bonet-Monroig, Yudong Cao, Chengyu Dai, E Schuyler Fried, Craig Gidney, Brendan Gimby, et al · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Richard P Feynman · 2018
Cited alongside, same era.
Low-depth quantum simulation of materials
Ryan Babbush, Nathan Wiebe, Jarrod McClean, James McClain, Hartmut Neven, and Garnet Kin-Lic Chan · 2018
Cited alongside, same era.
The theory of quantum information
John Watrous · 2018
Cited alongside, same era.
Pyscf: the python-based simulations of chemistry framework
Qiming Sun, Timothy C Berkelbach, Nick S Blunt, George H Booth, Sheng Guo, Zhendong Li, Junzi Liu, James D McClain, Elvira R Sayfutyarova, Sandeep Sharma, et al · 2018
Cited alongside, same era.
Random compiler for fast hamiltonian simulation
Earl Campbell · 2019
Cited alongside, same era.
Hamiltonian simulation by qubitization
Guang Hao Low and Isaac L Chuang · 2019
Cited alongside, same era.
Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
Mario Motta, Chong Sun, Adrian TK Tan, Matthew J O’Rourke, Erika Ye, Austin J Minnich, Fernando GSL Brandão, and Garnet Kin-Lic Chan · 2020
Later among the works it cites.
Theory of trotter error with commutator scaling
Andrew M Childs, Yuan Su, Minh C Tran, Nathan Wiebe, and Shuchen Zhu · 2021
Later among the works it cites.
Grand unification of quantum algorithms
John M Martyn, Zane M Rossi, Andrew K Tan, and Isaac L Chuang · 2021
Later among the works it cites.
Quantum algorithm for simulating real time evolution of lattice hamiltonians
Jeongwan Haah, Matthew B Hastings, Robin Kothari, and Guang Hao Low · 2021
Later among the works it cites.
Randomized quantum algorithm for statistical phase estimation
Kianna Wan, Mario Berta, and Earl T Campbell · 2022
Later among the works it cites.
Matthew Hagan and Nathan Wiebe · 2022
Later among the works it cites.