1 citations · 5 across the 10 of their papers we have counts for
7 papers · 1 filter
Foundations of photonic quantum computation
Martin Bombardelli, Gerard Fleury, Philippe Lacomme +1
This work aims to introduce the fundamental concepts required to perform computations on photonic quantum computers by presenting the gates specific to this architecture and highli…
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.…
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…
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…