Quantum Algorithms for Mixed Binary Optimization applied to Transaction Settlement

Abstract

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 the IBM Quantum Computation Center.

8 pages, 5 figures

References in corpus (24)

• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• A variational eigenvalue solver on a quantum processor
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Ising formulations of many NP problems
• A Quantum Approximate Optimization Algorithm
• From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
• Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices
• Robustness of adiabatic quantum computation
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
• QAOA for Max-Cut requires hundreds of qubits for quantum speed-up
• Quantum Risk Analysis
• Warm-starting quantum optimization
• Quantum computational finance: Monte Carlo pricing of financial derivatives
• Reverse Quantum Annealing Approach to Portfolio Optimization Problems
• Improving Variational Quantum Optimization using CVaR
• Option Pricing using Quantum Computers
• Performance of hybrid quantum/classical variational heuristics for combinatorial optimization
• Gate-efficient simulation of molecular eigenstates on a quantum computer
• Characterization of a two-transmon processor with individual single-shot qubit readout
• Multistart Methods for Quantum Approximate Optimization
• Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets
• Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer
• Bridging Classical and Quantum with SDP initialized warm-starts for QAOA

Cited by in corpus (15)

• Warm-starting quantum optimization
• Challenges and Opportunities in Quantum Optimization
• Grover Adaptive Search for Constrained Polynomial Binary Optimization
• Scaling of the quantum approximate optimization algorithm on superconducting qubit based hardware
• Simultaneous Perturbation Stochastic Approximation of the Quantum Fisher Information
• Challenges of variational quantum optimization with measurement shot noise
• Minimum quantum run-time characterization and calibration via restless measurements with dynamic repetition rates
• Quantum Computing Techniques for Multi-Knapsack Problems
• Efficient Hamiltonian Simulation for Solving Option Price Dynamics
• Solving Multi-Coloring Combinatorial Optimization Problems Using Hybrid Quantum Algorithms
• Quantum Computing for Software Engineering: Prospects
• Approaching Collateral Optimization for NISQ and Quantum-Inspired Computing
• Exponential Qubit Reduction in Optimization for Financial Transaction Settlement
• Hybrid Quantum-Classical Multi-cut Benders Approach with a Power System Application
• A Quantum Model for Constrained Markowitz Modern Portfolio Using Slack Variables to Process Mixed-Binary Optimization under QAOA