Tootfinder

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
Sergio Mu\~niz Subi\~nas, Jorge Mart\'inez Mart\'in, Alejandro Mata Ali, Javier Sedano, \'Angel Miguel Garc\'ia-Vico
https://arxiv.org/abs/2506.11711

Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
In this paper, we present two tensor network quantum-inspired algorithms to solve the knapsack and the shortest path problems, and enables to solve some of its variations. These methods provide an exact equation which returns the optimal solution of the problems. As in other tensor network algorithms for combinatorial optimization problems, the method is based on imaginary time evolution and the implementation of restrictions in the tensor network. In addition, we introduce the use of symmetrie…