Improving the Efficiency of Payments Systems Using Quantum Computing

arXiv2209.15392MaRDI QIDQ6412464FDOQ6412464

Authors: Christopher McMahon, Donald McGillivray, Ajit Desai, Francisco Rivadeneyra, Jean-Paul Lam, Thomas Lo, Danica Marsden, Vladimir Skavysh

Publication date: 19 September 2022

Abstract: High-value payment systems (HVPSs) are typically liquidity-intensive as the payment requests are indivisible and settled on a gross basis. Finding the right order in which payments should be processed to maximize the liquidity efficiency of these systems is an

N P

-hard combinatorial optimization problem, which quantum algorithms may be able to tackle at meaningful scales. We developed an algorithm and ran it on a hybrid quantum annealing solver to find an ordering of payments that reduced the amount of system liquidity necessary without substantially increasing payment delays. Despite the limitations in size and speed of today's quantum computers, our algorithm provided quantifiable efficiency improvements when applied to the Canadian HVPS using a 30-day sample of transaction data. By reordering each batch of 70 payments as they entered the queue, we achieved an average of C

240 m i l l i o n i n d a i l y l i q u i d i t y s a v i n g s, w i t h a s e t t l e m e n t d e l a y o f a p p r o x i m a t e l y 90 s e c o n d s . F o r a f e w d a y s i n t h e s a m p l e, t h e l i q u i d i t y s a v i n g s e x c e e d e d C

1 billion. This algorithm could be incorporated as a centralized preprocessor into existing HVPS without entailing a fundamental change to their risk management models.

This page was built for publication: Improving the Efficiency of Payments Systems Using Quantum Computing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6412464)