Quantum discriminant analysis for dimensionality reduction and classification
Open accessThe DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Abstract
We present quantum algorithms to efficiently perform discriminant analysis for dimensionality reduction and classification over an exponentially large input data set. Compared with the best-known classical algorithms, the quantum algorithms show an exponential speedup in both the number of training vectors M and the feature space dimension N . We generalize the previous quantum algorithm for solving systems of linear equations (2009 Phys. Rev. Lett. 103 150502 ) to efficiently implement a Hermitian chain product of k trace-normalized N × N Hermitian positive-semidefinite matrices with time complexity of . Using this result, we perform linear as well as nonlinear Fisher discriminant analysis for dimensionality reduction over M vectors, each in an N -dimensional feature space, in time , where denotes the tolerance error, and p is the number of principal projection directions desired. We also present a quantum discriminant analysis algorithm for data classification with time complexity .
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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum Computation and Quantum Information: 10th Anniversary Edition
Nielsen, M. A., & Chuang, I. L. (2012) · doi:10.1017/cbo9780511976667 · Cited by 8,436
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
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
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×
“[2, 4, 5], we will assume we have quantum access to the training vector data in a quantum RAM (as described in [10]).”
MethodQuantum Computer Science: An Introduction
Mermin, N. D. (2007) · doi:10.1017/cbo9780511813870 · Cited by 592
Cited by
A rigorous and robust quantum speed-up in supervised machine learning
Liu, Y., Arunachalam, S., & Temme, K. (2021) · Nature Physics · doi:10.1038/s41567-021-01287-z · Cited by 649
Various dimension reduction techniques for high dimensional data analysis: a review
Ray, P., Reddy, S. S., & Banerjee, T. (2021) · Artificial Intelligence Review · doi:10.1007/s10462-020-09928-0 · Cited by 272
A quantum deep convolutional neural network for image recognition
Li, Y., Zhou, R.-G., Xu, R., Luo, J., & Hu, W. (2020) · Quantum Science and Technology · doi:10.1088/2058-9565/ab9f93 · Cited by 225
Hamiltonian simulation with optimal sample complexity
Kimmel, S., Lin, C. Y.-Y., Low, G. H., Ozols, M., & Yoder, T. J. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0013-7 · Cited by 85
“The LMR protocol has applications to many problems in machine learning, e.g. [LMR14, Wan14, RML14, CD15].”
Method
Metadata
- Authors
- Cong, I., & Duan, L.
- Venue
- New Journal of Physics
- Publisher
- IOP Publishing
- Published
- 2016-07-06
- Volume
- 18
- Issue
- 7
- Pages
- 073011
- ISSN
- 1367-2630 (ISSN-L)
- OpenAlex
- W2227200015
- Cited by
- 132
- References
- 7
- FWCI
- 4.98
- Type
- journal article
- Language
- en
- Open access
- gold
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Quantum discriminant analysis for dimensionality reduction and classification. https://app.cochat.ai/papers/10.1088/1367-2630/18/7/073011
- The paper
- Cong, I., & Duan, L. (2016). Quantum discriminant analysis for dimensionality reduction and classification. New Journal of Physics. https://doi.org/10.1088/1367-2630/18/7/073011
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.