A bit too much: Reducing the bit width of Ising models for quantum annealing

Given a list of cities and the distances between each pair of cities, how do you determine the shortest route that visits each city exactly once and returns to the starting location? This famous problem ...

Source : https://rss.app/articles/cb4e791f6f6d729c035c415131d9a78c441015360c70e0b190b3ca4ad4cb65cef652b2553d9c8675aae1332388094ed6318b2ca49f0f2a4ad56e943fd89c1d22cbf238be