Cited by 153Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyMetaheuristic Optimization Algorithms Research

Grover Adaptive Search for Constrained Polynomial Binary Optimization

Open access
Gilliam, Austin, Woerner, Stefan, Gonciulea, Constantin·2021·Quantum

Abstract

In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained Binary Optimization (QUBO) problems, as a special case. GAS can provide a quadratic speed-up for combinatorial optimization problems compared to brute force search. However, this requires the development of efficient oracles to represent problems and flag states that satisfy certain search criteria. In general, this can be achieved using quantum arithmetic, however, this is expensive in terms of Toffoli gates as well as required ancilla qubits, which can be prohibitive in the near-term. Within this work, we develop a way to construct efficient oracles to solve CPBO problems using GAS algorithms. We demonstrate this approach and the potential speed-up for the portfolio optimization problem, i.e. a QUBO, using simulation and experimental results obtained on real quantum hardware. However, our approach applies to higher-degree polynomial objective functions as well as constrained optimization problems.

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-2021-04-08-428

Cites

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

  • Within the gate-model domain, a further distinction can be made between VQAs, Grover-based approaches, and other gate-based approaches.

    “Within the gate-model domain, a further distinction can be made between VQAs, Grover-based approaches [52, 118], and other gate-based approaches that have been mentioned above, e.g., References [15, 16, 24, 94].”
  • An efficient way for the oracle construction within Grover Adaptive Search that may allow it to be run on NISQ devices has been proposed.

    “An efficient way for the oracle construction within this algorithm that may allow it to be run on NISQ devices has been proposed [52].”

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

Cited by

Sorted by citations

Authors
Gilliam, A., Woerner, S., & Gonciulea, C.
Affiliations
  • JPMorgan Chase & Co (United States) (US)
  • IBM Research - Zurich (CH)
Venue
Quantum
Published
2021-04-08
Volume
5
Pages
428
ISSN
2521-327X (ISSN-L)
OpenAlex
W2992763160
Cited by
153
References
44
Citations by year
2026: 22 · 2025: 40 · 2024: 33 · 2023: 23 · 2022: 15 · 2021: 14 · 2020: 6
FWCI
7.48
Type
journal article
Language
en
Open access
Locations
  • Quantum (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University) (cc-by)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
Keywords
QUBO, quantum oracle, quantum arithmetic, Toffoli gate, portfolio optimization, combinatorial optimization, quantum advantage, quantum computing hardware

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