Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing (May 2023)
Open Access
- 13 September 2023
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Quantum Engineering
- Vol. 4, 1-18
Abstract
Collateral optimization refers to the systematic allocation of financial assets to satisfy obligations or secure transactions, while simultaneously minimizing costs and optimizing the usage of available resources. This involves assessing number of characteristics, such as cost of funding and quality of the underlying assets to ascertain the optimal collateral quantity to be posted to cover exposure arising from a given transaction or a set of transactions. One of the common objectives is to minimise the cost of collateral required to mitigate the risk associated with a particular transaction or a portfolio of transactions while ensuring sufficient protection for the involved parties. Often, this results in a large-scale combinatorial optimization problem. In this study, we initially present a Mixed Integer Linear Programming (MILP) formulation for the collateral optimization problem, followed by a Quadratic Unconstrained Binary optimization (QUBO) formulation in order to pave the way towards approaching the problem in a hybrid-quantum and NISQ-ready way. We conduct local computational small-scale tests using various Software Development Kits (SDKs) and discuss the behavior of our formulations as well as the potential for performance enhancements. We find that while the QUBO based approaches fail to find the global optima in the small scale experiments, they are reasonably close suggesting their potential for large instances. We further survey the recent literature that proposes alternative ways to attack combinatorial optimization problems suitable for collateral optimization.Keywords
All Related Versions
This publication has 88 references indexed in Scilit:
- Solving the optimal trading trajectory problem using a quantum annealer2015
- Ising formulations of many NP problemsFrontiers in Physics, 2014
- Tensor Network States and GeometryJournal of Statistical Physics, 2011
- Quantum computersNature, 2010
- Handbook of Approximation Algorithms and MetaheuristicsThe Computer Journal, 2010
- A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete ProblemScience, 2001
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programmingJournal of the ACM, 1995
- Quantum annealing: A new method for minimizing multidimensional functionsChemical Physics Letters, 1994
- Quantum stochastic optimizationStochastic Processes and their Applications, 1989
- Simulated annealing1987