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...

Description complète

Détails bibliographiques

Auteurs principaux:	Meng Shi, Sai Wu, Ying Li, Gongsheng Yuan, Chang Yao, Gang Chen
Format:	Artigo
Langue:	Inglês
Publié:	SpringerOpen 2025-01-01
Collection:	Data Science and Engineering
Sujets:	Quantum computing Variational quantum algorithms Combinatorial optimization problem Traveling salesman problem
Accès en ligne:	https://doi.org/10.1007/s41019-024-00269-4
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!