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

Lecture notes in computer science

Solving Edge-Weighted Maximum Clique Problem with DCA Warm-Start Quantum Approximate Optimization Algorithm

Huy Phuc Nguyen Ha, Viết Hùng Nguyễn, Anh Son Ta

Published Jan 1, 2024• 1 citation
Publisher
DOI
10.1007/978-3-031-62912-9_24

Related papers

Solving Combinatorial Optimization Problems using the Quantum Approximation Optimization Algorithm

Nicholas J. Guerrero

•Mar 26, 2020•3 citations

Difference of Convex Algorithm for Warm‐Start Quantum Approximate Optimization Algorithm

Phuc Nguyen Ha Huy, Viết Hùng Nguyễn, Anh Son Ta

Abstract The Quantum Approximate Optimization Algorithm (QAOA) stands as a hybrid classical‐quantum algorithm utilized for addressing combinatorial optimization challenges. Central to its effectiveness is the initial mixer, which is responsible for instigating the optimization process by generating the starting state. However, conventional QAOA implementations often assign equal probabilities to all solutions at the outset, potentially resulting in suboptimal performance when tackling complex combinatorial optimization problems. In this study, a novel enhancement is proposed to the QAOA, leveraging the Difference of Convex Algorithm (DCA). This method aims to refine QAOA's performance by facilitating the discovery of optimal parameters through a continuous warm‐start approach, as originally introduced by Egger et al. Through experimentation utilizing datasets from prior studies focusing on the weighted maximum cut problem, the efficacy of our proposed method is evaluated. Comparative analysis against existing methodologies reveals a significant improvement in the approximate ratio achieved by our approach.

Advanced Quantum Technologies•May 20, 2025•0 citations

A hybrid quantum-classical approach to warm-starting optimization

Vanessa Dehn, Thomas Wellens

The Quantum Approximate Optimization Algorithm (QAOA) is a promising candidate for solving combinatorial optimization problems more efficiently than classical computers. Recent studies have shown that warm-starting the standard algorithm improves the performance. In this paper we compare the performance of standard QAOA with that of warm-start QAOA in the context of portfolio optimization and investigate the warm-start approach for different problem instances. In particular, we analyze the extent to which the improved performance of warm-start QAOA is due to quantum effects, and show that the results can be reproduced or even surpassed by a purely classical preprocessing of the original problem followed by standard QAOA.

arXiv:2309.13961•Quantum Computing, Communication, and Simulation•Mar 12, 2024•2 citations

Solving Maximum Cut Problem with Multi-objective Enhance Quantum Approximate Optimization Algorithm

Huy Phuc Nguyen Ha, Viết Hùng Nguyễn, Anh Son Ta

Lecture notes in computer science•Jan 1, 2024•0 citations

Quantum approximate optimization algorithm for the Max-Cut problem: a case study for random graph topologies

Καράς, Αλέξανδρος Α., Καράς, Αλέξανδρος Α.

•Jan 1, 2025•0 citations

Warm-Starting QAOA With XY Mixers: A Novel Approach for Traveling Salesman Problem

Rafael Simões do Carmo, Marcos Cleison Silva Santana, F. F. Fanchini +2 more

Quantum optimization algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA), are emerging as promising heuristics for solving complex combinatorial problems. To improve performance, several extensions to the standard QAOA framework have been proposed in recent years. Two notable directions include: warm-starting techniques, which incorporate classical approximate solutions to guide the quantum evolution, and custom mixer Hamiltonians, such as$XY$mixers, which constrain the search to feasible subspaces aligned with the structure of the problem. In this work, we propose an approach that integrates these two strategies: a warm-start initialization with an$XY$mixer ansatz, enabling constraint, preserving quantum evolution biased toward high-quality classical solutions. The method begins by reformulating the combinatorial problem as a MaxCut instance, solved approximately using the Goemans-Williamson algorithm. The resulting binary solution is relaxed and used to construct a biased superposition over one-hot quantum states that preserves the Hamming weight 1, maintaining compatibility with the$XY$mixers constraints. We evaluate the approach on 5-city instances of the Traveling Salesperson Problem, a canonical optimization problem frequently encountered as a subroutine in real-world route planning problems. Our method is benchmarked against both the standard$XY$-mixer QAOA and a warm-start-only variant based on MaxCut relaxation. Results show that the proposed combination consistently outperforms both baselines in terms of the percentage and rank of optimal solutions, demonstrating the effectiveness of combining structured initializations with constraint-aware quantum evolution for optimization problems.

arXiv:2504.19934•IEEE Transactions on Intelligent Transportation Systems•Jan 1, 2026•11 citations
Abstract The Quantum Approximate Optimization Algorithm (QAOA) stands as a hybrid classical‐quantum algorithm utilized for addressing combinatorial optimization challenges. Central to its effectiveness is the initial mixer, which is responsible for instigating the optimization process by generating the starting state. However, conventional QAOA implementations often assign equal probabilities to all solutions at the outset, potentially resulting in suboptimal performance when tackling complex combinatorial optimization problems. In this study, a novel enhancement is proposed to the QAOA, leveraging the Difference of Convex Algorithm (DCA). This method aims to refine QAOA's performance by facilitating the discovery of optimal parameters through a continuous warm‐start approach, as originally introduced by Egger et al. Through experimentation utilizing datasets from prior studies focusing on the weighted maximum cut problem, the efficacy of our proposed method is evaluated. Comparative analysis against existing methodologies reveals a significant improvement in the approximate ratio achieved by our approach.
The Quantum Approximate Optimization Algorithm (QAOA) is a promising candidate for solving combinatorial optimization problems more efficiently than classical computers. Recent studies have shown that warm-starting the standard algorithm improves the performance. In this paper we compare the performance of standard QAOA with that of warm-start QAOA in the context of portfolio optimization and investigate the warm-start approach for different problem instances. In particular, we analyze the extent to which the improved performance of warm-start QAOA is due to quantum effects, and show that the results can be reproduced or even surpassed by a purely classical preprocessing of the original problem followed by standard QAOA.
Quantum optimization algorithms, such as the Quantum Approximate Optimization Algorithm (QAOA), are emerging as promising heuristics for solving complex combinatorial problems. To improve performance, several extensions to the standard QAOA framework have been proposed in recent years. Two notable directions include: warm-starting techniques, which incorporate classical approximate solutions to guide the quantum evolution, and custom mixer Hamiltonians, such asXYXYXYmixers, which constrain the search to feasible subspaces aligned with the structure of the problem. In this work, we propose an approach that integrates these two strategies: a warm-start initialization with anXYXYXYmixer ansatz, enabling constraint, preserving quantum evolution biased toward high-quality classical solutions. The method begins by reformulating the combinatorial problem as a MaxCut instance, solved approximately using the Goemans-Williamson algorithm. The resulting binary solution is relaxed and used to construct a biased superposition over one-hot quantum states that preserves the Hamming weight 1, maintaining compatibility with theXYXYXYmixers constraints. We evaluate the approach on 5-city instances of the Traveling Salesperson Problem, a canonical optimization problem frequently encountered as a subroutine in real-world route planning problems. Our method is benchmarked against both the standardXYXYXY-mixer QAOA and a warm-start-only variant based on MaxCut relaxation. Results show that the proposed combination consistently outperforms both baselines in terms of the percentage and rank of optimal solutions, demonstrating the effectiveness of combining structured initializations with constraint-aware quantum evolution for optimization problems.