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ón completa

Detalles Bibliográficos

Autores principales:	Meng Shi, Sai Wu, Ying Li, Gongsheng Yuan, Chang Yao, Gang Chen
Formato:	Artigo
Lenguaje:	Inglês
Publicado:	SpringerOpen 2025-01-01
Colección:	Data Science and Engineering
Materias:	Quantum computing Variational quantum algorithms Combinatorial optimization problem Traveling salesman problem
Acceso en línea:	https://doi.org/10.1007/s41019-024-00269-4
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!