Cited by 1,951Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Quantum Support Vector Machine for Big Data Classification

Open access
Rebentrost, Patrick, Mohseni, Masoud, Lloyd, Seth·2014·Physical Review Letters

Abstract

Supervised machine learning is the classification of new data based on already classified training examples. In this work, we show that the support vector machine, an optimized binary classifier, can be implemented on a quantum computer, with complexity logarithmic in the size of the vectors and the number of training examples. In cases where classical sampling algorithms require polynomial time, an exponential speedup is obtained. At the core of this quantum big data algorithm is a nonsparse matrix exponentiation technique for efficiently performing a matrix inversion of the training data inner-product (kernel) matrix.

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.113.130503

Cites

30 of 30 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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Exponential speedup has been shown to be possible for quantum support vector machines.

    “Exponential speedup has, for instance, shown to be possible for quantum support vector machines [110]”
  • By more sophisticated Trotter-Suzuki decompositions, the approximation error can be made to depend on progressively higher orders in τ.

    “First, by more sophisticated Trotter-Suzuki decompositions 261 , the approximation error can be made to depend on progressively-higher orders in τ 196,260,261 .”

    From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [261]

  • For an arbitrary vector |χ, the method serves as a tool for supervised learning and cluster assignment.

    “If |χ is some other vector, then the method provides a method for supervised learning and cluster assignment 9,10,21,28 :”

    From Quantum principal component analysis (2014) · cites this paper as [28]

  • The expressivity boost is not limited to neural networks and has been observed for support vector machines.

    “Note that this expressivity boost is not limited to neural networks and has been observed, for instance, for support vector machines.[222,228,229]”

    From Quantum Computing for Molecular Biology** (2023) · cites this paper as [222]

  • Quantum realizations of principal components analysis and support vector machine have been derived.

    “The first advantage has been leveraged in deriving the quantum realization of the principal components analysis algorithm [221] and of a support vector machine.[222]”

    From Quantum Computing for Molecular Biology** (2023) · cites this paper as [222]

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. [8]H. Neven, V. Denchev, G. Rose, and W. Macready, arXiv:quant-ph/0811.0416 (2008).
  2. [9]H. Neven, V. Denchev, G. Rose, and W. Macready, arXiv:0912.0779 (2009). · arXiv
  3. [10]K. Pudenz and D. Lidar, Quant. Inf. Proc. 12 , 2027 (2013).
  4. [11]V. S. Denchev, N. Ding, S. V. N. Vishwanathan, and H. Neven, arXiv:1205.1148 (2012). · arXiv
  5. [14]S. Lloyd, M. Mohseni, and P. Rebentrost, arXiv:1307.0411 (2013). · arXiv
  6. [18]S. Lloyd, M. Mohseni, and P. Rebentrost, arXiv:1307.0401 (2013). · arXiv
  7. [19]K.-R. M¨ uller, S. Mika, G. R¨ atsch, K. Tsuda, and B. Sch¨ olkopf, IEEE T. Neural Networ. 12 , 181 (2001).
  8. [23]S. Aaronson, arXiv:0910.4698 (2009). · arXiv
  9. [28]E. Liberty, F. Woolfe, P.-G. Martinsson, V. Rokhlin, and M. Tygert, Proc. Natl. Acad. Sci. USA 104 , 20167 (2007).
  10. [30]Z. Bar-Yossef, in Proc. 35th Annual ACM Symp. on Theory of Computing (2003).
  11. [31]N. Wiebe, A. Kapoor, and K. Svore, arXiv:1401.2142 (2014). · arXiv
  12. [32]G. D. Paparo, V. Dunjko, A. Makmal, M. A. Martin-Delgado, and H. J. Briegel, arXiv:1401.4997 (2014). · arXiv
  13. [33]C. Ding and X. He, in Proceedings of the 21st International Conference on Machine learning (2004).

Cited by

Sorted by citations

Authors
Rebentrost, P., Mohseni, M., & Lloyd, S.
Affiliations
  • Massachusetts Institute of Technology (US)
  • Google (United States) (US)
Venue
Physical Review Letters
Published
2014-09-25
Volume
113
Issue
13
Pages
130503-130503
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W2103956991
Cited by
1,951
References
30
Citations by year
2026: 229 · 2025: 306 · 2024: 274 · 2023: 277 · 2022: 205 · 2021: 208 · 2020: 151 · 2019: 105 · 2018: 77 · 2017: 54 · 2016: 45 · 2015: 13 · 2014: 7
FWCI
39.50
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • DSpace@MIT (Massachusetts Institute of Technology) (submittedVersion, cc-by-nc)
  • arXiv (Cornell University)
Funders
  • Defense Advanced Research Projects Agency (DARPA)
  • National Science Foundation (NSF)
  • Eni
  • Air Force Office of Scientific Research (AFOSR)
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 support vector machine, quantum machine learning, big data classification, binary classification, quantum advantage, matrix inversion, kernel matrix, quantum computing

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