Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908407259201536 |
|---|---|
| author | Subiñas, Sergio Muñiz Martín, Jorge Martínez Ali, Alejandro Mata Sedano, Javier García-Vico, Ángel Miguel |
| author_facet | Subiñas, Sergio Muñiz Martín, Jorge Martínez Ali, Alejandro Mata Sedano, Javier García-Vico, Ángel Miguel |
| contents | 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 symmetries and the reutilization of intermediate calculations, reducing the computational complexity for both problems. To show the efficiency of our implementations, we carry out some performance experiments and compare the results with those obtained by other classical algorithms. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_11711 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective Subiñas, Sergio Muñiz Martín, Jorge Martínez Ali, Alejandro Mata Sedano, Javier García-Vico, Ángel Miguel Quantum Physics Emerging Technologies 68Q25, 90C27, 15A69 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 symmetries and the reutilization of intermediate calculations, reducing the computational complexity for both problems. To show the efficiency of our implementations, we carry out some performance experiments and compare the results with those obtained by other classical algorithms. |
| title | Knapsack and Shortest Path Problems Generalizations From A Quantum-Inspired Tensor Network Perspective |
| topic | Quantum Physics Emerging Technologies 68Q25, 90C27, 15A69 |
| url | https://arxiv.org/abs/2506.11711 |