CoChat

Resource efficient gadgets for compiling adiabatic quantum optimization problems

Open access
Babbush, Ryan, O'Gorman, Bryan, Aspuru‐Guzik, Alán · 2013 · Annalen der Physik
Cited by 33

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

Abstract

A resource efficient method by which the ground‐state of an arbitrary k‐local, optimization Hamiltonian can be encoded as the ground‐state of a ‐local, optimization Hamiltonian is developed. This result is important because adiabatic quantum algorithms are often most easily formulated using many‐body interactions but experimentally available interactions are generally 2‐body. In this context, the efficiency of a reduction gadget is measured by the number of ancilla qubits required as well as the amount of control precision needed to implement the resulting Hamiltonian. First, methods of applying these gadgets to obtain 2‐local Hamiltonians using the least possible number of ancilla qubits are optimized. Next, a novel reduction gadget which minimizes control precision and a heuristic which uses this gadget to compile 3‐local problems with a significant reduction in control precision are shown. Finally, numerics are presented which indicate a substantial decrease in the resources required to implement randomly generated, 3‐body optimization Hamiltonians when compared to other methods in the literature.

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.1002/andp.201300120

Cites

7 of 7 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 7 references

Cited by

See all 33

Metadata

Authors
Babbush, R., O'Gorman, B., & Aspuru‐Guzik, A.
Venue
Annalen der Physik
Publisher
Wiley
Published
2013-09-03
Volume
525
Issue
10-11
Pages
877-888
ISSN
  • 0003-3804 (ISSN-L)
  • 1521-3889
OpenAlex
W2107604137
Cited by
33
References
7
FWCI
4.05
Type
journal article
Language
en
Open access
green

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: Resource efficient gadgets for compiling adiabatic quantum optimization problems. https://app.cochat.ai/papers/10.1002/andp.201300120
The paper
Babbush, R., O'Gorman, B., & Aspuru‐Guzik, A. (2013). Resource efficient gadgets for compiling adiabatic quantum optimization problems. Annalen der Physik. https://doi.org/10.1002/andp.201300120

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.