Cargando…
Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem
The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in computer science to study the effectiveness of computing models and hardware platforms. In this regard, it is also heavily used as a vehicle to study the feasibility of the quantum computing paradigm for this clas...
| Autores principales: | , , , , , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
MDPI
2023
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC10453117/ https://www.ncbi.nlm.nih.gov/pubmed/37628268 http://dx.doi.org/10.3390/e25081238 |