Fetching the paper…
Reading the bibliography…
We present an algorithmic framework for quantum-inspired classical algorithms on close-to-low-rank matrices, generalizing the series of results started by Tang's breakthrough quantum-inspired algorithm for recommendation systems [STOC'19].
Quantum-inspired sublinear algorithm for solving low-rank semidefinite programming
Nai-Hui Chia, Tongyang Li, Han-Hsuan Lin, and Chunhao Wang · 1901
Earlier work this paper cites.
Quantum-inspired algorithms in practice
Juan Miguel Arrazola, Alain Delgado, Bhaskar Roy Bardhan, and Seth Lloyd · 1905
Earlier work this paper cites.
Quantum-inspired support vector machine
Chen Ding, Tian-Yi Bao, and He-Liang Huang · 1906
Earlier work this paper cites.
A quantum-inspired classical algorithm for separable non-negative matrix factorization
Zhihuai Chen, Yinan Li, Xiaoming Sun, Pei Yuan, and Jialin Zhang · 1907
Earlier work this paper cites.
Quantum-inspired algorithm for general minimum conical hull problems
Yuxuan Du, Min-Hsiu Hsieh, Tongliang Liu, and Dacheng Tao · 1907
Earlier work this paper cites.
Quantum-inspired classical algorithms for singular value transformation
Dhawal Jethwani, François Le Gall, and Sanjay K. Singh · 1910
Earlier work this paper cites.
A note on saturation in microwave spectroscopy
Robert Karplus and Julian Schwinger · 1948
Earlier work this paper cites.
An operator calculus having applications in quantum electrodynamics
Richard P. Feynman · 1951
Earlier work this paper cites.
Simulating physics with computers
Richard P. Feynman · 1982
Earlier work this paper cites.
On the method of bounded differences , page 148–188
Colin McDiarmid · 1989
Earlier work this paper cites.
A linear algorithm for generating random numbers with a given distribution
Michael D. Vose · 1991
Earlier work this paper cites.
Polynomials and polynomial inequalities , volume 161 of Graduate Texts in Mathematics
Peter Borwein and Tamás Erdélyi · 1995
Earlier work this paper cites.
Universal quantum simulators
Seth Lloyd · 1996
Earlier work this paper cites.
Introduction to matrix analysis
R. Bellman · 1997
Earlier work this paper cites.
Matrix Analysis , volume 169 of Graduate Texts in Mathematics
Rajendra Bhatia · 1997
Earlier work this paper cites.
Eigenfaces vs. Fisherfaces: recognition using class specific linear projection
Peter N. Belhumeur, João P. Hespanha, and David J. Kriegman · 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.
The complexity of the matrix eigenproblem
Victor Y. Pan and Zhao Q. Chen · 1999
Earlier work this paper cites.
Competitive recommendation systems
Petros Drineas, Iordanis Kerenidis, and Prabhakar Raghavan · 2002
Earlier work this paper cites.
Creating superpositions that correspond to efficiently integrable probability distributions
Lov Grover and Terry Rudolph · 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.
Fast Monte-Carlo algorithms for finding low-rank approximations
Alan Frieze, Ravi Kannan, and Santosh Vempala · 2004
Earlier work this paper cites.
Hayata Yamasaki, Sathyawageeswar Subramanian, Sho Sonoda, and Masato Koashi · 2004
Earlier work this paper cites.
Towards quantum advantage via topological data analysis, 2020
Casper Gyurik, Chris Cade, and Vedran Dunjko · 2005
Earlier work this paper cites.
Fast Monte Carlo algorithms for matrices I: Approximating matrix multiplication
Petros Drineas, Ravi Kannan, and Michael W. Mahoney · 2006
Earlier work this paper cites.
Approximate quantum circuit synthesis using block encodings
Daan Camps and Roel Van Beeumen · 2007
Earlier work this paper cites.
A randomized algorithm for a tensor-based generalization of the singular value decomposition
Petros Drineas and Michael W. Mahoney · 2007
Earlier work this paper cites.
Efficient algorithms using the multiplicative weights update method
Satyen Kale · 2007
Earlier work this paper cites.
Sampling from large matrices: An approach through geometric functional analysis
Mark Rudelson and Roman Vershynin · 2007
Cited alongside, same era.
Relative-error CUR matrix decompositions
Petros Drineas, Michael W. Mahoney, and S. Muthukrishnan · 2008
Cited alongside, same era.
Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone · 2008
Cited alongside, same era.
Tensor-CUR decompositions for tensor-based data
Michael W. Mahoney, Mauro Maggioni, and Petros Drineas · 2008
Cited alongside, same era.
Quantum algorithm for linear systems of equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Cited alongside, same era.
Fisher linear discriminant analysis
Low-rank approximation and regression in input sparsity time
Kenneth L. Clarkson and David P. Woodruff · 2017
Later among the works it cites.
Quantum recommendation systems
Iordanis Kerenidis and Anupam Prakash · 2017
Later among the works it cites.
Randomized algorithms in numerical linear algebra
Ravindran Kannan and Santosh Vempala · 2017
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.
Quantum machine learning: a classical perspective
Carlo Ciliberto, Mark Herbster, Alessandro Davide Ialongo, Massimiliano Pontil, Andrea Rocchetto, Simone Severini, and Leonard Wossnig · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Max Welling · 2009
Cited alongside, same era.
Operator Hölder–Zygmund functions
Alexei B. Aleksandrov and Vladimir V. Peller · 2010
Cited alongside, same era.
Perturbations of functions of diagonalizable matrices
Michael I. Gil · 2010
Cited alongside, same era.
254a, Notes 3a: Eigenvalues and sums of Hermitian matrices, 2010
Terence Tao · 2010
Cited alongside, same era.
Estimates of operator moduli of continuity
Alexei B. Aleksandrov and Vladimir V. Peller · 2011
Cited alongside, same era.
Quantum-inspired algorithms from randomized numerical linear algebra
Nadiia Chepurko, Kenneth Clarkson, Lior Horesh, Honghao Lin, and David Woodruff · 2011
Cited alongside, same era.
Beating SGD: Learning SVMs in sublinear time
Elad Hazan, Tomer Koren, and Nati Srebro · 2011
Cited alongside, same era.
Nai-Hui Chia, Han-Hsuan Lin, and Chunhao Wang · 2018
Later among the works it cites.
An empirical evaluation of sketching for numerical linear algebra
Yogesh Dahiya, Dimitris Konomis, and David P Woodruff · 2018
Later among the works it cites.
Quantum-inspired low-rank stochastic regression with logarithmic dependence on the dimension
András Gilyén, Seth Lloyd, and Ewin Tang · 2018
Later among the works it cites.
Quantum Computing in the NISQ era and beyond
John Preskill · 2018
Later among the works it cites.
Quantum computational finance: quantum algorithm for portfolio optimization
Patrick Rebentrost and Seth Lloyd · 2018
Later among the works it cites.
Quantum linear system algorithm for dense matrices
Leonard Wossnig, Zhikuan Zhao, and Anupam Prakash · 2018
Later among the works it cites.
Improvements in quantum SDP-solving with applications
Joran van Apeldoorn and András Gilyén · 2019
Closest in time.
Quantum SDP solvers: Large speed-ups, optimality, and applications to quantum learning
Fernando G. S. L. Brandão, Amir Kalev, Tongyang Li, Cedric Yen-Yu Lin, Krysta M. Svore, and Xiaodi Wu · 2019
Closest in time.
Shantanav Chakraborty, András Gilyén, and Stacey Jeffery · 2019
Closest in time.
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2019
Closest in time.
Quantum gradient descent and Newton’s method for constrained polynomial optimization
Patrick Rebentrost, Maria Schuld, Leonard Wossnig, Francesco Petruccione, and Seth Lloyd · 2019
Closest in time.
A quantum-inspired classical algorithm for recommendation systems
Ewin Tang · 2019
Closest in time.
Quantum-assisted Gaussian process regression
Zhikuan Zhao, Jack K. Fitzsimons, and Joseph F. Fitzsimons · 2019
Closest in time.
Quantum SDP-solvers: Better upper and lower bounds
Joran van Apeldoorn, András Gilyén, Sander Gribling, and Ronald de Wolf · 2020
Closest in time.
Quantum-inspired algorithms for solving low-rank linear equation systems with logarithmic dependence on the dimension
Nai-Hui Chia, András Gilyén, Han-Hsuan Lin, Seth Lloyd, Ewin Tang, and Chunhao Wang · 2020
Closest in time.
A non-review of Quantum Machine Learning: trends and explorations
Vedran Dunjko and Peter Wittek · 2020
Closest in time.
Quantum gradient descent for linear systems and least squares
Iordanis Kerenidis and Anupam Prakash · 2020
Closest in time.
Approximating Hamiltonian dynamics with the Nyström method
Alessandro Rudi, Leonard Wossnig, Carlo Ciliberto, Andrea Rocchetto, Massimiliano Pontil, and Simone Severini · 2020
Closest in time.
Information-theoretic bounds on quantum advantage in machine learning
Hsin-Yuan Huang, Richard Kueng, and John Preskill · 2021
Closest in time.
Grand unification of quantum algorithms
John M. Martyn, Zane M. Rossi, Andrew K. Tan, and Isaac L. Chuang · 2021
Closest in time.
Ewin Tang · 2021
Closest in time.
Quantum algorithmic measurement
Dorit Aharonov, Jordan Cotler, and Xiao-Liang Qi · 2022
Closest in time.