Fetching the paper…
Reading the bibliography…
We introduce a new approach for quantum linear algebra based on quantum subspace states and present three new quantum machine learning algorithms.
R. Brauer and H. Weyl, “Spinors in n dimensions,” American Journal of Mathematics , vol. 57, no. 2, pp. 425–449, 1935
1935
Earlier work this paper cites.
G. Stewart, “Computing the cs decomposition of a partitioned orthonormal matrix,” Numerische Mathematik , vol. 40, no. 3, pp. 297–306, 1982
1982
Earlier work this paper cites.
C. Van Loan, “Computing the cs and the generalized singular value decompositions,” Numerische Mathematik , vol. 46, no. 4, pp. 479–491, 1985
1985
Earlier work this paper cites.
B. S. Tsirel’son, “Quantum analogues of the bell inequalities. the case of two spatially separated domains,” Journal of Soviet Mathematics , vol. 36, no. 4, pp. 557–570, 1987
1987
Earlier work this paper cites.
A. Y. Kitaev, “Quantum measurements and the abelian stabilizer problem,” arXiv preprint quant-ph/9511026 , 1995
1995
Earlier work this paper cites.
P. W. Shor, “Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer,” SIAM review , vol. 41, no. 2, pp. 303–332, 1999
1999
Earlier work this paper cites.
T. Frerix and J. Bruna, “Approximating orthogonal matrices with effective givens factorization,” in International Conference on Machine Learning . PMLR, 2019, pp. 1993–2001
2001
Earlier work this paper cites.
B. M. Terhal and D. P. DiVincenzo, “Classical simulation of noninteracting-fermion quantum circuits,” Physical Review A , vol. 65, no. 3, p. 032325, 2002
2002
Earlier work this paper cites.
B. Sturmfels, Algorithms in invariant theory . Springer Science & Business Media, 2008
2008
Earlier work this paper cites.
A. W. Harrow, A. Hassidim, and S. Lloyd, “Quantum algorithm for linear systems of equations,” Physical review letters , vol. 103, no. 15, p. 150502, 2009
2009
Earlier work this paper cites.
D. J. Brod and E. F. Galvão, “Geometries for universal quantum computation with matchgates,” Physical Review A , vol. 86, no. 5, p. 052307, 2012
2012
Earlier work this paper cites.
R. A. Horn and C. R. Johnson, Matrix analysis . Cambridge university press, 2012
2012
Earlier work this paper cites.
B. W. Reichardt, F. Unger, and U. Vazirani, “Classical command of quantum systems,” Nature , vol. 496, no. 7446, pp. 456–460, 2013
2013
Earlier work this paper cites.
A. Prakash, Quantum algorithms for linear algebra and machine learning . University of California, Berkeley, 2014
2014
Cited alongside, same era.
S. Aaronson, “Read the fine print,” Nature Physics , vol. 11, no. 4, pp. 291–293, 2015
2015
Cited alongside, same era.
S. Lloyd, S. Garnerone, and P. Zanardi, “Quantum algorithms for topological and geometric analysis of data,” Nature communications , vol. 7, no. 1, pp. 1–7, 2016
2016
Cited alongside, same era.
I. Kerenidis and A. Prakash, “Quantum recommendation systems,” Proceedings of the 8th Innovations in Theoretical Computer Science Conference , 2017
2017
Cited alongside, same era.
E. S. Gawlik, Y. Nakatsukasa, and B. D. Sutton, “A backward stable algorithm for computing the cs decomposition via the polar decomposition,” SIAM Journal on Matrix Analysis and Applications , vol. 39, no. 3, pp. 1448–1469, 2018
C. Gyurik, C. Cade, and V. Dunjko, “Towards quantum advantage for topological data analysis,” arXiv e-prints , pp. arXiv–2005, 2020
2020
Later among the works it cites.
I. Kerenidis and A. Luongo, “Quantum classification of the mnist dataset via slow feature analysis,” Physical Review A , 2020
2020
Later among the works it cites.
I. Kerenidis, A. Luongo, and A. Prakash, “Quantum expectation-maximization for gaussian mixture models,” Proceedings of the International Conference on Machine Learning , 2020
2020
Later among the works it cites.
M. Derezinski and M. W. Mahoney, “Determinantal point processes in randomized numerical linear algebra,” Notices of the American Mathematical Society , vol. 68, no. 1, pp. 34–45, 2021
2021
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
A. Prakash, J. Sikora, A. Varvitsiotis, and Z. Wei, “Completely positive semidefinite rank,” Mathematical Programming , vol. 171, no. 1, pp. 397–431, 2018
2018
Cited alongside, same era.
M. Dereziński, K. L. Clarkson, M. W. Mahoney, and M. K. Warmuth, “Minimax experimental design: Bridging the gap between statistical and worst-case approaches to least squares regression,” in Conference on Learning Theory . PMLR, 2019, pp. 1050–1069
2019
Cited alongside, same era.
S. D. K. Wright, K.M. Beck and et al. ., “Benchmarking an 11-qubit quantum computer,” Nat Commun , vol. 10, 2019
2019
Cited alongside, same era.
I. Kerenidis, J. Landman, A. Luongo, and A. Prakash, “q-means: A quantum algorithm for unsupervised machine learning,” Advances in Neural Information Processing Systems 32 , 2019
2019
Cited alongside, same era.
E. Tang, “A quantum-inspired classical algorithm for recommendation systems,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , 2019, pp. 217–228
2019
Cited alongside, same era.
2020
Cited alongside, same era.
N.-H. Chia, A. Gilyén, T. Li, H.-H. Lin, E. Tang, and C. Wang, “Sampling-based sublinear low-rank matrix arithmetic framework for dequantizing quantum machine learning,” in Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing , 2020, pp. 387–400
2020
Cited alongside, same era.
2021
Later among the works it cites.
S. Johri, S. Debnath, A. Mocherla, A. Singh, A. Prakash, J. Kim, and I. Kerenidis, “Nearest centroid classification on a trapped ion quantum computer,” npj Quantum Information , vol. 7, no. 1, pp. 1–11, 2021
2021
Later among the works it cites.
I. Kerenidis and J. Landman, “Quantum spectral clustering,” Physical Review A 103 (4), 042415 , 2021
2021
Later among the works it cites.
I. Kerenidis and A. Prakash, “Quantum gradient descent for linear systems and least squares,” Physical Review A 101 (2), 022316 , 2021
2021
Later among the works it cites.
2021
Later among the works it cites.
2021
Later among the works it cites.
C. Rusu and L. Rosasco, “Fast approximation of orthogonal matrices and application to pca,” Signal Processing , p. 108451, 2021
2021
Later among the works it cites.