Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement
Lee Braine, Daniel J. Egger, Jennifer Glick and 1 more
IEEE Transactions on Quantum Engineering · 2021
doi:10.1109/tqe.2021.3063635 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
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.
Abstract licence: CC BY-NC-ND
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.