Richard H. Warren, "Benchmarking Quantum Optimization by Traveling Salesman Problems," International Journal on Applied Physics and Engineering, vol. 3, pp. 102-109, 2024, DOI:10.37394/232030.2024.3.14
Richard H. Warren. Benchmarking Quantum Optimization by Traveling Salesman Problems.
International Journal on Applied Physics and Engineering. 2024;3:102-109. 10.37394/232030.2024.3.14
International Journal on Applied Physics and Engineering
E-ISSN: 2945-0489
Volume 3, 2024
Benchmarking Quantum Optimization by Traveling Salesman Problems
Author:
Abstract: This paper recommends symmetric traveling salesman problems (TSPs) be used to benchmark quantum capability to find optimal solutions for combinatorial optimization problems. We add four features to the existing list of reasons supporting this recommendation. We discuss benchmark measures and how to overcome the lack of small TSP examples for standards. Significate open questions are identified. We comment about published articles related to the benchmark theme.
Keywords:
quantum computing, optimization, benchmark, optimal solution, traveling salesman problem, TSP library
Pages: 102-109 DOI: 10.37394/232030.2024.3.14WSEAS Transactions on International Journal on Applied Physics and Engineering, E-ISSN: 2945-0489, Volume 3, 2024, Art. #14
×
Citation Tools