6 citations · 11 across the 12 of their papers we have counts for
12 papers
Quantum circuit for exponentiation of Hamiltonians: an algorithmic description based on tensor products
Gerard Fleury, Philippe Lacomme
Exponentiation of Hamiltonians refers to a mathematical operation to a Hamiltonian operator, typically in the form e^(-i.t.H), where H is the Hamiltonian and t is a time parameter.…
A technical note for the 91-clauses SAT resolution with Indirect QAOA based approach
Gerard Fleury, Philippe Lacomme
This paper addresses the resolution of the 3-SAT problem using a QAOA-like approach. The chosen principle involves modeling the solution ranks of the 3-SAT problem, which, in this…
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…
Mathematical Foundations of Quantum Computing for Computer Science Researchers
Gérard Fleury, Philippe Lacomme
This paper provides a short introduction to the mathematical foundation of quantum computation for researchers in computer science by providing an introduction fo the mathematical…
Stochastic Capacitated Arc Routing Problem
Fleury Gérard, Lacomme Philippe, Christian Prins
This paper deals with the Stochastic Capacitated Arc Routing Problem (SCARP), obtained by randomizing quantities on the arcs in the CARP. Optimization problems for the SCARP are ch…
First Competitive Ant Colony Scheme for the CARP
Lacomme Philippe, Prins Christian, Tanguy Alain
This paper addresses the Capacitated Arc Routing Problem (CARP) using an Ant Colony Optimization scheme. Ant Colony schemes can compute solutions for medium scale instances of VRP.…
A GRASPxELS with Depth First Search Split Procedure for the HVRP
Christophe Duhame, Philippe Lacomme, Caroline Prodhon
Split procedures have been proved to be efficient within global framework optimization for routing problems by splitting giant tour into trips. This is done by generating optimal s…
Description of the Grover algorithm based on geometric considerations
Gérard Fleury, Philippe Lacomme
This paper concerns the Grover algorithm that permits to make amplification of quantum states previously tagged by an Oracle. Grover's algorithm allows searches in an unstructure d…
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…
A technical note for a Shor's algorithm by phase estimation
Gérard Fleury, Philippe Lacomme
The objective of this paper concerns at first the motivation and the method of Shor's algorithm including an excursion into quantum mechanics and quantum computing introducing an a…
A Statistical Comparison of Objective Functions for the Vehicle Routing Problem with Route Balancing
Jairo Lozano, Luis C. González-Gurrola, Eduardo Rodríguez-Tello +1
The Vehicle Routing Problem with Route Balancing (VRPRB) is a biobjective version of the original Vehicle Routing Problem (VRP) in which, besides minimizing the total distance trav…