A Quantum Framework for Combinatorial Optimization Problem over Graphs

Abstract Combinatorial optimization problems over graphs, such as the traveling salesman problem, longest path problem, and maximum independent set problem, are well-known for being computationally costly, some even NP-hard problems. In this paper, we propose a general quantum algorithm framework se...

Descripció completa

Dades bibliogràfiques

Autors principals:	Meng Shi, Sai Wu, Ying Li, Gongsheng Yuan, Chang Yao, Gang Chen
Format:	Artigo
Idioma:	Inglês
Publicat:	SpringerOpen 2025-01-01
Col·lecció:	Data Science and Engineering
Matèries:	Quantum computing Variational quantum algorithms Combinatorial optimization problem Traveling salesman problem
Accés en línia:	https://doi.org/10.1007/s41019-024-00269-4
Etiquetes:	Afegir etiqueta Sense etiquetes, Sigues el primer a etiquetar aquest registre!