High-value payment systems (HVPSs) are typically liquidity-intensive because 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 NP-hard combinatorial optimization problem, which quantum algorithms may be able to tackle at meaningful scales. We develop an algorithm and run it on a hybrid quantum annealing solver to find an ordering of payments that reduces...