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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call