Improving the Efficiency of Payments Systems Using Quantum Computing

Christopher McMahon (), Donald McGillivray (), Ajit Desai, Francisco Rivadeneyra (), Jean-Paul Lam, Thomas Lo (), Danica Marsden () and Vladimir Skavysh ()
Additional contact information
Christopher McMahon: GoodLabs Studio, Toronto, Ontario M5H 3E5, Canada
Donald McGillivray: GoodLabs Studio, Toronto, Ontario M5H 3E5, Canada
Francisco Rivadeneyra: Banking and Payments, Bank of Canada, Ottawa, Ontario K1A 0G9, Canada
Thomas Lo: GoodLabs Studio, Toronto, Ontario M5H 3E5, Canada
Danica Marsden: Banking and Payments, Bank of Canada, Ottawa, Ontario K1A 0G9, Canada
Vladimir Skavysh: Banking and Payments, Bank of Canada, Ottawa, Ontario K1A 0G9, Canada

Management Science, 2024, vol. 70, issue 10, 7325-7341

Abstract: High-value payment systems (HVPSs) are typically liquidity intensive because payments are settled on a gross basis. State-of-the-art solutions to this problem include algorithms that seek netting sets and allow for ad hoc reordering of submitted payments. This paper introduces a new algorithm that explores the entire space of payments reordering to improve the liquidity efficiency of these systems without significantly increasing payment delays. Finding the optimal payment order among the entire space of reorderings is, however, an NP-hard combinatorial optimization problem. We solve this problem using a hybrid quantum annealing algorithm. Despite the limitations in size and speed of today’s quantum computers, our algorithm provides quantifiable liquidity savings when applied to the Canadian HVPS using a 30-day sample of transaction data. By reordering batches of 70 payments, we achieve an average of Canadian (C) $240 million in daily liquidity savings, with a settlement delay of approximately 90 seconds. For a few days in the sample, the liquidity savings exceed C$1 billion. Compared with classical computing and with current algorithms in HVPS, our quantum algorithm offers larger liquidity savings, and it offers more reliable and consistent solutions, particularly under time constraints.

Keywords: quantum algorithm; combinatorial optimization; NP hard; high-value payments system (search for similar items in EconPapers)
Date: 2024
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/mnsc.2023.00314 (application/pdf)

Related works:
Working Paper: Improving the Efficiency of Payments Systems Using Quantum Computing (2022)
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ormnsc:v:70:y:2024:i:10:p:7325-7341

Access Statistics for this article

More articles in Management Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().