Mixer Hamiltonian with QAOA for Max k-coloring : numerical evaluations - Archive ouverte HAL Accéder directement au contenu
Pré-Publication, Document De Travail Année : 2023

Mixer Hamiltonian with QAOA for Max k-coloring : numerical evaluations

Résumé

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 in QAOA algorithm and we can state that Mixer Hamiltonians are mapping functions from the set of qubit-strings to the set of solutions. Mixer Hamiltonian offers an approach very similar to indirect representations commonly used in routing or in scheduling community for decades. After the initial publication of Cheng et al. in 1996 (Cheng et al., 1996), numerous propositions in OR lies on 1-to-n mapping functions, including the split algorithm that transform one TSP solution into a VRP solution. The objective is at first to give a compact and readable presentation of these Mixer Hamiltonians considering the functional analogies that exist between the OR community practices and the quantum field. Our experiments encompass numerical evaluations of circuit using the Qiskit library of IBM meeting the theoretical considerations.
Fichier principal
Vignette du fichier
2207.11520.pdf (1.45 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03739442 , version 1 (11-10-2023)

Identifiants

Citer

Eric Bourreau, Gérard Fleury, Philippe Lacomme. Mixer Hamiltonian with QAOA for Max k-coloring : numerical evaluations. 2023. ⟨hal-03739442⟩
111 Consultations
67 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More