Implementing the Quantum Approximate Optimization Algorithms for QUBO problems Across Quantum Hardware Platforms: Performance Analysis, Challenges, and Strategies

• URL: http://arxiv.org/abs/2510.12336v1
• Date: Tue, 14 Oct 2025 09:46:23 GMT
• Title: Implementing the Quantum Approximate Optimization Algorithms for QUBO problems Across Quantum Hardware Platforms: Performance Analysis, Challenges, and Strategies
• Authors: Teemu Pihkakoski, Aravind Plathanam Babu, Pauli Taipale, Petri Liimatta, Matti Silveri,
• Abstract summary: Quantum computers are expected to offer significant advantages in solving complex optimization problems.<n>In this paper, we investigate the performance of both the standard QAOA and the adaptive derivative assembled problem tailored QAOA.<n>Our findings provide a comprehensive overview of the challenges, trade-offs, and strategies for deploying QAOA-based methods on near-term quantum hardware.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computers are expected to offer significant advantages in solving complex optimization problems that are challenging for classical computers. Quadratic Unconstrained Binary Optimization (QUBO) problems represent an important class of problems with relevance in finance and logistics. The Quantum Approximate Optimization Algorithm (QAOA) is a prominent candidate for solving QUBO problems on near-term quantum devices. In this paper, we investigate the performance of both the standard QAOA and the adaptive derivative assembled problem tailored QAOA (ADAPT-QAOA) to solve QUBO problems of varying sizes and hardnesses with a focus on its practical applications in financial feature selection problems. Our main observation is that ADAPT-QAOA significantly outperforms QAOA with hard problems (trade-off parameter {\alpha} = 0.6) when comparing approximation ratio and time-to-solution. However, the standard QAOA remains efficient for simpler problems. Additionally, we investigate the practical feasibility and limitations of QAOA by scaling analysis based on the real-device calibration data for various hardware platforms. Our estimates indicate that standard QAOA implemented on superconducting quantum computers provides a shorter time-to-solution compared to trapped-ion devices. However, trapped-ion devices are expected to yield more favorable error rates. Our findings provide a comprehensive overview of the challenges, trade-offs, and strategies for deploying QAOA-based methods on near-term quantum hardware.

Related papers

• Quantum Optimization in Loc(Q)ation Science: QUBO Formulations, Benchmark Problems, and a Computational Study [0.0]
  Quadratic Unconstrained Binary Optimization provides a unifying modeling framework for a broad class of $mathbfNP$-hard problems.<n>We develop QUBO formulations for several fundamental problems in location science, network design, and logistics.<n>These QUBO formulations serve as representative benchmark problems for assessing quantum algorithms and quantum hardware.
  arXiv  Detail & Related papers  (2026-02-11T15:39:26Z)
• Quantum-Assisted Vehicle Routing: Realizing QAOA-based Approach on Gate-Based Quantum Computer [1.5119440099674915]
  Vehicle Problem Routing (VRP) is a fundamental optimization challenge with broad applications in logistics and transportation.<n>We present a quantum-assisted framework that integrates the Quantum Approximate Optimization Algorithm (QAOA) with a link-based formulation of VRP.<n>Our approach encodes flow conservation and subtour elimination directly into the cost Hamiltonian, preserving graph structure while avoiding ancillary qubits.
  arXiv  Detail & Related papers  (2025-05-02T22:31:01Z)
• Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz [3.5773675235837974]
  Quantum Random Access Optimization (QRAO) has been proposed to reduce the space requirements of quantum optimization.<n>We show that instance-independent fixed" parameters achieve good performance, removing the need for variational parameter optimization.<n>Our results pave the way for the practical execution of QRAO on early fault-tolerant quantum computers.
  arXiv  Detail & Related papers  (2025-02-06T18:25:31Z)
• Optimization of Flight Routes: Quantum Approximate Optimization Algorithm for the Tail Assignment Problem [0.0]
  The Tail Assignment Problem (TAP) is a critical optimization challenge in airline operations.<n>This work applies the Quantum Approximate Optimization Algorithm (QAOA) to the TAP.<n>The analysis reveals the current limitations of quantum hardware but suggests potential advantages as technology advances.
  arXiv  Detail & Related papers  (2024-12-17T10:35:26Z)
• Connecting the Hamiltonian structure to the QAOA performance and energy landscape [0.0]
  Quantum Alternating Operator Ansatz (QAOA) is effective for solving Quadratic Unconstrained Binary Optimization problems. This study emphasizes the algorithm's robustness and potential for optimization tasks on near-term quantum devices.
  arXiv  Detail & Related papers  (2024-07-05T11:32:46Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• A Review on Quantum Approximate Optimization Algorithm and its Variants [47.89542334125886]
  The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising variational quantum algorithm that aims to solve intractable optimization problems. This comprehensive review offers an overview of the current state of QAOA, encompassing its performance analysis in diverse scenarios. We conduct a comparative study of selected QAOA extensions and variants, while exploring future prospects and directions for the algorithm.
  arXiv  Detail & Related papers  (2023-06-15T15:28:12Z)
• Quantum-Assisted Solution Paths for the Capacitated Vehicle Routing Problem [0.0]
  We discuss the Capacitated Vehicle Problem (CVRP) or its reduced variant, the Travelling Salesperson Problem (TSP) Even with today's most powerful classical algorithms, the CVRP is challenging to solve classically. Quantum computing may offer a way to improve the time to solution.
  arXiv  Detail & Related papers  (2023-04-19T13:03:50Z)
• 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)
• Adiabatic Quantum Computing for Multi Object Tracking [170.8716555363907]
  Multi-Object Tracking (MOT) is most often approached in the tracking-by-detection paradigm, where object detections are associated through time. As these optimization problems are often NP-hard, they can only be solved exactly for small instances on current hardware. We show that our approach is competitive compared with state-of-the-art optimization-based approaches, even when using of-the-shelf integer programming solvers.
  arXiv  Detail & Related papers  (2022-02-17T18:59:20Z)
• Scaling Quantum Approximate Optimization on Near-term Hardware [49.94954584453379]
  We quantify scaling of the expected resource requirements by optimized circuits for hardware architectures with varying levels of connectivity. We show the number of measurements, and hence total time to synthesizing solution, grows exponentially in problem size and problem graph degree. These problems may be alleviated by increasing hardware connectivity or by recently proposed modifications to the QAOA that achieve higher performance with fewer circuit layers.
  arXiv  Detail & Related papers  (2022-01-06T21:02:30Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor [29.928684308464796]
  We demonstrate the application of the Google Sycamore superconducting qubit quantum processor to optimization problems with the quantum approximate optimization algorithm (QAOA) For the first time, we observe, for the first time, that performance increases with circuit depth. This behavior highlights the challenge of using near-term quantum computers to optimize problems on graphs differing from hardware connectivity.
  arXiv  Detail & Related papers  (2020-04-08T18:44:34Z)

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.