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

Tomography and generative training with quantum Boltzmann machines

Open access
Kieferová, Mária, Wiebe, Nathan·2017·Physical Review A

Abstract

The promise of quantum neural nets, which utilize quantum effects to model complex data sets, has made their development an aspirational goal for quantum machine learning and quantum computing in general. Here we provide methods of training quantum Boltzmann machines. Our work generalizes existing methods and provides additional approaches for training quantum neural networks that compare favorably to existing methods. We further demonstrate that quantum Boltzmann machines enable a form of partial quantum state tomography that further provides a generative model for the input quantum state. Classical Boltzmann machines are incapable of this. This verifies the long-conjectured connection between tomography and quantum machine learning. Finally, we prove that classical computers cannot simulate our training process in general unless $\text{BQP}=\text{BPP}$, provide lower bounds on the complexity of the training procedures and numerically investigate training for small nonstoquastic Hamiltonians.

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.1103/physreva.96.062327

Cites

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

  • A QBM outperformed classical Boltzmann machines in generative training to reproduce small Haar-random states.

    “(Kieferová and Wiebe, 2017) found that a QBMoutperformed classical Boltzmann machines in generative training to reproduce small Haar-random states.”

    From Noisy intermediate-scale quantum algorithms (2022) · cites this paper as Kieferová and Wiebe, 2017

    The Numerical Results (p. 4) report that the quantum model fit the generative-training data better than the classical model, but that comparison used noisy step-function data. The tomography results (p. 5) show that the QBM learned two-qubit Haar-random states; they do not compare its performance on those states with classical Boltzmann machines. The claim combines findings from two different tests. (LLM, conf=0.90)

    Experimental — accuracy not yet measured
  • Learning probabilistic generative models is in many cases an intractable task.

    “For example, learning probabilistic generative models is in many cases an intractable task, and quantum-assisted algorithms have been proposed for both gate-based 17,18 and quantum annealing devices.[19][20][21][22][23]”

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

  1. [4]Marcello Benedetti, John Realpe-G´ omez, Rupak Biswas, and Alejandro Perdomo-Ortiz. Estimation of effective temperatures in a quantum annealer and its impact in sampling applications: A case study towards deep learning applications. arXiv preprint arXiv:1510.07611 , 2015. · arXiv
  2. [9]Man-Hong Yung and Al´ an Aspuru-Guzik. A quantumquantum metropolis algorithm. Proceedings of the National Academy of Sciences , 109(3):754-759, 2012.

Cited by

Sorted by citations

Authors
Kieferová, M., & Wiebe, N.
Affiliations
  • University of Waterloo (CA)
  • Microsoft (United States) (US)
Venue
Physical Review A
Published
2017-12-22
Volume
96
Issue
6
ISSN
  • 0556-2791 (ISSN-L)
  • 2469-9926
  • 2469-9934
OpenAlex
W2579928628
Cited by
170
References
16
Citations by year
2026: 10 · 2025: 17 · 2024: 21 · 2023: 25 · 2022: 12 · 2021: 31 · 2020: 19 · 2019: 18 · 2018: 16 · 2017: 1
FWCI
8.69
Type
journal article
Language
en
Open access
Locations
  • Physical Review A (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
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
quantum Boltzmann machines, quantum neural networks, quantum state tomography, quantum machine learning, training complexity

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