Posted

Ieva Čepaitė, Niam Vaishnav, Leo Zhou, Ashley Montanaro (Aug 25 2025).
Abstract: We present an approach, which we term quantum-enhanced optimization, to accelerate classical optimization algorithms by leveraging quantum sampling. Our method uses quantum-generated samples as warm starts to classical heuristics for solving challenging combinatorial problems like Max-Cut and Maximum Independent Set (MIS). To implement the method efficiently, we introduce novel parameter-setting strategies for the Quantum Approximate Optimization Algorithm (QAOA), qubit mapping and routing techniques to reduce gate counts, and error-mitigation techniques. Experimental results, including on quantum hardware, showcase runtime improvements compared with the original classical algorithms.

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!