Toward Quantum Enabled Solutions for Real-Time Currency Arbitrage in Financial Markets

• URL: http://arxiv.org/abs/2509.09289v2
• Date: Fri, 31 Oct 2025 05:18:12 GMT
• Title: Toward Quantum Enabled Solutions for Real-Time Currency Arbitrage in Financial Markets
• Authors: Suman Kumar Roy, Rahul Rana, M Girish Chandra, Nishant Kumar, Manoj Nambiar,
• Abstract summary: Currency arbitrage involves multiple trading, where short-lived price discrepancies require real-time, high-speed processing.<n>We formulate an enhanced mathematical model for the currency arbitrage problem by adding simple cycle preservation constraints.<n>Using real-world currency exchange data, we compare these methods in terms of both arbitrage profit and execution time.
• Score: 1.9219097639485534
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Currency arbitrage leverages price discrepancies in currency exchange rates across different currency pairs to gain risk-free profits. It involves multiple trading, where short-lived price discrepancies require real-time, high-speed processing of vast solution space, posing challenges for classical computing. In this work, we formulate an enhanced mathematical model for the currency arbitrage problem by adding simple cycle preservation constraints, which guarantee trading cycle validity and eliminate redundant or infeasible substructures. To solve this model, we use and benchmark various solvers, including Quantum Annealing (QA), gate-based quantum approaches such as Variational Quantum Algorithm with Adaptive Cost Encoding (ACE), as well as classical solvers such as Gurobi and classical meta heuristics such as Tabu Search (TS). We propose a classical multi-bit swap post-processing to improve the solution generated by ACE. Using real-world currency exchange data, we compare these methods in terms of both arbitrage profit and execution time, the two key performance metrics. Our results give insight into the current capabilities and limitations of quantum methods for real-time financial use cases.

Related papers

• Better LMO-based Momentum Methods with Second-Order Information [48.580700968416444]
  Hessian-Corrected Momentum (HCM) aims to improve momentum convergence rates.<n>Hessian-Corrected Momentum can adapt to the geometry of the problem and achieve a faster rate than traditional momentum.<n>We extend the Linear Minimization Oracle framework by integrating HCM, and provide convergence guarantees under relaxed smoothness and arbitrary norm settings.
  arXiv  Detail & Related papers  (2025-12-15T11:43:09Z)
• Large-scale portfolio optimization using Pauli Correlation Encoding [0.0]
  We show how a gate-based variational quantum algorithm can be applied to a real-world portfolio optimization problem.<n>Specifically, we address a problem involving over 250 variables, where the market graph representing a real stock market is iteratively partitioned into sub-portfolios of highly correlated assets.
  arXiv  Detail & Related papers  (2025-11-26T11:51:07Z)
• A competitive NISQ and qubit-efficient solver for the LABS problem [0.0]
  Pauli Correlation.<n>(PCE) has recently been introduced as a qubit-efficient approach to optimization problems within variational quantum algorithms.<n>We extend the PCE-based framework to solve the Low Autocorrelation Binary Sequences (LABS) problem.
  arXiv  Detail & Related papers  (2025-06-20T18:00:02Z)
• Pricing of European Calls with the Quantum Fourier Transform [0.0]
  We introduce and analyze a quantum algorithm for pricing European call options across a broad spectrum of asset models. We compare this novel algorithm with existing quantum algorithms for option pricing.
  arXiv  Detail & Related papers  (2024-04-22T12:03:49Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• Differential Evolution VQE for Crypto-currency Arbitrage. Quantum Optimization with many local minima [1.0377683220196872]
  We introduce a differential evolution (DE) optimization algorithm for Variational Quantum Eigensolver (VQE) using Qiskit framework. We elucidate the application of crypto-currency arbitrage using different VQEs. Our findings indicate that the proposed DE-based method effectively converges to the optimal solution in scenarios where other commonly used VQEs struggle to find the global minimum.
  arXiv  Detail & Related papers  (2023-08-02T20:58:24Z)
• Qubit efficient quantum algorithms for the vehicle routing problem on NISQ processors [48.68474702382697]
  Vehicle routing problem with time windows (VRPTW) is a common optimization problem faced within the logistics industry. In this work, we explore the use of a previously-introduced qubit encoding scheme to reduce the number of binary variables.
  arXiv  Detail & Related papers  (2023-06-14T13:44:35Z)
• Multiobjective variational quantum optimization for constrained problems: an application to Cash Management [45.82374977939355]
  We introduce a new method for solving optimization problems with challenging constraints using variational quantum algorithms. We test our proposal on a real-world problem with great relevance in finance: the Cash Management problem. Our empirical results show a significant improvement in terms of the cost of the achieved solutions, but especially in the avoidance of local minima.
  arXiv  Detail & Related papers  (2023-02-08T17:09:20Z)
• Unbalanced penalization: A new approach to encode inequality constraints of combinatorial problems for quantum optimization algorithms [42.29248343585333]
  We present an alternative method that does not require extra slack variables. We evaluate our approach on the traveling salesman problem, the bin packing problem, and the knapsack problem. This new approach can be used to solve problems with inequality constraints with a reduced number of resources.
  arXiv  Detail & Related papers  (2022-11-25T06:05:18Z)
• Quantum computational finance: martingale asset pricing for incomplete markets [69.73491758935712]
  We show that a variety of quantum techniques can be applied to the pricing problem in finance. We discuss three different methods that are distinct from previous works.
  arXiv  Detail & Related papers  (2022-09-19T09:22:01Z)
• Comparing Classical-Quantum Portfolio Optimization with Enhanced Constraints [0.0]
  We show how to add fundamental analysis to the portfolio optimization problem, adding in asset-specific and global constraints based on chosen balance sheet metrics. We analyze the current state-of-the-art algorithms for solving such a problem using D-Wave's Quantum Processor and compare the quality of the solutions obtained to commercially-available optimization software.
  arXiv  Detail & Related papers  (2022-03-09T17:46:32Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Dynamic Portfolio Optimization with Real Datasets Using Quantum Processors and Quantum-Inspired Tensor Networks [0.0]
  We tackle the problem of dynamic portfolio optimization, taking into account transaction costs and other possible constraints. We implement a number of quantum and quantum-inspired algorithms on different hardware platforms to solve its discrete formulation. We conclude that D-Wave Hybrid and Networks are able to handle the largest systems, where we do calculations up to 1272 fully-connected qubits.
  arXiv  Detail & Related papers  (2020-06-30T18:00:03Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.