A benchmark for quantum optimization: the traveling salesman
Richard H. Warren · Quantum Information and Computation · 2021
We present compelling reasons for symmetric traveling salesman problems (TSPs) to be the benchmark for quantum computing of combinatorial optimization problems for all types of quantum hardware. There are seven reasons for endorsing these TSPs to be the benchmark and no shortcomings.