An edge-based and subspace reduction encoding scheme to solve the traveling salesman problem in quantum computers

Anandu Kalleri Madhu, Chi-Kwong Li, Jami Rönkkö +2

This paper introduces a novel edge-based encoding technique for solving the Traveling Salesman Problem (TSP) on a quantum computer, reducing the required number of qubits. For impl…