Fetching the paper…
Reading the bibliography…
Quantum algorithms for solving the Quantum Linear System (QLS) problem are among the most investigated quantum algorithms of recent times, with potential applications including the solution of computationally intractable differential equations and speed-ups in machine learning.
1909
Earlier work this paper cites.
1910
Earlier work this paper cites.
A. C. Schaeffer, Inequalities of A. Markoff and S. Bernstein for polynomials and related functions , Bulletin of the American Mathematical Society 47
1941
Earlier work this paper cites.
J. R. Shewchuk, An introduction to the conjugate gradient method without the agonizing pain , Carnegie Mellon University (1994)
1994
Earlier work this paper cites.
R. Merris, Laplacian matrices of graphs: a survey , Linear algebra and its applications 197
1994
Earlier work this paper cites.
M. Boyer,G. Brassard, P. Høyer and A. Tapp, Tight bounds on quantum searching , Progress of Physics 46
1998
Earlier work this paper cites.
A. Nayak and F. Wu, The quantum query complexity of approximating the median and related statistics , Proceedings of the 31st annual ACM symposium on Theory of computing, 384–393 (1999) [ arXiv:9804066 ]
1999
Earlier work this paper cites.
M. A. Nielsen, and I. Chuang, Quantum computation and quantum information , Cambridge University Press (2000)
2000
Earlier work this paper cites.
L. K. Grover, Synthesis of quantum superpositions by quantum computation , Physical Review Letters 85
2000
Earlier work this paper cites.
G. Brassard, P. Hoyer, M. Mosca, and A. Tapp, Quantum Amplitude Amplification and Estimation , Contemporary Mathematics 305
2002
Earlier work this paper cites.
L. Grover and T. Rudolph, Creating superpositions that correspond to efficiently integrable probability distributions , arXiv:0208112 (2002)
2002
Earlier work this paper cites.
2002
Earlier work this paper cites.
J. C. Mason, and D. C. Handscomb, Chebyshev polynomials , CRC press (2002)
2002
Earlier work this paper cites.
Y. Saad, Iterative methods for sparse linear systems , SIAM (2003)
2003
Earlier work this paper cites.
S. U. Pillai, T. Suel, and S. Cha, The Perron-Frobenius theorem: some of its applications , IEEE Signal Processing Magazine 22
2005
Earlier work this paper cites.
V. V. Shende, S. S. Bullock, and I. L. Markov, Synthesis of quantum-logic circuits , IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 25
2006
Earlier work this paper cites.
W. H. Press, B. P. Flannery, S. A. Teukolsky, and W. T. Vetterling, Numerical Recipes: The Art of Scientific Computing, Third Edition , Cambridge University Press (2007)
2007
Earlier work this paper cites.
2007
Cited alongside, same era.
2008
Cited alongside, same era.
V. Giovannetti, S. Lloyd, and L. Maccone, Quantum random access memory , Physical Review Letters 100
2008
Cited alongside, same era.
2009
Cited alongside, same era.
2017
Later among the works it cites.
2017
Later among the works it cites.
X. Jiang, Minimum rank positive semidefinite matrix completion with chordal sparsity pattern , Doctoral dissertation, UCLA (2017)
2017
Later among the works it cites.
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…
2009
Cited alongside, same era.
S. Arora and B. Barak, Computational complexity: a modern approach , Cambridge University Press (2009)
2009
Cited alongside, same era.
D. A. Spielman, Algorithms, graph theory, and linear equations in Laplacian matrices , Proceedings of the International Congress of Mathematicians 2010, 2698–2722 (2010)
2010
Cited alongside, same era.
2011
Cited alongside, same era.
2012
Cited alongside, same era.
2013
Cited alongside, same era.
R. D. Somma and S. Boixo, Spectral gap amplification , SIAM Journal on Computing 42
2013
Cited alongside, same era.
A. Gilyén, Quantum walk based search methods and algorithmic applications , Doctoral dissertation, Eötvös Loránd University (2014)
2014
Cited alongside, same era.
2018
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
2019
Later among the works it cites.
G. H. Low and I. L. Chuang, Hamiltonian simulation by qubitization , Quantum 3
2019
Later among the works it cites.
2019
Later among the works it cites.
2020
Later among the works it cites.
2020
Later among the works it cites.
E. Malvetti, R. Iten, and R. Colbeck, Quantum Circuits for Sparse Isometries arXiv:2006.00016 (2020)
2020
Later among the works it cites.