Cited by 285Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum many-body systems

Implementing a distance-based classifier with a quantum interference circuit

Open access
Schuld, M., Fingerhuth, M., Petruccione, F.·2017·EPL (Europhysics Letters)

Abstract

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.

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.1209/0295-5075/119/60002

Cites

19 of 19 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?

  • Distance-based classifiers using quantum interference circuits have been proposed.

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

Cites

Flagged first, then by citations

Research works printed but not linked: 9

  1. Kapoor Ashish, 2016, Advances In Neural Information Processing Systems (NIPS 2016), Barcelona, Spain, 29, 3999
  2. Benedetti Marcello, 2016, Quantum-assisted learning of graphical models with arbitrary connectivity
  3. Denchev Vasil, 2012, Proceedings of the 29th International Conference on Machine Learning, ICML, 863
  4. Wiebe Nathan, 2015, Quantum Inf. Comput., 15, 0318
  5. Aïmeur Esma, 2007, Proceedings of the 24th International Conference on Machine Learning, 1
  6. Aizerman A., 1964, Autom. Remote Control, 25, 821
  7. Schölkopf Bernhard, 2000, Proceedings of the 13th International Conference on Neural Information Processing Systems, 283
  8. Grover Lov, 2002, Creating superpositions that correspond to efficiently integrable probability distributions
  9. Chatterjee Rupak, 2017, Quantum Inf. Commun., 17, 1292

Cited by

Sorted by citations

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)
Published
2017-09-01
Volume
119
Issue
6
Pages
60002
ISSN
  • 0295-5075 (ISSN-L)
  • 1286-4854
OpenAlex
W2751668559
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
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 › 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 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