Quantum Algorithms for Mixed Binary Optimization Applied to Transaction Settlement

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.

[1]  Stefan Woerner,et al.  Quantum risk analysis , 2018, npj Quantum Information.

[2]  Rupak Biswas,et al.  From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz , 2017, Algorithms.

[3]  Prasanna Balaprakash,et al.  Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems , 2020, AAAI.

[4]  Leo Zhou,et al.  Quantum Approximate Optimization Algorithm: Performance, Mechanism, and Implementation on Near-Term Devices , 2018, Physical Review X.

[5]  Christoph Hellings,et al.  Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets , 2020 .

[6]  M. W. Johnson,et al.  Quantum annealing with manufactured spins , 2011, Nature.

[7]  Umesh V. Vazirani,et al.  Quantum complexity theory , 1993, STOC.

[8]  Miss A.O. Penney.  (b) , 1974, The New Yale Book of Quotations.

[9]  Davide Venturelli,et al.  Reverse quantum annealing approach to portfolio optimization problems , 2018, Quantum Machine Intelligence.

[10]  W. Marsden.  I and J , 2012 .

[11]  Giacomo Nannicini,et al.  Performance of hybrid quantum/classical variational heuristics for combinatorial optimization , 2018, Physical review. E.

[12]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[13]  Jakub Marecek,et al.  Warm-starting quantum optimization , 2021, Quantum.

[14]  J. Gambetta,et al.  Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets , 2017, Nature.

[15]  Alán Aspuru-Guzik,et al.  A variational eigenvalue solver on a photonic quantum processor , 2013, Nature Communications.

[16]  Thomas R. Bromley,et al.  Quantum computational finance: Monte Carlo pricing of financial derivatives , 2018, Physical Review A.

[17]  E. Farhi,et al.  A Quantum Approximate Optimization Algorithm , 2014, 1411.4028.

[18]  D. Pekker,et al.  Simulating the dynamics of braiding of Majorana zero modes using an IBM quantum computer , 2020, Physical Review Research.

[19]  Gian Giacomo Guerreschi,et al.  QAOA for Max-Cut requires hundreds of qubits for quantum speed-up , 2018, Scientific Reports.

[20]  Bridging Classical and Quantum with SDP initialized warm-starts for QAOA , 2020, 2010.14021.

[21]  Andrew Lucas,et al.  Ising formulations of many NP problems , 2013, Front. Physics.

[22]  D. Bacon,et al.  Quantum approximate optimization of non-planar graph problems on a planar superconducting processor , 2020, Nature Physics.

[23]  Giacomo Nannicini,et al.  Improving Variational Quantum Optimization using CVaR , 2019, Quantum.

[24]  Frederic T. Chong,et al.  Optimized Quantum Compilation for Near-Term Algorithms with OpenPulse , 2020, 2020 53rd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO).

[25]  Andrew M. Childs,et al.  Robustness of adiabatic quantum computation , 2001, quant-ph/0108048.

[26]  Yue Sun,et al.  Option Pricing using Quantum Computers , 2019, Quantum.

[27]  Kurunathan Ratnavelu,et al.  FRONTIERS IN PHYSICS , 2009 .

[28]  Stefan Woerner,et al.  Credit Risk Analysis Using Quantum Computers , 2019, IEEE Transactions on Computers.

[29]  P Bertet,et al.  Characterization of a two-transmon processor with individual single-shot qubit readout. , 2012, Physical review letters.

[30]  Ivano Tavernelli,et al.  Gate-Efficient Simulation of Molecular Eigenstates on a Quantum Computer , 2018, Physical Review Applied.

[31]  Susana Gomez,et al.  Advances in Optimization and Numerical Analysis , 1994 .

[32]  Markus Brink,et al.  Demonstration of quantum volume 64 on a superconducting quantum computing system , 2020, Quantum Science and Technology.

[33]  Ilya Safro,et al.  Multistart Methods for Quantum Approximate optimization , 2019, 2019 IEEE High Performance Extreme Computing Conference (HPEC).