Fetching the paper…
Reading the bibliography…
Let $A$ be an $s$-sparse Hermitian matrix, $f(x)$ be a univariate function, and $i, j$ be two indices.
The Theory of Approximation
Dunham Jackson · 1930
Earlier work this paper cites.
On the construction of a Jacobi matrix from spectral data
Harry Hochstadt · 1974
Earlier work this paper cites.
The Symmetric Eigenvalue Problem
Beresford N Parlett · 1980
Earlier work this paper cites.
Rapid solution of problems by quantum computation
David Deutsch and Richard Jozsa · 1992
Earlier work this paper cites.
On linear semi-infinite programming problems: An algorithm
Hang-Chin Lai and Soon-Yi Wu · 1992
Earlier work this paper cites.
Quantum complexity theory
Ethan Bernstein and Umesh Vazirani · 1993
Earlier work this paper cites.
Analysis of Numerical Methods
Eugene Isaacson and Herbert Bishop Keller · 1994
Earlier work this paper cites.
Inversion of a tridiagonal Jacobi matrix
Riaz A Usmani · 1994
Earlier work this paper cites.
A fast quantum mechanical algorithm for database search
Lov K Grover · 1996
Earlier work this paper cites.
Strengths and weaknesses of quantum computing
Charles H Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Peter W Shor · 1997
Earlier work this paper cites.
On the power of quantum computation
Daniel R Simon · 1997
Earlier work this paper cites.
Limit on the speed of quantum computation in determining parity
Edward Farhi, Jeffrey Goldstone, Sam Gutmann, and Michael Sipser · 1998
Earlier work this paper cites.
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf · 2001
Earlier work this paper cites.
Linear programming
George B Dantzig · 2002
Earlier work this paper cites.
Quantum lower bound for the collision problem with small range
Samuel Kutin · 2005
Earlier work this paper cites.
Polynomial degree vs. quantum query complexity
Andris Ambainis · 2006
Cited alongside, same era.
BQP-complete problems concerning mixing properties of classical random walks on sparse graphs
Dominik Janzing and Pawel Wocjan · 2006
Cited alongside, same era.
Efficient quantum algorithms for simulating sparse Hamiltonians
Dominic W Berry, Graeme Ahokas, Richard Cleve, and Barry C Sanders · 2007
Cited alongside, same era.
Robust polynomials and quantum algorithms
Harry Buhrman, Ilan Newman, HEIN Rohrig, and Ronald de Wolf · 2007
Cited alongside, same era.
A simple PromiseBQP-complete matrix problem
Dominik Janzing and Pawel Wocjan · 2007
Cited alongside, same era.
Functions of Matrices: Theory and Computation
Nicholas J Higham · 2008
Cited alongside, same era.
On Solving Linear Systems in Sublinear Time
Alexandr Andoni, Robert Krauthgamer, and Yosef Pogrow · 2018
Later among the works it cites.
The Quantum Complexity of Computing Schatten p p -norms
Chris Cade and Ashley Montanaro · 2018
Later among the works it cites.
Quantum query algorithms are completely bounded forms
Srinivasan Arunachalam, Jop Briët, and Carlos Palazuelos · 2019
Later among the works it cites.
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2019
Later among the works it cites.
Quantum SDP-solvers: Better upper and lower bounds
Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf · 2020
Later among the works it cites.
Degree vs. approximate degree and quantum implications of Huang’s sensitivity theorem
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Quantum algorithm for linear systems of equations
Aram W Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Cited alongside, same era.
Semi-infinite programming, duality, discretization and optimality conditions
Alexander Shapiro · 2009
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.
Faster algorithms via approximation theory
Sushant Sachdeva and Nisheeth K Vishnoi · 2014
Cited alongside, same era.
Shrinkage of De Morgan formulae by spectral techniques
Avishay Tal · 2014
Cited alongside, same era.
Scott Aaronson, Shalev Ben-David, Robin Kothari, Shravas Rao, and Avishay Tal · 2021
Later among the works it cites.
k k -Forrelation optimally separates quantum and classical query complexity
Nikhil Bansal and Makrand Sinha · 2021
Later among the works it cites.
Quantum algorithms for powering stable Hermitian matrices
Guillermo González, Rahul Trivedi, and J Ignacio Cirac · 2021
Later among the works it cites.
Complexity of quantum state verification in the quantum linear systems problem
Rolando D Somma and Yiğit Subaşı · 2021
Later among the works it cites.
Optimal-Degree Polynomial Approximations for Exponentials and Gaussian Kernel Density Estimation
Amol Aggarwal and Josh Alman · 2022
Later among the works it cites.
Tight bound for estimating expectation values from a system of linear equations
Abhijeet Alase, Robert R Nerem, Mohsen Bagherimehrab, Peter Høyer, and Barry C Sanders · 2022
Later among the works it cites.
A theory of quantum differential equation solvers: limitations and fast-forwarding
Dong An, Jin-Peng Liu, Daochen Wang, and Qi Zhao · 2022
Later among the works it cites.
A (simple) classical algorithm for estimating betti numbers
Simon Apers, Sayantan Sen, and Dániel Szabó · 2022
Later among the works it cites.
Approximate Degree in Classical and Quantum Computing
Mark Bun, Justin Thaler, et al · 2022
Later among the works it cites.
An exponential separation between quantum query complexity and the polynomial degree
Andris Ambainis and Aleksandrs Belovs · 2023
Closest in time.
Quantum computational complexity of matrix functions
Santiago Cifuentes, Samson Wang, Thais L Silva, Mario Berta, and Leandro Aolita · 2024
Closest in time.