Comparative Study of Variations in Quantum Approximate Optimization Algorithms for the Traveling Salesman Problem

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

Full description

Bibliographic Details
Main Authors: Wenyang Qian, Robert A. M. Basili, Mary Mehrnoosh Eshaghian-Wilner, Ashfaq Khokhar, Glenn Luecke, James P. Vary
Format: Article
Language:English
Published: MDPI AG 2023-08-01
Series:Entropy
Subjects:
quantum computing
quantum simulation
quantum approximate optimization algorithm
traveling salesman problem
noisy simulation
Online Access:https://www.mdpi.com/1099-4300/25/8/1238

Internet

https://www.mdpi.com/1099-4300/25/8/1238

Similar Items