4 papers
A Warm-start QAOA based approach using a swap-based mixer for the TSP: theoretical considerations,implementation and experiments
E. Bourreau, G. Fleury, P. 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…
Quadratic versus Polynomial Unconstrained Binary Models for Quantum Optimization illustrated on Railway Timetabling
Camille Grange, Marion Lavignac, Valentina Pozzoli +1
Quantum Approximate Optimization Algorithm (QAOA) is one of the most short-term promising quantum-classical algorithm to solve unconstrained combinatorial optimization problems. It…
Moderate Exponential-time Quantum Dynamic Programming Across the Subsets for Scheduling Problems
Camille Grange, Michael Poss, Eric Bourreau +2
Grover Search is currently one of the main quantum algorithms leading to hybrid quantum-classical methods that reduce the worst-case time complexity for some combinatorial optimiza…
An introduction to variational quantum algorithms for combinatorial optimization problems
Camille Grange, Michael Poss, Eric Bourreau
Noisy intermediate-scale quantum computers (NISQ computers) are now readily available, motivating many researchers to experiment with Variational Quantum Algorithms (VQAs). Among t…