Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

IEEE International Conference on Smart Computing Workshops and Other Affiliated Events (SMARTCOMP Companion)

Solving Currency Arbitrage Problems using D-Wave Advantage2 Quantum Annealer

Lorenzo Mazzei, Giada Beccari, Mirko Laruina, Marco Cococcioni

Published Jun 1, 2026• 0 citations
Publisher

Abstract

Quantum annealing has emerged as a powerful tool for solving combinatorial optimization problems efficiently, making use of the principles of quantum mechanics. Companies are increasingly investing in the market of quantum computers, providing the users with the possibility to solve these optimization problems by resorting to quantum computers. This paper explores how Quantum Annealing can be applied to the Currency Arbitrage (CA) optimization problem and its comparative performance against classical methods. A key contribution of the work is an original formulation of the CA problem as a QUBO (Quadratic Unconstrained Boolean Optimization) problem. We test the speed of D-wave quantum annealer, using the recently released latest version (Advantage 2).

DOI
10.1109/smartcomp-companion70724.2026.00030

Related papers

Solving the Traveling Salesman Problem on the D-Wave Quantum Computer

Siddharth Jain

The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization. This paper shows how to solve it on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem. Results of practical experiments are also presented using D-Wave’s 5,000 qubit Advantage 1.1 quantum annealer and the performance is compared to a classical solver. It is found the quantum annealer can only handle a problem size of 8 or less nodes and its performance is subpar compared to the classical solver both in terms of time and accuracy.

Frontiers in Physics•Nov 12, 2021•56 citations

Resource-Efficient QUBO Formulation for Anchored Currency Arbitrage

Eric A. F. Reinhardt, Adam J. Hauser

Currency arbitrage (CA) involves trading currencies in cycles to exploit discrepancies in market valuations. Quadratic unconstrained binary optimization (QUBO) involves minimizing a quadratic cost (energy) function of binary variables. Previous works have explored the use of QUBO to solve CA problems. We build on these previous works by introducing realistic constraints such as beginning cycles from a held currency and accounting for per-transaction trading fees. We show that this formulation requires fewer logical variables (qubits) than previous QUBO encodings in the literature. We derive provably sufficient penalty weights for its constraint terms. We also introduce an exact anchor-gauge reweighting of the exchange rates that compresses the QUBO coefficient range from the rate scale to the arbitrage scale, addressing the finite analog precision of annealing hardware. We demonstrate the efficacy of this formulation using classical simulated annealing against an exact Held-Karp baseline on the same CPU and show that it can effectively find profitable cycles and account for trading fees. Finally, we benchmark faithful implementations of five prior QUBO encodings at matched sampler budgets and show that the proposed encoding is the only one to recover the exact fee-adjusted optimum.

quant-pharXiv:2608.15889•Aug 18, 2026•0 citations

Solving Optimization Problems Using Adiabatic Quantum Computing

Liu, Kai

The commercial D-Waves quantum annealer has given rise to plenty of interests due to the reported quantum speedup against classical annealing. In order to make use of this new technology, a problem must be formulated into a form of quadratic unconstrained binary optimization (QUBO) or Ising model. This thesis reports on case studies using a D-Wave quantum annealer to solve several optimization problems and providing results validation using classical exact approaches. In our thesis, we briefly introduce several classical techniques designed for QUBO problems and implement two exact approaches. With the proper tools, a D-Wave 2X computer consisted of 1098 active qubits is then evaluated for the Degree-Constrained Minimum Spanning Tree and the Steiner Tree problems, establishing their QUBO formulations are suitable for adiabatic quantum computers. Motivated by the remarkable performance, two more optimization problems are studied—the Bounded-Depth Steiner Tree problem and the Chromatic Sum problem. We propose a new formulation for each problem. The numbers of qubits (dimension of QUBO matrices) required by our formulations are O(|V|3) and O(|V|2) respectively, where |V| represents the number of vertices.

•Jan 1, 2018•0 citations

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

Suman Kumar Roy, Rahul Rana, M Girish Chandra +2 more

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.

arXiv:2509.09289•International Conference on AI-ML Systems (AIMLSystems)•Oct 8, 2025•4 citations

Efficient Combinatorial Optimization Using Quantum Annealing

Hristo N. Djidjev, Guillaume Chapuis, Georg Hahn +1 more

The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techniques. However, it is unclear if the current state of quantum computing already provides a quantum advantage over the current state of the art in classical computing. This article assesses the performance of the D-Wave 2X quantum annealer on two NP hard graph problems, in particular clique finding and graph partitioning. For this, we provide formulations as Qubo and Ising Hamiltonians suitable for the quantum annealer and compare a variety of quantum solvers (Sapi, QBSolv, QSage provided by D-Wave Sys, Inc.) to current classical algorithms (METIS, Simulated Annealing, third-party clique finding and graph splitting heuristics) on certain test sets of graphs. We demonstrate that for small graph instances, classical methods still outperform the quantum annealer in terms of computing time, even though the quality of the best solutions obtained is comparable. Nevertheless, due to the limited problem size which can be embedded on the D-Wave 2X chip, the aforementioned finding applies to most of problems of general nature solvable on the quantum annealer. For instances specifically designed to fit the D-Wave 2X architecture, we observe substantial speed-ups in computing time over classical approaches.

arXiv:1801.08653•Jan 26, 2018•65 citations

Benchmarking Quantum Computing for Combinatorial Optimization

Nathan Kittichaikoonkij, Nutthapat Pongtanyavichai, Poopha Suwananek +2 more

Quantum computers can be much faster than any classical computers in solving a certain class of problems. One of the interesting problems is the combinatorial optimization problem, which is a challenge for classical computer systems. We encode these problems into the Quadratic Unconstrained Binary Optimization (QUBO) format and then solve them with quantum solvers. In this study, we compare the performance of D-Wave’s quantum annealing system with classical solvers, namely, Gurobi and Fixstars. We demonstrate the current capabilities of the D-Wave system.

International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)•May 20, 2025•1 citation
Quantum annealing has emerged as a powerful tool for solving combinatorial optimization problems efficiently, making use of the principles of quantum mechanics. Companies are increasingly investing in the market of quantum computers, providing the users with the possibility to solve these optimization problems by resorting to quantum computers. This paper explores how Quantum Annealing can be applied to the Currency Arbitrage (CA) optimization problem and its comparative performance against classical methods. A key contribution of the work is an original formulation of the CA problem as a QUBO (Quadratic Unconstrained Boolean Optimization) problem. We test the speed of D-wave quantum annealer, using the recently released latest version (Advantage 2).
The traveling salesman problem is a well-known NP-hard problem in combinatorial optimization. This paper shows how to solve it on an Ising Hamiltonian based quantum annealer by casting it as a quadratic unconstrained binary optimization (QUBO) problem. Results of practical experiments are also presented using D-Wave’s 5,000 qubit Advantage 1.1 quantum annealer and the performance is compared to a classical solver. It is found the quantum annealer can only handle a problem size of 8 or less nodes and its performance is subpar compared to the classical solver both in terms of time and accuracy.
Currency arbitrage (CA) involves trading currencies in cycles to exploit discrepancies in market valuations. Quadratic unconstrained binary optimization (QUBO) involves minimizing a quadratic cost (energy) function of binary variables. Previous works have explored the use of QUBO to solve CA problems. We build on these previous works by introducing realistic constraints such as beginning cycles from a held currency and accounting for per-transaction trading fees. We show that this formulation requires fewer logical variables (qubits) than previous QUBO encodings in the literature. We derive provably sufficient penalty weights for its constraint terms. We also introduce an exact anchor-gauge reweighting of the exchange rates that compresses the QUBO coefficient range from the rate scale to the arbitrage scale, addressing the finite analog precision of annealing hardware. We demonstrate the efficacy of this formulation using classical simulated annealing against an exact Held-Karp baseline on the same CPU and show that it can effectively find profitable cycles and account for trading fees. Finally, we benchmark faithful implementations of five prior QUBO encodings at matched sampler budgets and show that the proposed encoding is the only one to recover the exact fee-adjusted optimum.
The commercial D-Waves quantum annealer has given rise to plenty of interests due to the reported quantum speedup against classical annealing. In order to make use of this new technology, a problem must be formulated into a form of quadratic unconstrained binary optimization (QUBO) or Ising model. This thesis reports on case studies using a D-Wave quantum annealer to solve several optimization problems and providing results validation using classical exact approaches. In our thesis, we briefly introduce several classical techniques designed for QUBO problems and implement two exact approaches. With the proper tools, a D-Wave 2X computer consisted of 1098 active qubits is then evaluated for the Degree-Constrained Minimum Spanning Tree and the Steiner Tree problems, establishing their QUBO formulations are suitable for adiabatic quantum computers. Motivated by the remarkable performance, two more optimization problems are studied—the Bounded-Depth Steiner Tree problem and the Chromatic Sum problem. We propose a new formulation for each problem. The numbers of qubits (dimension of QUBO matrices) required by our formulations are O(|V|3) and O(|V|2) respectively, where |V| represents the number of vertices.
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.
The recent availability of the first commercial quantum computers has provided a promising tool to tackle NP hard problems which can only be solved heuristically with present techniques. However, it is unclear if the current state of quantum computing already provides a quantum advantage over the current state of the art in classical computing. This article assesses the performance of the D-Wave 2X quantum annealer on two NP hard graph problems, in particular clique finding and graph partitioning. For this, we provide formulations as Qubo and Ising Hamiltonians suitable for the quantum annealer and compare a variety of quantum solvers (Sapi, QBSolv, QSage provided by D-Wave Sys, Inc.) to current classical algorithms (METIS, Simulated Annealing, third-party clique finding and graph splitting heuristics) on certain test sets of graphs. We demonstrate that for small graph instances, classical methods still outperform the quantum annealer in terms of computing time, even though the quality of the best solutions obtained is comparable. Nevertheless, due to the limited problem size which can be embedded on the D-Wave 2X chip, the aforementioned finding applies to most of problems of general nature solvable on the quantum annealer. For instances specifically designed to fit the D-Wave 2X architecture, we observe substantial speed-ups in computing time over classical approaches.
Quantum computers can be much faster than any classical computers in solving a certain class of problems. One of the interesting problems is the combinatorial optimization problem, which is a challenge for classical computer systems. We encode these problems into the Quadratic Unconstrained Binary Optimization (QUBO) format and then solve them with quantum solvers. In this study, we compare the performance of D-Wave’s quantum annealing system with classical solvers, namely, Gurobi and Fixstars. We demonstrate the current capabilities of the D-Wave system.