The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Implementing a distance-based classifier with a quantum interference circuit
Open accessAbstract
Lately, much attention has been given to quantum algorithms that solve pattern recognition tasks in machine learning. Many of these quantum machine learning algorithms try to implement classical models on large-scale universal quantum computers that have access to non-trivial subroutines such as Hamiltonian simulation, amplitude amplification and phase estimation. We approach the problem from the opposite direction and analyse a distance-based classifier that is realised by a simple quantum interference circuit. After state preparation, the circuit only consists of a Hadamard gate as well as two single-qubit measurements, and computes the distance between data points in quantum parallel. We demonstrate the proof of principle using the IBM Quantum Experience and analyse the performance of the classifier with numerical simulations.
Overview
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.
Integrity signals
Registry
Cites
Statistics
Verification
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.
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?
The cited source says what the claim attributes to it.
In the citing paper
“Further, distance-based classifiers using quantum interference circuits have been proposed in (Schuld et al. , 2017).”
From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Schuld et al. , 2017
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
THE USE OF MULTIPLE MEASUREMENTS IN TAXONOMIC PROBLEMS
FISHER, R. A. (1936) · Annals of Eugenics · doi:10.1111/j.1469-1809.1936.tb02137.x · Cited by 15,227
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
Non-Parametric Estimation of a Multivariate Probability Density
Epanechnikov, V. A. (1969) · Theory of Probability and Its Applications · doi:10.1137/1114019 · Cited by 1,879
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
Quantum-Enhanced Machine Learning
Dunjko, V., Taylor, J. M., & Briegel, H. J. (2016) · Physical Review Letters · doi:10.1103/physrevlett.117.130501 · Cited by 460
Experimental Realization of a Quantum Support Vector Machine
Li, Z., Liu, X., Xu, N., & Du, J. (2015) · Physical Review Letters · doi:10.1103/physrevlett.114.140504 · Cited by 269
Commercialize quantum technologies in five years
Mohseni, M., Read, P., Neven, H., Boixo, S., Denchev, V., Babbush, R., Fowler, A., Smelyanskiy, V., & Martinis, J. (2017) · Nature · doi:10.1038/543171a · Cited by 268
Experimental Realization of Quantum Artificial Intelligence
Zhaokai, L., Xiaomei, L., Nanyang, X., & jiangfeng, D. (2014) · arXiv · doi:10.48550/arxiv.1410.1054 · Cited by 261
Research works printed but not linked: 9
- Kapoor Ashish, 2016, Advances In Neural Information Processing Systems (NIPS 2016), Barcelona, Spain, 29, 3999
- Benedetti Marcello, 2016, Quantum-assisted learning of graphical models with arbitrary connectivity
- Denchev Vasil, 2012, Proceedings of the 29th International Conference on Machine Learning, ICML, 863
- Wiebe Nathan, 2015, Quantum Inf. Comput., 15, 0318
- Aïmeur Esma, 2007, Proceedings of the 24th International Conference on Machine Learning, 1
- Aizerman A., 1964, Autom. Remote Control, 25, 821
- Schölkopf Bernhard, 2000, Proceedings of the 13th International Conference on Neural Information Processing Systems, 283
- Grover Lov, 2002, Creating superpositions that correspond to efficiently integrable probability distributions
- Chatterjee Rupak, 2017, Quantum Inf. Commun., 17, 1292
Cited by
Sorted by citations
Biamonte, J., Wittek, P., Pancotti, N., Rebentrost, P., Wiebe, N., & Lloyd, S. (2017) · Nature · doi:10.1038/nature23474 · Cited by 4,779
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-citationNoisy 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
Parameterized quantum circuits as machine learning models
Benedetti, M., Lloyd, E., Sack, S., & Fiorentini, M. (2019) · Quantum Science and Technology · doi:10.1088/2058-9565/ab4eb5 · Cited by 1,528
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,241
Metadata
- Authors
- Schuld, M., Fingerhuth, M., & Petruccione, F.
- Affiliations
- University of KwaZulu-Natal (ZA)
- Maastricht University (NL)
- National Institute for Theoretical Physics (ZA)
- Venue
- EPL (Europhysics Letters)
- Publisher
- IOP Publishing
- Published
- 2017-09-01
- Volume
- 119
- Issue
- 6
- Pages
- 60002
- ISSN
- 0295-5075 (ISSN-L)
- 1286-4854
- OpenAlex
- W2751668559
- Semantic Scholar
- 2770d683a8a63ed1d87e51ca73a8571e930269a7
- Cited by
- 285
- References
- 15
- Citations by year
- 2026: 20 · 2025: 24 · 2024: 45 · 2023: 57 · 2022: 30 · 2021: 37 · 2020: 35 · 2019: 15 · 2018: 16 · 2017: 6
- FWCI
- 11.76
- Type
- journal article
- Language
- en
- Open access
- bronze
- doi.org
- Licence
- Locations
- Europhysics Letters (EPL) (publishedVersion)
- arXiv (Cornell University) (submittedVersion)
- arXiv (Cornell University)
- Funders
- National Research Foundation
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
- Keywords
- quantum machine learning, distance-based classifiers, Hadamard gate, single-qubit measurement, quantum state preparation, pattern recognition, IBM Quantum Experience
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
