CoChat

Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm

Open access
Lemieux, Jessica, Heim, Bettina, Poulin, David, Svore, Krysta, Troyer, Matthias · 2020 · Quantum
Cited by 53

The DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.

Abstract

We present a detailed circuit implementation of Szegedy's quantization of the Metropolis-Hastings walk. This quantum walk is usually defined with respect to an oracle. We find that a direct implementation of this oracle requires costly arithmetic operations. We thus reformulate the quantum walk, circumventing its implementation altogether by closely following the classical Metropolis-Hastings walk. We also present heuristic quantum algorithms that use the quantum walk in the context of discrete optimization problems and numerically study their performances. Our numerical results indicate polynomial quantum speedups in heuristic settings.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.22331/q-2020-06-29-287

Cites

9 of 9 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 9 references

Cited by

See all 53

Metadata

Authors
Lemieux, J., Heim, B., Poulin, D., Svore, K., & Troyer, M.
Venue
Quantum
Published
2020-06-29
Volume
4
Pages
287
ISSN
2521-327X (ISSN-L)
OpenAlex
W2978019533
Cited by
53
References
9
FWCI
2.56
Type
journal article
Language
en
Open access
gold

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm. https://app.cochat.ai/papers/10.22331/q-2020-06-29-287
The paper
Lemieux, J., Heim, B., Poulin, D., Svore, K., & Troyer, M. (2020). Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm. Quantum. https://doi.org/10.22331/q-2020-06-29-287

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.