Fetching the paper…
Reading the bibliography…
We apply the framework of block-encodings, introduced by Low and Chuang (under the name standard-form), to the study of quantum machine learning algorithms and derive general results that are applicable to a variety of input models, including sparse matrix oracles and matrices stored in a data structure.
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.
Random walks and electric networks
Peter G Doyle and J Laurie Snell · 1984
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.
Quantum algorithms revisited
Richard Cleve, Artur Ekert, Chiara Macchiavello, and Michele Mosca · 1998
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.
Quantum search of spatial regions
Scott Aaronson and Andris Ambainis · 2003
Earlier work this paper cites.
Adiabatic quantum state generation and statistical zero-knowledge
Dorit Aharonov and Amnon Ta-Schma · 2003
Earlier work this paper cites.
Quantum information processing in continuous time
Andrew M. Childs · 2004
Earlier work this paper cites.
Efficient quantum algorithms for simulating sparse hamiltonians
Dominic W. Berry, Graeme Ahokas, Richard Cleve, and Barry C. Sanders · 2007
Earlier work this paper cites.
Vittorio Giovannetti, Seth Lloyd, and Lorenzo Maccone · 2008
Earlier work this paper cites.
Quantum algorithm for linear systems of equations
Aram W. Harrow, Avinatan Hassidim, and Seth Lloyd · 2009
Earlier work this paper cites.
On the relationship between continuous- and discrete-time quantum walk
Andrew M. Childs · 2010
Earlier work this paper cites.
Electrical flows, laplacian systems, and faster approximation of maximum flow in undirected graphs
Paul Christiano, Jonathan A Kelner, Aleksander Madry, Daniel A Spielman, and Shang-Hua Teng · 2011
Earlier work this paper cites.
Quantum simulation of time-dependent hamiltonians and the convenient illusion of hilbert space
David Poulin, Angie Qarry, Rolando Somma, and Frank Verstraete · 2011
Earlier work this paper cites.
Graph sparsification by effective resistances
Daniel A Spielman and Nikhil Srivastava · 2011
Earlier work this paper cites.
Simulating hamiltonian dynamics on a quantum computer
Nathan Wiebe, Dominic W. Berry, Peter Høyer, and Barry C. Sanders · 2011
Earlier work this paper cites.
Variable time amplitude amplification and quantum algorithms for linear algebra problems
Andris Ambainis · 2012
Cited alongside, same era.
Black-box hamiltonian simulation and unitary implementation
Dominic W. Berry and Andrew M. Childs · 2012
Cited alongside, same era.
Hamiltonian simulation using linear combinations of unitaries
Andrew M. Childs and Nathan Wiebe · 2012
Cited alongside, same era.
Quantum algorithm for data fitting
Nathan Wiebe, Daniel Braun, and Seth Lloyd · 2012
Cited alongside, same era.
Tsuyoshi Ito and Stacey Jeffery · 2016
Later among the works it cites.
Quantum recommendation systems
Iordanis Kerenidis and Anupam Prakash · 2016
Later among the works it cites.
Hamiltonian simulation by qubitization
Guang Hao Low and Isaac L. Chuang · 2016
Later among the works it cites.
Improved hamiltonian simulation via a truncated Taylor series and corrections
Leonardo Novo and Dominic W. Berry · 2016
Later among the works it cites.
Prediction by linear regression on a quantum computer
Maria Schuld, Ilya Sinayskiy, and Francesco Petruccione · 2016
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Aleksandrs Belovs, Andrew M Childs, Stacey Jeffery, Robin Kothari, and Frédéric Magniez · 2013
Cited alongside, same era.
Quantum walks and electric networks
Aleksandrs Belovs · 2013
Cited alongside, same era.
Modern graph theory
Béla Bollobás · 2013
Cited alongside, same era.
A new approach to computing maximum flows using electrical flows
Yin Tat Lee, Satish Rao, and Nikhil Srivastava · 2013
Cited alongside, same era.
Inverting well conditioned matrices in quantum logspace
Amnon Ta-Shma · 2013
Cited alongside, same era.
Exponential improvement in precision for simulating sparse hamiltonians
D. W. Berry, A. M. Childs, R. Cleve, R. Kothari, and R. D. Somma · 2014
Cited alongside, same era.
Quantum principal component analysis
Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost · 2014
Cited alongside, same era.
On the robustness of bucket brigade quantum ram
Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O’Connor, Michele Mosca, and Priyaa Varshinee Srinivasan · 2015
Cited alongside, same era.
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 · 2017
Later among the works it cites.
Andrew M. Childs, Robin Kothari, and Rolando D. Somma · 2017
Later among the works it cites.
Quantum gradient descent for linear systems and least squares
Iordanis Kerenidis and Anupam Prakash · 2017
Later among the works it cites.
Hamiltonian simulation by uniform spectral amplification
Guang Hao Low and Isaac L. Chuang · 2017
Later among the works it cites.
Fast quantum algorithms for least squares regression and statistic leverage scores
Yang Liu and Shengyu Zhang · 2017
Later among the works it cites.
Quantum speedup of the traveling-salesman problem for bounded-degree graphs
Dominic J Moylett, Noah Linden, and Ashley Montanaro · 2017
Later among the works it cites.
Efficient quantum algorithms for analyzing large sparse electrical networks
Guoming Wang · 2017
Later among the works it cites.
Quantum algorithm for linear regression
Guoming Wang · 2017
Later among the works it cites.
Shantanav Chakraborty, András Gilyén, and Stacey Jeffery · 2018
Closest in time.
András Gilyén, Yuan Su, Guang Hao Low, and Nathan Wiebe · 2018
Closest in time.
A quantum algorithm for simulating non-sparse hamiltonian, 2018, arXiv: 1803.08273
Chunhao Wang and Leonard Wossnig · 2018
Closest in time.
Quantum linear system algorithm for dense matrices
Leonard Wossnig, Zhikuan Zhao, and Anupam Prakash · 2018
Closest in time.