The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Prediction by linear regression on a quantum computer
Open accessAbstract
We give an algorithm for prediction on a quantum computer which is based on a linear regression model with least-squares optimization. In contrast to related previous contributions suffering from the problem of reading out the optimal parameters of the fit, our scheme focuses on the machine-learning task of guessing the output corresponding to a new input given examples of data points. Furthermore, we adapt the algorithm to process nonsparse data matrices that can be represented by low-rank approximations, and significantly improve the dependency on its condition number. The prediction result can be accessed through a single-qubit measurement or used for further quantum information processing routines. The algorithm's runtime is logarithmic in the dimension of the input space provided the data is given as quantum information as an input to the routine.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Pattern Recognition and Machine Learning
(2006) · doi:10.1007/978-0-387-45528-0 · Cited by 9,824
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
Trefethen, L. N., & Bau, III (1997) · doi:10.1137/1.9780898719574 · Cited by 3,301
Singular value decomposition and least squares solutions
Golub, G. H., & Reinsch, C. (1970) · Numerische Mathematik · doi:10.1007/bf02163027 · Cited by 2,929 · cited 1×
“…matrix containing all training inputs as rows) and the target vector y = ( y (1) , ..., y ( M ) ) T , the least squares error becomes | Xw − y | 2 , and it is a widely used result [16] that the solution to the least squares problem is given by where X + is the Moore-Penrose pseudoinverse of X .”
Background(2008) · Choice Reviews Online · doi:10.5860/choice.45-5628 · Cited by 2,725
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · Cited by 2,376
Quantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
Computational Complexity: A Modern Approach
Arora, S., & Barak, B. (2009) · doi:10.1017/cbo9780511804090 · Cited by 1,690
Quantum principal component analysis
Lloyd, S., Mohseni, M., & Rebentrost, P. (2014) · Nature Physics · doi:10.1038/nphys3029 · Cited by 1,385
Giovannetti, V., Lloyd, S., & Maccone, L. (2008) · Physical Review Letters · doi:10.1103/physrevlett.100.160501 · Cited by 935 · cited 1×
“…techniques for the efficient preparation of arbitrary initial quantum states are a nontrivial and still controversially discussed topic, although some ideas have been brought forward of how to prepare certain states linear in the number of qubits [20] or via quantum Random Access Memories [21].”
BackgroundAaronson, S. (2015) · Nature Physics · doi:10.1038/nphys3272 · Cited by 567
Quantum algorithms for supervised and unsupervised machine learning
Lloyd, S., Mohseni, M., & Rebentrost, P. (2013) · arXiv · doi:10.48550/arxiv.1307.0411 · Cited by 542
Quantum Algorithm for Data Fitting
Wiebe, N., Braun, D., & Lloyd, S. (2012) · Physical Review Letters · doi:10.1103/physrevlett.109.050505 · Cited by 528
Preconditioned Quantum Linear System Algorithm
Clader, B. D., Jacobs, B. C., & Sprouse, C. R. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.250504 · Cited by 288
(2006) · Chapman & Hall/CRC eBooks · doi:10.1201/9781420010572 · Cited by 266
Creating superpositions that correspond to efficiently integrable probability distributions
Grover, L. K., & Rudolph, T. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0208112 · Cited by 221
Simulating a perceptron on a quantum computer
Schuld, M., Sinayskiy, I., & Petruccione, F. (2015) · Physics Letters A · doi:10.1016/j.physleta.2014.11.061 · Cited by 162
Self-citationQuantum-assisted Gaussian process regression
Zhao, Z., Fitzsimons, J., & Fitzsimons, J. F. (2019) · Physical Review A · doi:10.1103/physreva.99.052331 · Cited by 140
Bayesian network structure learning using quantum annealing
O’Gorman, B., Babbush, R., Perdomo‐Ortiz, A., Aspuru‐Guzik, A., & Smelyanskiy, V. (2015) · The European Physical Journal Special Topics · doi:10.1140/epjst/e2015-02349-9 · Cited by 105
Quantum Algorithms for Curve Fitting.Preprint
Wang, G. (2014) · arXiv (Cornell University) · Cited by 7
Cited by
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
Noisy intermediate-scale quantum algorithms
Bharti, K., Cervera-Lierta, A., Kyaw, T. H., Haug, T., Alperin-Lea, S., Anand, A., Degroote, M., Heimonen, H., Kottmann, J. S., Menke, T., et al. (2022) · Reviews of Modern Physics · doi:10.1103/revmodphys.94.015004 · Cited by 2,231
Quantum Machine Learning in Feature Hilbert Spaces
Schuld, M., & Killoran, N. (2019) · Physical Review Letters · doi:10.1103/physrevlett.122.040504 · Cited by 1,840
Self-citationMitarai, K., Negoro, M., Kitagawa, M., & Fujii, K. (2018) · Physical Review A · doi:10.1103/physreva.98.032309 · Cited by 1,639
Machine learning & artificial intelligence in the quantum domain: a review of recent progress
Dunjko, V., & Briegel, H. J. (2018) · Reports on Progress in Physics · doi:10.1088/1361-6633/aab406 · Cited by 1,055
Metadata
- Authors
- Schuld, M., Sinayskiy, I., & Petruccione, F.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2016-08-30
- Volume
- 94
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 2469-9926
- 2469-9934
- OpenAlex
- W2489886790
- Cited by
- 274
- References
- 21
- FWCI
- 17.15
- Type
- journal article
- Language
- en
- Open access
- green
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.