Fetching the paper…
Reading the bibliography…
Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers.
“Über die praktische Auflösung von Integralgleichungen mit Anwendungen auf Randwertaufgaben”
Evert Nyström · 1930
Earlier work this paper cites.
“On the product of semi-groups of operators”
Hale Trotter · 1959
Earlier work this paper cites.
“Generalized Trotter’s formula and systematic approximants of exponential operators and inner derivations with applications to many-body problems”
Masuo Suzuki · 1976
Earlier work this paper cites.
“Approximation of matrix-valued functions”
Roy Mathias · 1993
Earlier work this paper cites.
“Universal Quantum Simulators”
Seth Lloyd · 1996
Earlier work this paper cites.
“Using the Nyström Method to Speed Up Kernel Machines”
Christopher.. Williams and Matthias Seeger · 2001
Earlier work this paper cites.
“Observations on the Nyström Method for Gaussian Process Prediction”, 2002
CKI. Williams, CE. Rasmussen, A. Schwaighofer and V. Tresp · 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.
“Exponential Algorithmic Speedup by a Quantum Walk”
Andrew. Childs et al · 2003
Earlier work this paper cites.
“A norm inequality for Hermitian operators”
Ritsuo Nakamoto · 2003
Earlier work this paper cites.
“Spectral Grouping Using the Nyström Method”
Charless Fowlkes, Serge Belongie, Fan Chung and Jitendra Malik · 2004
Earlier work this paper cites.
“Fast Monte-Carlo Algorithms for Finding Low-Rank Approximations”
Alan Frieze, Ravi Kannan and Santosh Vempala · 2004
Earlier work this paper cites.
“Nearly-Linear Time Algorithms for Graph Partitioning, Graph Sparsification, and Solving Linear Systems”
Daniel. Spielman and Shang-Hua Teng · 2004
Earlier work this paper cites.
“Matrix product density operators: Simulation of finite-temperature and dissipative systems”
Frank Verstraete, Juan Garcia-Ripoll and Juan Cirac · 2004
Earlier work this paper cites.
“Efficient Simulation of One-Dimensional Quantum Many-Body Systems”
Guifré Vidal · 2004
Earlier work this paper cites.
“On the Nyström Method for Approximating a Gram Matrix for Improved Kernel-Based Learning”
Petros Drineas and Michael. Mahoney · 2005
Earlier work this paper cites.
“The Scaling and Squaring Method for the Matrix Exponential Revisited”
Nicholas. Higham · 2005
Earlier work this paper cites.
“Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication”
Petros Drineas, Ravi Kannan and Michael Mahoney · 2006
Earlier work this paper cites.
“Fast Monte Carlo algorithms for matrices II: Computing a low-rank approximation to a matrix”
Petros Drineas, Ravi Kannan and Michael Mahoney · 2006
Earlier work this paper cites.
“Fast low-rank approximation for covariance matrices”
Mohamed-Ali Belabbas and Patrick Wolfe · 2007
Earlier work this paper cites.
“On sparse representations of linear operators and the approximation of matrix products”
Mohamed-Ali Belabbas and Patrick Wolfe · 2008
Earlier work this paper cites.
“Large-scale manifold learning”
Ameet Talwalkar, Sanjiv Kumar and Henry Rowley · 2008
Earlier work this paper cites.
“Matrix product states, projected entangled pair states, and variational renormalization group methods for quantum spin systems”
Frank Verstraete, Valentin Murg and J Cirac · 2008
Cited alongside, same era.
“Improved Nyström Low-Rank Approximation and Error Analysis”
Kai Zhang, Ivor. Tsang and James. Kwok · 2008
Cited alongside, same era.
“The Scaling and Squaring Method for the Matrix Exponential Revisited”
Nicholas. Higham · 2009
Cited alongside, same era.
“On Sampling-Based Approximate Spectral Decomposition”
Sanjiv Kumar, Mehryar Mohri and Ameet Talwalkar · 2009
Cited alongside, same era.
“A new scaling and squaring algorithm for the matrix exponential”
Awad Al-Mohy and Nicholas Higham · 2009
Cited alongside, same era.
“Making Large-Scale Nyström Approximation Possible”
Mu Li, James. Kwok and Bao-Liang Lu · 2010
“Quantum principal component analysis”
Seth Lloyd, Masoud Mohseni and Patrick Rebentrost · 2014
Later among the works it cites.
“A practical introduction to tensor networks: Matrix product states and projected entangled pair states”
Román Orús · 2014
Later among the works it cites.
“Quantum support vector machine for big data classification”
Patrick Rebentrost, Masoud Mohseni and Seth Lloyd · 2014
Later among the works it cites.
“Sketching as a tool for numerical linear algebra”
David Woodruff · 2014
Later among the works it cites.
“Hamiltonian simulation with nearly optimal dependence on all parameters”
Dominic Berry, Andrew Childs and Robin Kothari · 2015
Later among the works it cites.
“Less is More: Nyström Computational Regularization”
Alessandro Rudi, Raffaello Camoriano and Lorenzo Rosasco · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
“Classical simulation of quantum computation, the Gottesman-Knill theorem, and slightly beyond”
Maarten Van · 2010
Cited alongside, same era.
“Clustered Nyström method for large scale manifold learning and dimension reduction”
Kai Zhang and James Kwok · 2010
Cited alongside, same era.
“Simulating Sparse Hamiltonians with Star Decompositions”
Andrew. Childs and Robin Kothari · 2011
Cited alongside, same era.
“Faster Least Squares Approximation”
Petros Drineas, Michael. Mahoney, S. Muthukrishnan and Tamás Sarlós · 2011
Cited alongside, same era.
“Time-dependent variational principle for quantum lattices”
Jutho Haegeman et al · 2011
Cited alongside, same era.
“Divide-and-Conquer Matrix Factorization”
Lester Mackey, Ameet Talwalkar and Michael. Jordan · 2011
Cited alongside, same era.
“Less is More: Nyström Computational Regularization”
Alessandro Rudi, Raffaello Camoriano and Lorenzo Rosasco · 2015
Later among the works it cites.
“Operator Lipschitz functions”
Alexei Aleksandrov and Vladimir Peller · 2016
Later among the works it cites.
“Quantum recommendation systems”
Iordanis Kerenidis and Anupam Prakash · 2016
Later among the works it cites.
“Prediction by linear regression on a quantum computer”
Maria Schuld, Ilya Sinayskiy and Francesco Petruccione · 2016
Later among the works it cites.
“Quantum machine learning”
Jacob Biamonte et al · 2017
Later among the works it cites.
“Quantum machine learning: a classical perspective”
Carlo Ciliberto et al · 2017
Later among the works it cites.
“Hamiltonian simulation with optimal sample complexity”
Shelby Kimmel et al · 2017
Later among the works it cites.
“Hamiltonian Simulation by Uniform Spectral Amplification”
Guang Low and Isaac Chuang · 2017
Later among the works it cites.
“Simulation of quantum circuits by low-rank stabilizer decompositions”
Sergey Bravyi et al · 2018
Closest in time.
“Lectures on randomized numerical linear algebra”
Petros Drineas and Michael Mahoney · 2018
Closest in time.
“Explicit lower bounds on strong quantum simulation”
Cupjin Huang, Michael Newman and Mario Szegedy · 2018
Closest in time.
“Neural-network states for the classical simulation of quantum computing”
Bjarni Jónsson, Bela Bauer and Giuseppe Carleo · 2018
Closest in time.
Nai-Hui Chia et al · 2019
Closest in time.
“Quantum gradient descent and Newton’s method for constrained polynomial optimization”
Patrick Rebentrost et al · 2019
Closest in time.
“A Quantum-Inspired Classical Algorithm for Recommendation Systems”
Ewin Tang · 2019
Closest in time.