Quantum learning and universal quantum matching machine
Open accessThe DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Abstract
Suppose that three kinds of quantum systems are given in some unknown states $|f{〉}^{\ensuremath{\bigotimes}N},$ $|{g}_{1}{〉}^{\ensuremath{\bigotimes}K},$ and $|{g}_{2}{〉}^{\ensuremath{\bigotimes}K},$ and we want to decide which template state $|{g}_{1}〉$ or $|{g}_{2}〉,$ each representing the feature of the pattern class ${\mathcal{C}}_{1}$ or ${\mathcal{C}}_{2},$ respectively, is closest to the input feature state $|f〉.$ This is an extension of the pattern matching problem into the quantum domain. Assuming that these states are known a priori to belong to a certain parametric family of pure qubit systems, we derive two kinds of matching strategies. The first one is a semiclassical strategy that is obtained by the natural extension of conventional matching strategies and consists of a two-stage procedure: identification (estimation) of the unknown template states to design the classifier (learning process to train the classifier) and classification of the input system into the appropriate pattern class based on the estimated results. The other is a fully quantum strategy without any intermediate measurement, which we might call as the universal quantum matching machine. We present the Bayes optimal solutions for both strategies in the case of $K=1,$ showing that there certainly exists a fully quantum matching procedure that is strictly superior to the straightforward semiclassical extension of the conventional matching strategy based on the learning process.
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
Probabilistic and Statistical Aspects of Quantum Theory
Holevo, A. (2011) · doi:10.1007/978-88-7642-378-9 · Cited by 2,582
Quantum Theory: Concepts and Methods
Peres, A., & Ballentine, L. E. (1995) · American Journal of Physics · doi:10.1119/1.17946 · Cited by 2,561
A New Proof of the Quantum Noiseless Coding Theorem
Jozsa, R., & Schumacher, B. (1994) · Journal of Modern Optics · doi:10.1080/09500349414552191 · Cited by 304
Cited by
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
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
Training deep quantum neural networks
Beer, K., Bondarenko, D., Farrelly, T., Osborne, T. J., Salzmann, R., Scheiermann, D., & Wolf, R. (2020) · Nature Communications · doi:10.1038/s41467-020-14454-2 · Cited by 726
Quantum generalisation of feedforward neural networks
Wan, K. H., Dahlsten, O., Kristjánsson, H., Gardner, R., & Kim, M. S. (2017) · npj Quantum Information · doi:10.1038/s41534-017-0032-4 · Cited by 276
Quantum Machine Learning: A Review and Case Studies
Zeguendry, A., Jarir, Z., & Quafafou, M. (2023) · Entropy · doi:10.3390/e25020287 · Cited by 197
“There are several applications for machine learning to distinguish either quantum states generated by a quantum source or manipulations carried out by a quantum experiment [50,51].”
Background
Metadata
- Authors
- Sasaki, M., & Carlini, A.
- Venue
- Physical Review A
- Publisher
- American Physical Society (APS)
- Published
- 2002-08-06
- Volume
- 66
- Issue
- 2
- ISSN
- 0556-2791 (ISSN-L)
- 1050-2947
- 1094-1622
- OpenAlex
- W2029583542
- Cited by
- 101
- References
- 3
- FWCI
- 2.01
- 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
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 learning and universal quantum matching machine. https://app.cochat.ai/papers/10.1103/physreva.66.022303
- The paper
- Sasaki, M., & Carlini, A. (2002). Quantum learning and universal quantum matching machine. Physical Review A. https://doi.org/10.1103/physreva.66.022303
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.