Cover Image

Solving Currency Arbitrage Problems using D-Wave Advantage2 Quantum Annealer

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Mazzei, Lorenzo, Beccari, Giada, Laruina, Mirko, Cococcioni, Marco
Format:	Preprint
Published:	2025
Subjects:	Quantum Physics Emerging Technologies
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Comparing Three Generations of D-Wave Quantum Annealers for Minor Embedded Combinatorial Optimization Problems
by: Pelofske, Elijah
Published: (2023)

Simon's Period Finding on a Quantum Annealer
by: Robertson, Reece, et al.
Published: (2025)

Solving the Turbine Balancing Problem using Quantum Annealing
by: Unterauer, Arnold, et al.
Published: (2024)

Quantum Annealers Chain Strengths: A Simple Heuristic to Set Them All
by: Gilbert, Valentin, et al.
Published: (2024)

Benchmarking Quantum Annealers with Near-Optimal Minor-Embedded Instances
by: Gilbert, Valentin, et al.
Published: (2024)

Approaches to Simultaneously Solving Variational Quantum Eigensolver Problems
by: Hutchings, Adam, et al.
Published: (2024)

An Analysis of Quantum Annealing Algorithms for Solving the Maximum Clique Problem
by: Gherardi, Alessandro, et al.
Published: (2024)

Towards an Automatic Framework for Solving Optimization Problems with Quantum Computers
by: Volpe, Deborah, et al.
Published: (2024)

Local Binary and Multiclass SVMs Trained on a Quantum Annealer
by: Zardini, Enrico, et al.
Published: (2024)

Analysis of a Programmable Quantum Annealer as a Random Number Generator
by: Pelofske, Elijah
Published: (2023)

Solving Distributed Flexible Job Shop Scheduling Problems in the Wool Textile Industry with Quantum Annealing
by: Toma, Lilia, et al.
Published: (2024)

Calculating Nash Equilibrium on Quantum Annealers
by: Okrut, Olga, et al.
Published: (2021)

Solving Larger Maximum Clique Problems Using Parallel Quantum Annealing
by: Pelofske, Elijah, et al.
Published: (2022)

Evidence of Scaling Advantage for the Quantum Approximate Optimization Algorithm on a Classically Intractable Problem
by: Shaydulin, Ruslan, et al.
Published: (2023)

Parallel Ising Annealer via Gradient-based Hamiltonian Monte Carlo
by: Wang, Hao, et al.
Published: (2024)

Assessing Quantum Annealing to Solve the Minimum Vertex Multicut
by: Abbassi, Ali, et al.
Published: (2026)

Advantages of multistage quantum walks over QAOA
by: Gerblich, Lasse, et al.
Published: (2024)

4-clique Network Minor Embedding for Quantum Annealers
by: Pelofske, Elijah
Published: (2023)

Empirical Quantum Advantage Analysis of Quantum Kernel in Gene Expression Data
by: Ghosh, Arpita, et al.
Published: (2024)

A Physically-Informed Subgraph Isomorphism Approach to Molecular Docking Using Quantum Annealers
by: Micucci, Francesco, et al.
Published: (2026)

Lattice-Based Quantum Advantage from Rotated Measurements
by: Alnawakhtha, Yusuf, et al.
Published: (2022)

Sparks of Quantum Advantage and Rapid Retraining in Machine Learning
by: Troy, William
Published: (2024)

Hybrid Quantum-Classical Optimisation of Traveling Salesperson Problem
by: Lytrosyngounis, Christos, et al.
Published: (2025)

Efficient Variational Quantum Algorithms for the Generalized Assignment Problem
by: Mastroianni, Carlo, et al.
Published: (2025)

Quantum Optimization Methods for the Generalized Traveling Salesman Problem
by: Zorn, Maximilian, et al.
Published: (2026)

Solving Logistic-Oriented Bin Packing Problems Through a Hybrid Quantum-Classical Approach
by: Romero, Sebastián V., et al.
Published: (2023)

Solving Drone Routing Problems with Quantum Computing: A Hybrid Approach Combining Quantum Annealing and Gate-Based Paradigms
by: Osaba, Eneko, et al.
Published: (2025)

Solving the 3D Heat Equation with VQA via Remeshing-Based Warm Starts
by: Donachie, Samuel, et al.
Published: (2025)

Solving a Real-World Package Delivery Routing Problem Using Quantum Annealers
by: Osaba, Eneko, et al.
Published: (2024)

Benchmarking the ORCA PT-2 Boson Sampler using Minimum Dominating Set Problems
by: Park, Jessica, et al.
Published: (2026)

Solving rescheduling problems in heterogeneous urban railway networks using hybrid quantum-classical approach
by: Koniorczyk, Mátyás, et al.
Published: (2023)

Performance of Quantum Approximate Optimization with Quantum Error Detection
by: He, Zichang, et al.
Published: (2024)

A Non-Variational Quantum Approach to the Job Shop Scheduling Problem
by: Lopez-Ruiz, Miguel Angel, et al.
Published: (2025)

Advanced Quantum Annealing Approach to Vehicle Routing Problems with Time Windows
by: Holliday, James B., et al.
Published: (2025)

Characterizing QUBO Reformulations of the Max-k-Cut Problem for Quantum Computing
by: Harkness, Adrian, et al.
Published: (2025)

An Advanced Hybrid Quantum Tabu Search Approach to Vehicle Routing Problems
by: Holliday, James B., et al.
Published: (2025)

A Predictive Approach for Selecting the Best Quantum Solver for an Optimization Problem
by: Volpe, Deborah, et al.
Published: (2024)

Stochastic Simulated Quantum Annealing for Fast Solution of Combinatorial Optimization Problems
by: Onizawa, Naoya, et al.
Published: (2023)

Divide-et-impera Heuristic-based Randomized Search for the Qubit Routing Problem
by: Baioletti, Marco, et al.
Published: (2025)

Quantum Circuit Mapping for Universal and Scalable Computing in MZI-based Integrated Photonics
by: Kwon, Yong, et al.
Published: (2024)