A tensor-network encoding of TSP tours with Boltzmann weighting and explicit constraint filters that supplies a marginal formula for optimal tours in the zero-temperature exact limit.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2023 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Tensor-Network Formulation of the Traveling Salesman Problem and Variants
A tensor-network encoding of TSP tours with Boltzmann weighting and explicit constraint filters that supplies a marginal formula for optimal tours in the zero-temperature exact limit.