Fetching the paper…
Reading the bibliography…
A central task in the field of quantum computing is to find applications where quantum computer could provide exponential speedup over any classical computer.
The polynomial-time hierarchy
Stockmeyer, L. J · 1976
Earlier work this paper cites.
Two theorems on random polynomial time
Adleman, L · 1978
Earlier work this paper cites.
The complexity of computing the permanent
Valiant, L. G · 1979
Earlier work this paper cites.
Simulating physics with computers
Feynman, R. P · 1982
Earlier work this paper cites.
Turing machines that take advice
Karp, R. M. & Lipton, R · 1982
Earlier work this paper cites.
A theory of the learnable
Valiant, L. G · 1984
Earlier work this paper cites.
On the computational power of pp and (+) p
Toda, S · 1989
Earlier work this paper cites.
Approximating probabilistic inference in bayesian belief networks is np-hard
Dagum, P. & Luby, M · 1993
Earlier work this paper cites.
A comparison of the computational power of sigmoid and boolean threshold circuits
Maass, W., Schnitger, G. & Sontag, E. D · 1994
Earlier work this paper cites.
Universal quantum simulators
Lloyd, S. et al · 1996
Earlier work this paper cites.
Bounds for the computational power and learning complexity of analog neural nets
Maass, W · 1997
Earlier work this paper cites.
Stabilizer codes and quantum error correction
Gottesman, D · 1997
Earlier work this paper cites.
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W · 1999
Earlier work this paper cites.
Quantum algorithm providing exponential speed increase for finding eigenvalues and eigenvectors
Abrams, D. S. & Lloyd, S · 1999
Earlier work this paper cites.
A quantum adiabatic evolution algorithm applied to random instances of an np-complete problem
Farhi, E. et al · 2001
Earlier work this paper cites.
A one-way quantum computer
Raussendorf, R. & Briegel, H. J · 2001
Earlier work this paper cites.
Classical and quantum computation , vol. 47 (American Mathematical Society Providence, 2002)
Kitaev, A. Y., Shen, A. & Vyalyi, M. N · 2002
Earlier work this paper cites.
Classical and Quantum Computation
Kitaev, A. Y., Shen, A. & Vyalyi, M. N · 2002
Earlier work this paper cites.
Quantum np-a survey
Aharonov, D. & Naveh, T · 2002
Earlier work this paper cites.
Pattern recognition and machine learning (springer, 2006)
Bishop, C. M · 2006
Earlier work this paper cites.
Pattern recognition and machine learning (springer, 2006)
Bishop, C. M · 2006
Earlier work this paper cites.
The complexity of the local hamiltonian problem
Kempe, J., Kitaev, A. & Regev, O · 2006
Cited alongside, same era.
Quantum random access memory
Giovannetti, V., Lloyd, S. & Maccone, L · 2008
Cited alongside, same era.
Architectures for a quantum random access memory
Giovannetti, V., Lloyd, S. & Maccone, L · 2008
Cited alongside, same era.
Representational power of restricted boltzmann machines and deep belief networks
Le Roux, N. & Bengio, Y · 2008
Cited alongside, same era.
Peps as unique ground states of local hamiltonians
Perez-Garcia, D., Verstraete, F., Wolf, M. & Cirac, J · 2008
Cited alongside, same era.
The complexity of quantum spin systems on a two-dimensional square lattice
Oliveira, R. & Terhal, B. M · 2008
Cited alongside, same era.
Understanding machine learning: From theory to algorithms (Cambridge university press, 2014)
Shalev-Shwartz, S. & Ben-David, S · 2014
Later among the works it cites.
On the number of linear regions of deep neural networks
Montufar, G. F., Pascanu, R., Cho, K. & Bengio, Y · 2014
Later among the works it cites.
Read the fine print
Aaronson, S · 2015
Later among the works it cites.
On the uniform convergence of relative frequencies of events to their probabilities
Vapnik, V. N. & Chervonenkis, A. Y · 2015
Later among the works it cites.
I-theory on depth vs width: hierarchical function composition
Poggio, T., Anselmi, F. & Rosasco, L · 2015
Later among the works it cites.
The power of depth for feedforward neural networks
Eldan, R. & Shamir, O · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The complexity of quantum spin systems on a two-dimensional square lattice
Oliveira, R. & Terhal, B. M · 2008
Cited alongside, same era.
Adiabatic quantum computation is equivalent to standard quantum computation
Aharonov, D. et al · 2008
Cited alongside, same era.
Quantum algorithm for linear systems of equations
Harrow, A. W., Hassidim, A. & Lloyd, S · 2009
Cited alongside, same era.
Probabilistic graphical models: principles and techniques (MIT press, 2009)
Koller, D. & Friedman, N · 2009
Cited alongside, same era.
Computational complexity: a modern approach (Cambridge University Press, 2009)
Arora, S. & Barak, B · 2009
Cited alongside, same era.
Universal blind quantum computation
Broadbent, A., Fitzsimons, J. & Kashefi, E · 2009
Cited alongside, same era.
Later among the works it cites.
Quantum speed-ups for semidefinite programming
Brandão, F. G. & Svore, K · 2016
Later among the works it cites.
Quantum discriminant analysis for dimensionality reduction and classification
Cong, I. & Duan, L · 2016
Later among the works it cites.
Deep learning (MIT press, 2016)
Goodfellow, I., Bengio, Y. & Courville, A · 2016
Later among the works it cites.
Deep learning (MIT press, 2016)
Goodfellow, I., Bengio, Y. & Courville, A · 2016
Later among the works it cites.
Learning real and boolean functions: When is deep better than shallow
Mhaskar, H., Liao, Q. & Poggio, T · 2016
Later among the works it cites.
On the expressive power of deep neural networks
Raghu, M., Poole, B., Kleinberg, J., Ganguli, S. & Sohl-Dickstein, J · 2016
Later among the works it cites.
Exponential expressivity in deep neural networks through transient chaos
Poole, B., Lahiri, S., Raghu, M., Sohl-Dickstein, J. & Ganguli, S · 2016
Later among the works it cites.
Deep vs. shallow networks : An approximation theory perspective
Mhaskar, H. & Poggio, T · 2016
Later among the works it cites.
Why does deep and cheap learning work so well?
Lin, H. W. & Tegmark, M · 2016
Later among the works it cites.
Liang, S. & Srikant, R · 2016
Later among the works it cites.
Quantum machine learning: a classical perspective
Ciliberto, C. et al · 2017
Closest in time.
Exponential quantum speed-ups for semidefinite programming with applications to quantum learning
Brandão, F. G. et al · 2017
Closest in time.
Quantum supremacy for simulating a translation-invariant ising spin model
Gao, X., Wang, S.-T. & Duan, L.-M · 2017
Closest in time.
On the implausibility of classical client blind quantum computing
Aaronson, S., Cojocaru, A., Gheorghiu, A. & Kashefi, E · 2017
Closest in time.