Cited by 69Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography

Machine learning phase transitions with a quantum processor

Open access
Uvarov, A. V., Kardashin, A. S., Biamonte, J. D.·2020·Physical Review A

Abstract

Machine learning has emerged as a promising approach to unveil properties of many-body systems. Recently proposed as a tool to classify phases of matter, the approach relies on classical simulation methods---such as Monte Carlo---which are known to experience an exponential slowdown when simulating certain quantum systems. To overcome this slowdown while still leveraging machine learning, we propose a variational quantum algorithm which merges quantum simulation and quantum machine learning to classify phases of matter. Our classifier is directly fed labeled states recovered by the variational quantum eigensolver algorithm, thereby avoiding the data-reading slowdown experienced in many applications of quantum enhanced machine learning. We propose families of variational ansatz states that are inspired directly by tensor networks. This allows us to use tools from tensor network theory to explain properties of the phase diagrams the presented quantum algorithm recovers. Finally, we propose a majority vote quantum classifier built from a nearest-neighbor (checkerboard) quantum neural network. This classifier is successfully trained to recognize phases of matter with 99% accuracy for the transverse field Ising model and 94% accuracy for the $XXZ$ model. These findings suggest that a merger between quantum simulation and quantum enhanced machine learning offers a fertile ground to develop computational insights into quantum systems.

Integrity signals

Registry

Crossref · 10.1103/physreva.102.012415

Cites

37 of 37 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

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?

  • Several quantum machine learning algorithms based on parameterized quantum circuits have demonstrated superior performance and computational abilities compared to conventional algorithms.

    “Several QML algorithms based on PQC have been proposed [21–27], demonstrating superior performance and computational abilities compared to conventional algorithms [28–31].”

    From Medical image diagnosis based on adaptive Hybrid Quantum CNN (2023) · cites this paper as [27]

Cites

Flagged first, then by citations

1 of the 38 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Uvarov, A. V., Kardashin, A. S., & Biamonte, J. D.
Affiliations
Skolkovo Institute of Science and Technology (RU)
Venue
Physical Review A
Published
2020-07-15
Volume
102
Issue
1
ISSN
  • 0556-2791 (ISSN-L)
  • 2469-9926
  • 2469-9934
OpenAlex
W2955078219
Cited by
69
References
38
Citations by year
2026: 3 · 2025: 8 · 2024: 12 · 2023: 11 · 2022: 17 · 2021: 11 · 2020: 7
FWCI
4.52
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
Russian Foundation for Basic Research (19-31-90159)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
phase transitions, quantum machine learning, variational quantum eigensolver, variational ansatz, tensor networks, quantum neural networks, transverse-field Ising model, XXZ model, quantum simulation

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