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...
Na minha lista:
| Principais autores: | , , , , , |
|---|---|
| Formato: | Artigo |
| Idioma: | Inglês |
| Publicado em: |
SpringerOpen
2025-01-01
|
| coleção: | Data Science and Engineering |
| Assuntos: | |
| Acesso em linha: | https://doi.org/10.1007/s41019-024-00269-4 |
| Tags: |
Sem tags, seja o primeiro a adicionar uma tag!
|