20 citations · 27 across the 9 of their papers we have counts for
10 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…
Indirect Job-Shop coding using rank: application to QAOA (IQAOA)
Eric Bourreau, Gerard Fleury, Phlippe Lacomme
The Job-Shop Scheduling Problem (JSSP) stands as one of the most renowned challenges in scheduling. It is characterized as a disjunctive problem, wherein a solution is fully depict…
Indirect Quantum Approximate Optimization Algorithms: application to the TSP
Eric Bourreau, Gerard Fleury, Philippe Lacomme
We propose an Indirect Quantum Approximate Optimization Algorithm (referred to as IQAOA) where the Quantum Alternating Operator Ansatz takes into consideration a general parameteri…
A Hybrid Quantum-assisted Column Generation Algorithm for the Fleet Conversion Problem
Yagnik Chatterjee, Zaid Allybokus, Marko J. Rančić +1
The problem of Fleet Conversion aims to reduce the carbon emissions and cost of operating a fleet of vehicles for a given set of tours. It can be modelled as a column generation sc…
Solving various NP-Hard problems using exponentially fewer qubits on a Quantum Computer
Yagnik Chatterjee, Eric Bourreau, Marko J. Rančić
NP-hard problems are not believed to be exactly solvable through general polynomial time algorithms. Hybrid quantum-classical algorithms to address such combinatorial problems have…
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…
Mixer Hamiltonian with QAOA for Max k-coloring : numerical evaluations
Eric Bourreau, Gérard Fleury, Philippe Lacomme
This paper concerns quantum heuristics based on Mixer Hamiltonians that allow to restrict investigation on a specific subspace. Mixer Hamiltonian based approaches can be included i…
Adiabatic based Algorithm for SAT: a comprehensive algorithmic description
Eric Bourreau, Gérard Fleury, Philippe Lacomme
This paper concerns quantum heuristics able to extend the domain of quantum computing, defining a promising way in the large number of well-known classical algorithms. Quantum appr…