Cited by 718Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Data re-uploading for a universal quantum classifier

Open access
Pérez-Salinas, Adrián, Cervera-Lierta, Alba, Gil-Fuster, Elies, Latorre, José I.·2020·Quantum

Abstract

A single qubit provides sufficient computational capabilities to construct a universal quantum classifier when assisted with a classical subroutine. This fact may be surprising since a single qubit only offers a simple superposition of two states and single-qubit gates only make a rotation in the Bloch sphere. The key ingredient to circumvent these limitations is to allow for multiple data re-uploading . A quantum circuit can then be organized as a series of data re-uploading and single-qubit processing units. Furthermore, both data re-uploading and measurements can accommodate multiple dimensions in the input and several categories in the output, to conform to a universal quantum classifier. The extension of this idea to several qubits enhances the efficiency of the strategy as entanglement expands the superpositions carried along with the classification. Extensive benchmarking on different examples of the single- and multi-qubit quantum classifier validates its ability to describe and classify complex data.

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.22331/q-2020-02-06-226

Cites

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

  • The tensor network structure of quantum mechanics has inspired classical machine learning methods.

    “Interestingly, the tensor network structure of quantum mechanics has even inspired classical machine learning methods [159].”

    From Variational quantum algorithms (2021) · cites this paper as [159]

    The Introduction and §2.1 describe quantum classifiers inspired by classical neural networks, while §6.5 compares the proposed classifier with classical methods. Searches for tensor networks and quantum-inspired classical methods found no passage in our copy addressing the claimed direction of influence. (LLM, conf=0.76)

    Experimental — accuracy not yet measured

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: 4

  1. E. Farhi and H. Neven, "Classification with quan- tum neural networks on near term processors," (2018), arXiv:1802.06002 [quant-ph] . · arXiv
  2. C. W. Helstrom, Quantum detection and estima- tion theory / Carl W. Helstrom (Academic Press New York, 1976) pp. ix, p. : 309.
  3. M. A. Nielsen, Neural networks and deep learn- ing, Vol. 25 (Determination press USA, 2015).
  4. F. Pedregosa, G. Varoquaux, A. Gramfort, V. Michel, B. Thirion, O. Grisel, M. Blondel, P. Prettenhofer, R. Weiss, V. Dubourg, J. Van- derplas, A. Passos, D. Cournapeau, M. Brucher, M. Perrot, and E. Duchesnay, Journal of Ma- chine Learning Research 12, 2825 (2011).

Cited by

Sorted by citations

Authors
Pérez-Salinas, A., Cervera-Lierta, A., Gil-Fuster, E., & Latorre, J. I.
Affiliations
  • Barcelona Supercomputing Center (ES)
  • Universitat de Barcelona (ES)
  • Centre for Quantum Technologies (SG)
Venue
Quantum
Published
2020-02-06
Volume
4
Pages
226
ISSN
2521-327X (ISSN-L)
OpenAlex
W2954939433
Cited by
713
References
18
Citations by year
2026: 204 · 2025: 167 · 2024: 121 · 2023: 93 · 2022: 61 · 2021: 57 · 2020: 10
FWCI
21.70
Type
journal article
Language
en
Open access
Locations
  • Quantum (publishedVersion, cc-by)
  • LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas) (acceptedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • National University of Singapore (submittedVersion, cc-by)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • UPCommons institutional repository (Universitat Politècnica de Catalunya) (submittedVersion, cc-by)
  • arXiv (Cornell University) (cc-by)
  • Bulletin of the American Physical Society
Funders
  • QuantIC
  • Barcelona Supercomputing Center
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 Mechanics and Applications
Keywords
quantum machine learning, quantum classifiers, data re-uploading, multiqubit entanglement, quantum circuit design, multi-class classification, benchmarking

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