A tensor network with imaginary time evolution represents the knapsack and shortest path problems, with the optimal solution identified as the largest amplitude after contraction.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
A tensor network with imaginary time evolution represents the knapsack and shortest path problems, with the optimal solution identified as the largest amplitude after contraction.