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

arXiv:2504.19934 · IEEE Transactions on Intelligent Transportation Systems

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, Victor Hugo C. de Albuquerque, João Paulo Papa

Published Jan 1, 2026• 11 citations
arXivHTMLPDF

Abstract

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.

DOI
10.1109/tits.2026.3744587

Related papers

Constrained Quantum Optimization via Iterative Warm-Start XY-Mixers

David Bucher, Maximilian Janetschek, Michael Poppel +3 more

The Quantum Approximate Optimization Algorithm (QAOA) is a leading hybrid heuristic for combinatorial optimization, but efficiently handling hard constraints remains a significant challenge. XY-mixers successfully confine quantum state evolution to a feasible subspace, such as the Hamming-weight-1 sector for one-hot constraints. On the contrary, warm-starting biases the search toward promising regions based on preliminary solutions. Combining these two techniques requires maintaining the essential alignment between the initial state and the mixer Hamiltonian to preserve convergence guarantees. Previous work demonstrated warm-starting with XY-mixers via a biased initial state, but relying only on standard mixer Hamiltonians. Consequently, the initial state is no longer a ground state of the mixer. In this work, we overcome these limitations by formulating a warm-started XY-mixer Hamiltonian for one-hot constraints and proving its ground-state properties. Furthermore, we provide a shallow circuit implementation suitable for NISQ implementations. We embed the warm-starting into a classical heuristic that iteratively updates the bias based on previous samples, called Iterative Warm-Starting (IWS). Extensive numerical simulations on Max-$k$-Cut and Traveling Salesperson Problem instances demonstrate that IWS-QAOA significantly accelerates the solution-finding process, increasing the probability of sampling optimal solutions by orders of magnitude compared to standard XY-QAOA. Finally, we validate our approach on the ibm_boston QPU using hardware-tailored 144-qubit problem instances. By coupling IWS-QAOA with a greedy steepest-descent post-processing strategy to repair infeasible measurements caused by hardware noise, we successfully identify optimal solutions on actual quantum devices.

quant-pharXiv:2604.02083•New Journal of Physics•Apr 3, 2026•12 citations

A Warm-start QAOA based approach using a swap-based mixer for the TSP: theoretical considerations,implementation and experiments

Eric Bourreau, Gérard Fleury, Philippe Lacomme

This paper investigates quantum heuristics based on Mixer Hamiltonians, which allow the search to be restricted to a specific subspace and enable warm-start strategies for solving the Traveling Salesman Problem (TSP). Approaches involving Mixer Hamiltonians can be integrated into the Quantum Approximate Optimization Algorithm (QAOA), where the Mixer acts as a mapping function that transforms qubit strings into feasible solution sets. We first introduce a swap-based mixer tailored to the TSP, which ensures that only qubit strings representing valid TSP solutions are explored during the QAOA process. Second, we propose a warm-start technique that initializes QAOA with a solution generated by any classical heuristic, thereby promoting faster convergence. These two contributions are combined into a Warm-Start QAOA framework with a Swap-Based Mixer, leveraging both structural and initialization advantages. Experimental results on a custom TSP instance involving five customers demonstrate the effectiveness of this approach, providing, for the first time, a viable integration of warm-start and swap-based mixers for the TSP within a quantum optimization framework.

arXiv:2505.01214•May 2, 2025•5 citations

Warm-start adaptive-bias quantum approximate optimization algorithm

Yunlong Yu, Xiang‐Bin Wang, Nic Shannon +1 more

In the search for quantum advantage in real--world problems, one promising avenue is to use a quantum algorithm to improve on the solution found using an efficient classical algorithm. The quantum approximate optimization algorithm (QAOA) is particularly well adapted for such a "warm start" approach, and can be combined with the powerful classical Goemans-Williamson (GW) algorithms based on semi-definite programming. Nonetheless, the best way to leverage the power of the QAOA remains an open question. Here we propose a general model that describes a class of QAOA variants, and use it to explore routes to quantum advantages in a canonical optimization problem, MaxCut. For these algorithms we derive analytic expectation values of the cost Hamiltonian for the MaxCut problem in the level-1 case. Using these analytic results we obtain reliable averages over many instances for fairly large numbers of qubits. We find that the warm start adaptive-bias QAOA (WS-ab-QAOA) initialized by the GW algorithm outperforms previously proposed warm start variants on problems with $40$ to $180$ qubits. To assess whether a quantum advantage exists with this algorithm, we did numerical simulations with up to $1000$ qubits to see whether the level-1 WS-ab-QAOA can improve the GW solution for 3-regular graphs. In fact the improvement in the $1000$-qubit case even in level 1 can only be matched by the GW algorithm after about $10^{5.5}$ random projections performed after the semi-definite program stage. This work gives evidence that the final stage of optimization after an efficient classical algorithm has produced an approximate solution may be a place where quantum advantages can be realized.

arXiv:2503.20048•Physical Review A•Jul 14, 2025•10 citations

Comparative Analysis of Quantum Approximate Optimization Algorithms for Solving the Travelling Salesperson Problem

Siddharth Chander

The Quantum Approximate Optimization Algorithm (QAOA) was developed to tackle combinatorial optimization problems, such as the Travelling Salesman Problem (TSP), by approximating solutions through quantum mechanics. QAOA utilizes a unitary transformation to prepare a quantum state that encodes a potential solution, with the parameters of the unitary optimized by a classical optimizer. This study evaluates QAOA's performance on the NP-hard TSP, comparing the standard version of the algorithm from Farhi \cite{qaoa} and an enhancement, Warm-Start QAOA \cite{warmstart}, to a classical solver. The TSP seeks the shortest possible route that visits a set of cities, a problem that is amenable to quantum formulation using platforms like Qiskit. Warm-Start QAOA initializes the algorithm's parameters based on a solution to a relaxed version of the problem, offering potential improvements in optimization efficiency. By comparing these quantum algorithms to a classical solver, we provide a comprehensive assessment of their performance across key metrics, including route quality, execution time, and scalability. Through this analysis, we highlight the relative strengths and weaknesses of QAOA and its warm-start variant for solving the TSP, alongside the classical approach, offering insights into their potential for route optimization and practical applications in realworld settings. We conclude that, while the classical solver significantly outperforms QAOA and warm-start QAOA at smaller-scale problem cases, warm-Start QAOA has the potential to yield advantages at a larger scale when run on NISQ-era noisy hardware.

IEEE International Conference on Quantum Control, Computing and Learning (qCCL)•Jun 25, 2025•1 citation

Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut

Bikrant Bhattacharyya, Michael Capriotti, Reuben Tate

The Quantum Approximate Optimization Algorithm (QAOA) is a quantum algorithm that finds approximate solutions to problems in combinatorial optimization, especially those that can be formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem. In prior work, researchers have considered various ways of "warm-starting" QAOA by constructing an initial quantum state using classically-obtained solutions or information; these warm-starts typically cause QAOA to yield better approximation ratios at much lower circuit depths. For the Max-Cut problem, one warm-start approaches constructs the initial state using the high-dimensional vectors that are output from an SDP relaxation of the corresponding Max-Cut problem. This work leverages these semidefinite warmstarts for a broader class of problem instances by using a standard reduction that transforms any QUBO instance into a Max-Cut instance. We empirically compare this approach to a "QUBO-relaxation" approach that relaxes the QUBO directly. Our results consider a variety of QUBO instances ranging from randomly generated QUBOs to QUBOs corresponding to specific problems such as the traveling salesman problem, maximum independent set, and portfolio optimization. We find that the best choice of warmstart approach is strongly dependent on the problem type.

arXiv:2504.06253•Apr 8, 2025•9 citations

Warm-Started QAOA with Custom Mixers Provably Converges and Computationally Beats Goemans-Williamson's Max-Cut at Low Circuit Depths

Reuben Tate, Jai Moondra, Bryan Gard +2 more

We generalize the Quantum Approximate Optimization Algorithm (QAOA) of Farhi et al. (2014) to allow for arbitrary separable initial states with corresponding mixers such that the starting state is the most excited state of the mixing Hamiltonian. We demonstrate this version of QAOA, which we call Q A O A − w a r m e s t , by simulating Max-Cut on weighted graphs. We initialize the starting state as a w a r m − s t a r t using 2 and 3 -dimensional approximations obtained using randomized projections of solutions to Max-Cut's semi-definite program, and define a warm-start dependent c u s t o m m i x e r . We show that these warm-starts initialize the QAOA circuit with constant-factor approximations of 0.658 for 2 -dimensional and 0.585 for 3 -dimensional warm-starts for graphs with non-negative edge weights, improving upon previously known trivial (i.e., 0.5 for standard initialization) worst-case bounds at p = 0 . These factors in fact lower bound the approximation achieved for Max-Cut at higher circuit depths, since we also show that QAOA-warmest with any separable initial state converges to Max-Cut under the adiabatic limit as p → ∞ . However, the choice of warm-starts significantly impacts the rate of convergence to Max-Cut, and we show empirically that our warm-starts achieve a faster convergence compared to existing approaches. Additionally, our numerical simulations show higher quality cuts compared to standard QAOA, the classical Goemans-Williamson algorithm, and a warm-started QAOA without custom mixers for an instance library of 1148 graphs (upto 11 nodes) and depth p = 8 . We further show that QAOA-warmest outperforms the standard QAOA of Farhi et al. in experiments on current IBM-Q and Quantinuum hardware.

arXiv:2112.11354•Quantum•Sep 26, 2023•62 citations
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.
The Quantum Approximate Optimization Algorithm (QAOA) is a leading hybrid heuristic for combinatorial optimization, but efficiently handling hard constraints remains a significant challenge. XY-mixers successfully confine quantum state evolution to a feasible subspace, such as the Hamming-weight-1 sector for one-hot constraints. On the contrary, warm-starting biases the search toward promising regions based on preliminary solutions. Combining these two techniques requires maintaining the essential alignment between the initial state and the mixer Hamiltonian to preserve convergence guarantees. Previous work demonstrated warm-starting with XY-mixers via a biased initial state, but relying only on standard mixer Hamiltonians. Consequently, the initial state is no longer a ground state of the mixer. In this work, we overcome these limitations by formulating a warm-started XY-mixer Hamiltonian for one-hot constraints and proving its ground-state properties. Furthermore, we provide a shallow circuit implementation suitable for NISQ implementations. We embed the warm-starting into a classical heuristic that iteratively updates the bias based on previous samples, called Iterative Warm-Starting (IWS). Extensive numerical simulations on Max-kkk-Cut and Traveling Salesperson Problem instances demonstrate that IWS-QAOA significantly accelerates the solution-finding process, increasing the probability of sampling optimal solutions by orders of magnitude compared to standard XY-QAOA. Finally, we validate our approach on the ibm_boston QPU using hardware-tailored 144-qubit problem instances. By coupling IWS-QAOA with a greedy steepest-descent post-processing strategy to repair infeasible measurements caused by hardware noise, we successfully identify optimal solutions on actual quantum devices.
This paper investigates quantum heuristics based on Mixer Hamiltonians, which allow the search to be restricted to a specific subspace and enable warm-start strategies for solving the Traveling Salesman Problem (TSP). Approaches involving Mixer Hamiltonians can be integrated into the Quantum Approximate Optimization Algorithm (QAOA), where the Mixer acts as a mapping function that transforms qubit strings into feasible solution sets. We first introduce a swap-based mixer tailored to the TSP, which ensures that only qubit strings representing valid TSP solutions are explored during the QAOA process. Second, we propose a warm-start technique that initializes QAOA with a solution generated by any classical heuristic, thereby promoting faster convergence. These two contributions are combined into a Warm-Start QAOA framework with a Swap-Based Mixer, leveraging both structural and initialization advantages. Experimental results on a custom TSP instance involving five customers demonstrate the effectiveness of this approach, providing, for the first time, a viable integration of warm-start and swap-based mixers for the TSP within a quantum optimization framework.
In the search for quantum advantage in real--world problems, one promising avenue is to use a quantum algorithm to improve on the solution found using an efficient classical algorithm. The quantum approximate optimization algorithm (QAOA) is particularly well adapted for such a "warm start" approach, and can be combined with the powerful classical Goemans-Williamson (GW) algorithms based on semi-definite programming. Nonetheless, the best way to leverage the power of the QAOA remains an open question. Here we propose a general model that describes a class of QAOA variants, and use it to explore routes to quantum advantages in a canonical optimization problem, MaxCut. For these algorithms we derive analytic expectation values of the cost Hamiltonian for the MaxCut problem in the level-1 case. Using these analytic results we obtain reliable averages over many instances for fairly large numbers of qubits. We find that the warm start adaptive-bias QAOA (WS-ab-QAOA) initialized by the GW algorithm outperforms previously proposed warm start variants on problems with 404040 to 180180180 qubits. To assess whether a quantum advantage exists with this algorithm, we did numerical simulations with up to 100010001000 qubits to see whether the level-1 WS-ab-QAOA can improve the GW solution for 3-regular graphs. In fact the improvement in the 100010001000-qubit case even in level 1 can only be matched by the GW algorithm after about 105.510^{5.5}105.5 random projections performed after the semi-definite program stage. This work gives evidence that the final stage of optimization after an efficient classical algorithm has produced an approximate solution may be a place where quantum advantages can be realized.
The Quantum Approximate Optimization Algorithm (QAOA) was developed to tackle combinatorial optimization problems, such as the Travelling Salesman Problem (TSP), by approximating solutions through quantum mechanics. QAOA utilizes a unitary transformation to prepare a quantum state that encodes a potential solution, with the parameters of the unitary optimized by a classical optimizer. This study evaluates QAOA's performance on the NP-hard TSP, comparing the standard version of the algorithm from Farhi \cite{qaoa} and an enhancement, Warm-Start QAOA \cite{warmstart}, to a classical solver. The TSP seeks the shortest possible route that visits a set of cities, a problem that is amenable to quantum formulation using platforms like Qiskit. Warm-Start QAOA initializes the algorithm's parameters based on a solution to a relaxed version of the problem, offering potential improvements in optimization efficiency. By comparing these quantum algorithms to a classical solver, we provide a comprehensive assessment of their performance across key metrics, including route quality, execution time, and scalability. Through this analysis, we highlight the relative strengths and weaknesses of QAOA and its warm-start variant for solving the TSP, alongside the classical approach, offering insights into their potential for route optimization and practical applications in realworld settings. We conclude that, while the classical solver significantly outperforms QAOA and warm-start QAOA at smaller-scale problem cases, warm-Start QAOA has the potential to yield advantages at a larger scale when run on NISQ-era noisy hardware.
The Quantum Approximate Optimization Algorithm (QAOA) is a quantum algorithm that finds approximate solutions to problems in combinatorial optimization, especially those that can be formulated as a Quadratic Unconstrained Binary Optimization (QUBO) problem. In prior work, researchers have considered various ways of "warm-starting" QAOA by constructing an initial quantum state using classically-obtained solutions or information; these warm-starts typically cause QAOA to yield better approximation ratios at much lower circuit depths. For the Max-Cut problem, one warm-start approaches constructs the initial state using the high-dimensional vectors that are output from an SDP relaxation of the corresponding Max-Cut problem. This work leverages these semidefinite warmstarts for a broader class of problem instances by using a standard reduction that transforms any QUBO instance into a Max-Cut instance. We empirically compare this approach to a "QUBO-relaxation" approach that relaxes the QUBO directly. Our results consider a variety of QUBO instances ranging from randomly generated QUBOs to QUBOs corresponding to specific problems such as the traveling salesman problem, maximum independent set, and portfolio optimization. We find that the best choice of warmstart approach is strongly dependent on the problem type.
We generalize the Quantum Approximate Optimization Algorithm (QAOA) of Farhi et al. (2014) to allow for arbitrary separable initial states with corresponding mixers such that the starting state is the most excited state of the mixing Hamiltonian. We demonstrate this version of QAOA, which we call Q A O A − w a r m e s t , by simulating Max-Cut on weighted graphs. We initialize the starting state as a w a r m − s t a r t using 2 and 3 -dimensional approximations obtained using randomized projections of solutions to Max-Cut's semi-definite program, and define a warm-start dependent c u s t o m m i x e r . We show that these warm-starts initialize the QAOA circuit with constant-factor approximations of 0.658 for 2 -dimensional and 0.585 for 3 -dimensional warm-starts for graphs with non-negative edge weights, improving upon previously known trivial (i.e., 0.5 for standard initialization) worst-case bounds at p = 0 . These factors in fact lower bound the approximation achieved for Max-Cut at higher circuit depths, since we also show that QAOA-warmest with any separable initial state converges to Max-Cut under the adiabatic limit as p → ∞ . However, the choice of warm-starts significantly impacts the rate of convergence to Max-Cut, and we show empirically that our warm-starts achieve a faster convergence compared to existing approaches. Additionally, our numerical simulations show higher quality cuts compared to standard QAOA, the classical Goemans-Williamson algorithm, and a warm-started QAOA without custom mixers for an instance library of 1148 graphs (upto 11 nodes) and depth p = 8 . We further show that QAOA-warmest outperforms the standard QAOA of Farhi et al. in experiments on current IBM-Q and Quantinuum hardware.