Cited by 460Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Quantum-Enhanced Machine Learning

Open access
Dunjko, Vedran, Taylor, Jacob M., Briegel, Hans J.·2016·Physical Review Letters

Abstract

The emerging field of quantum machine learning has the potential to substantially aid in the problems and scope of artificial intelligence. This is only enhanced by recent successes in the field of classical machine learning. In this work we propose an approach for the systematic treatment of machine learning, from the perspective of quantum information. Our approach is general and covers all three main branches of machine learning: supervised, unsupervised, and reinforcement learning. While quantum improvements in supervised and unsupervised learning have been reported, reinforcement learning has received much less attention. Within our approach, we tackle the problem of quantum enhancements in reinforcement learning as well, and propose a systematic scheme for providing improvements. As an example, we show that quadratic improvements in learning efficiency, and exponential improvements in performance over limited time periods, can be obtained for a broad class of learning problems.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physrevlett.117.130501

Cites

23 of 23 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 13

  1. [2]Science, Special issue on Artificial Intelligence , Vol. 349 (AAAS, 2015)
  2. [6]Lloyd, S., Mohseni, M. and Rebentrost, P. Quantum algorithms for supervised and unsupervised machine learning. ArXiv:1307.0411 (2013). · arXiv
  3. [11]Arunachalam, S., de Wolf, R., arXiv:1607.00932 (2016). · arXiv
  4. [12]Servedio, R. A. Gortler, S. J. Quantum versus classical learnability. In: 16th Annual IEEE Conference on Computational Complexity, 138-148 (2001).
  5. [13]Atıcı, A. Advances in Quantum Computational Learning Theory (Columbia University, PhD Thesis, 2006).
  6. [22]Van den Nest, M., D¨ ur, W., Miyake, A. & Briegel, H. J. Fundamentals of universality in one-way quantum computation. New Journal of Physics 9 , 204 (2007). URL http://stacks.iop.org/1367-2630/9/i=6/a=204 .
  7. [23]Wolpert, D. H. The lack of a priori distinctions between learning algorithms. Neural Comput. 8 , 1341-1390 (1996). URL http://dx.doi.org/10.1162/neco.1996. 8.7.1341 . · DOI
  8. [27]Durr, C., Hoyer, P. A Quantum Algorithm for Finding the Minimum. arXiv:quant-ph/9607014 (1996). · arXiv
  9. [30]Brassard, G., Hoyer, P., Mosca, M. and Tapp, A. Quantum Amplitude Amplification and Estimation arXiv:quant-ph/0005055 (2000). · arXiv
  10. [31]Dunjko, V., Taylor, J. M. & Briegel, H. J. Framework for learning agents in quantum environments. arXiv:1507.08482 (2015). · arXiv
  11. [32]Grover, L. K. Proceedings, 28th Annual ACM Symposium on the Theory of Computing (STOC) 212 (1996).
  12. [34]Sutton, R. S. Integrated Architectures for Learning, Planning, and Reacting Based on Approximating Dynamic Programming. Advances in Natural Computation In Proceedings of the Seventh International Conference on Machine Learninge 216-224 (1990).
  13. [36]Makmal, A , Melnikov, A. A., and Briegel, H. J. Metalearning within Projective Simulation. IEEE Access 4, 2110 (2016).

Cited by

Sorted by citations

Authors
Dunjko, V., Taylor, J. M., & Briegel, H. J.
Affiliations
  • Universität Innsbruck (AT)
  • National Institute of Standards and Technology (US)
Venue
Physical Review Letters
Published
2016-09-20
Volume
117
Issue
13
Pages
130501-130501
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2521267242
Cited by
460
References
23
Citations by year
2026: 37 · 2025: 69 · 2024: 60 · 2023: 54 · 2022: 50 · 2021: 63 · 2020: 56 · 2019: 31 · 2018: 23 · 2017: 17
FWCI
19.50
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion, cc-by)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • Austrian Science Fund (SFB FoQuS F 4012)
  • Templeton World Charity Foundation (TWCF0078/AB46)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
Keywords
quantum machine learning, supervised learning, unsupervised learning, quantum information, learning efficiency, quantum advantage

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review