Abstract: In this paper we present a Variational Quantum Algorithm (VQA) for solving the Traveling Salesman Problem (TSP) that requires only $\mathcal{O}(n \log n)$ qubits and an ansatz whose topology ...
Abstract: The Travelling Salesman Problem (TSP) is a well known method for the optimisation problem that asks you to find the shortest route that visits each city in a set exactly once and then goes ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results