Fetching the paper…
Reading the bibliography…
Suppose a matrix $A \in \mathbb{R}^{m \times n}$ of rank $r$ with singular value decomposition $A = U_{A}\Sigma_{A} V_{A}^{T}$, where $U_{A} \in \mathbb{R}^{m \times r}$, $V_{A} \in \mathbb{R}^{n \times r}$ are orthonormal and $\Sigma_{A} \in \mathbb{R}^{r \times r}$ is a diagonal matrix.
H. Weyl. Das asymptotische verteilungsgesetz der eigenwerte linearer partieller differentialgleichungen (mit einer anwendung auf die theorie der hohlraumstrahlung)
1912
Earlier work this paper cites.
A. M. Childs, R. Kothari and R. D. Somma. Quantum algorithm for systems of linear equations with exponentially improved dependence on precision
1950
Earlier work this paper cites.
D. C. Hoaglin and R. E. Welsch. The hat matrix in regression and ANOVA
1978
Earlier work this paper cites.
J.-G. Sun. Perturbation bounds for the Cholesky and QR factorizations
1991
Earlier work this paper cites.
A. Frieze, R. Kannan and S. Vempala. Fast Monte-Carlo algorithms for finding low-rank approximations
2004
Earlier work this paper cites.
P. Drineas, M. W. Mahoney and S. Muthukrishnan. Sampling algorithms for ℓ 2 \ell_{2} regression and applications
2006
Earlier work this paper cites.
P. Drineas, M. W. Mahoney and S. Muthukrishnan. Subspace sampling and relativeerror matrix approximation: column-based methods
2006
Earlier work this paper cites.
T. Sarlós. Improved approximation algorithms for large matrices via random projections
2006
Earlier work this paper cites.
P. Drineas, R. Kannan and M. W. Mahoney. Fast Monte Carlo algorithms for matrices II: computing a low-rank approximation to a matrix
2006
Earlier work this paper cites.
P. Drineas, M. W. Mahoney and S. Muthukrishnan. Relative-error CUR matrix decompositions
2008
Earlier work this paper cites.
M. W. Mahoney and P. Drineas. CUR matrix decompositions for improved data analysis
2009
Earlier work this paper cites.
C. Boutsidis, M. W. Mahoney and P. Drineas. An improved approximation algorithm for the column subset selection problem
2009
Earlier work this paper cites.
E. J. Candés and B. Recht. Exact matrix completion via convex optimization
2009
Earlier work this paper cites.
A. W. Harrow, A. Hassidim and S. Lloyd. Quantum algorithm for linear systems of equations
2009
Earlier work this paper cites.
A. Talwalkar and A. Rostamizadeh. Matrix coherence and the Nyström method
2010
Earlier work this paper cites.
M. Magdon-Ismail, Row sampling for matrix algorithms via a non-commutative Bernstein bound
2010
Earlier work this paper cites.
M. W. Mahoney. Randomized algorithms for matrices and data
2011
Earlier work this paper cites.
P. Drineas, M. W. Mahoney, S. Muthukrishnan and T. Sarlós. Faster least squares approximation
2011
Cited alongside, same era.
P. Drineas, M. Magdon-Ismail, M. W. Mahoney and D. P. Woodruff. Fast approximation of matrix coherence and statistical leverage
2012
Cited alongside, same era.
N. Wiebe, D. Braun and S. Lloyd. Quantum algorithm for data fitting
2012
Cited alongside, same era.
M. Li, G. L. Miller and R. Peng. Iterative row sampling
2013
Cited alongside, same era.
J. Nelson and H. L. Nguyễn. OSNAP: Faster numerical linear algebra algorithms via sparser subspace embeddings
2013
Cited alongside, same era.
B. D. Clader, B. C. Jacobs and C. R. Sprouse. Preconditioned quantum linear system algorithm
2013
2018
Later among the works it cites.
2018
Later among the works it cites.
H. F. Wang and H. Xiang. Quantum algorithm for total least squares data fitting
2019
Later among the works it cites.
E. Tang. A quantum-inspired classical algorithm for recommendation systems
2019
Later among the works it cites.
2019
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.
S. Lloyd, M. Mohseni and P. Rebentrost. Quantum principal component analysis
2014
Cited alongside, same era.
P. Rebentrost, M. Mohseni and S. Lloyd. Quantum support vector machine for big data classification
2014
Cited alongside, same era.
J. T. Holodnak, I. C. F. Ipsen and T. Wentworth. Conditioning of leverage scores and computation by QR decomposition
2014
Cited alongside, same era.
M. Schuld, I. Sinayskiy and F. Petruccione. Prediction by linear regression on a quantum computer
2016
Cited alongside, same era.
Y. Liu and S. Y. Zhang. Fast quantum algorithms for least squares regression and statistic leverage scores
2017
Cited alongside, same era.
K. L. Clarkson and D. P. Woodruff. Low-rank approximation and regression in input sparsity time
2017
Cited alongside, same era.
Z. Chen, Y. Li, X. Sun, P. Yuan and J. Zhang. A quantum-inspired classical algorithm for separable non-negative matrix factorization
2019
Later among the works it cites.
C. P. Shao and H. Xiang. Quantum regularized least squares solver with parameter estimate
2020
Later among the works it cites.
I. Kerenidis and A. Prakash. Quantum gradient descent for linear systems and least squares
2020
Later among the works it cites.
C. P. Shao and H. Xiang. Row and column iteration methods to solve linear systems on a quantum computer
2020
Later among the works it cites.
N.-H. Chia, A. Gilyén, T. Y. Li, H.-H. Lin, E. Tang and C. T. Wang. Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning
2020
Later among the works it cites.
Y. X. Du, M.-H. Hsieh, T. L. Liu and D. C. Tao. Quantum-inspired algorithm for general minimum conical hull problems
2020
Later among the works it cites.
J. M. Arrazola, A. Delgado, B. R. Bardhan and S. Lloyd. Quantum-inspired algorithms in practice
2020
Later among the works it cites.
A. Sobczyk and E. Gallopoulos. Estimating leverage scores via rank revealing methods and randomization
2021
Closest in time.
Q. Zuo, C. P. Shao, C. N. Wu and H. Xiang. An extended row and column method for solving linear systems on a quantum computer
2021
Closest in time.
C. Ding, T. Y. Bao and H. L. Huang. Quantum-inspired support vector machine
2021
Closest in time.
N. Koide-Majima and K. Majima. Quantum-inspired canonical correlation analysis for exponentially large dimensional data
2021
Closest in time.