Cited by 51Quantum Computing Algorithms and ArchitectureMetaheuristic Optimization Algorithms ResearchQuantum Information and Cryptography

Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement

Open access
Braine, Lee, Egger, Daniel J., Glick, Jennifer, Woerner, Stefan·2021·IEEE Transactions on Quantum Engineering

Abstract

In this article, we extend variational quantum optimization algorithms for quadratic unconstrained binary optimization problems to the class of mixed binary optimization problems. This allows us to combine binary decision variables with continuous decision variables, which, for instance, enables the modeling of inequality constraints via slack variables. We propose two heuristics and introduce the transaction settlement problem to demonstrate them. Transaction settlement is defined as the exchange of securities and cash between parties and is crucial to financial market infrastructure. We test our algorithms using classical simulation as well as real quantum devices provided by IBM quantum.

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.1109/tqe.2021.3063635

Cites

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

  • The class of treatable problems of VQAs has been extended to Mixed Binary Optimization (MBO) problems using appropriate problem formulations.

    “Additionally, the class of treatable problems of VQAs has been extended to Mixed Binary Optimization (MBO) problems using appropriate problem formulations [20].”

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

  1. D. J. Egger, J. Marecek, and S. Woerner, "Warm-starting quantum opti- mization," 2020, arXiv:2009.10095. · arXiv

Cited by

Sorted by citations

Authors
Braine, L., Egger, D. J., Glick, J., & Woerner, S.
Affiliations
  • Barclays (United Kingdom) (GB)
  • IBM Research - Zurich (CH)
  • IBM (United States) (US)
Venue
IEEE Transactions on Quantum Engineering
Published
2021
Volume
2
Pages
1-8
ISSN
2689-1808 (ISSN-L)
OpenAlex
W2979770774
Cited by
51
References
40
Citations by year
2026: 1 · 2025: 6 · 2024: 8 · 2023: 17 · 2022: 8 · 2021: 8 · 2020: 2 · 2019: 1
FWCI
3.62
Type
journal article
Language
en
Open access
Locations
  • IEEE Transactions on Quantum Engineering (publishedVersion, cc-by)
  • arXiv (Cornell University) (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
  • arXiv (Cornell University)
Funders
  • International Business Machines Corporation
  • Barclays
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
quantum algorithms, QUBO, variational quantum optimization, transaction settlement, inequality constraints, slack variables, financial market infrastructure, heuristics

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