Solving larger Travelling Salesman Problem networks with a penalty-free Variational Quantum Algorithm
Researchers developed a penalty-free Variational Quantum Algorithm (VQA) to solve larger Travelling Salesman Problem (TSP) networks on quantum devices. The VQA scales efficiently with O(nlog2(n)) qubits, mapping bit strings directly to TSP cycles. While it didn't beat Monte Carlo for small networks, the method shows promise for larger problems when run on real quantum hardware.