Polynomial-time Solver of Tridiagonal QUBO, QUDO and Tensor QUDO problems with Tensor Networks

TL;DR

This paper introduces a quantum-inspired tensor network algorithm that efficiently solves tridiagonal QUBO, QUDO, and tensor QUDO problems, providing exact solutions and outperforming classical solvers in quality.

Contribution

The paper presents a novel tensor network-based algorithm for solving specific quadratic and tensor optimization problems with polynomial complexity and parallelization capabilities.

Findings

The algorithm provides exact solutions for the targeted problems.

It improves solution quality compared to classical solvers.

The method is scalable and parallelizable.

Abstract

We present a quantum-inspired tensor network algorithm for solving tridiagonal Quadratic Unconstrained Binary Optimization (QUBO) problems and quadratic unconstrained discrete optimization (QUDO) problems. We also solve the more general Tensor quadratic unconstrained discrete optimization (T-QUDO) problems with one-neighbor interactions in a lineal chain. This method provides an exact and explicit equation for these problems. Our algorithms are based on the simulation of a state that undergoes imaginary time evolution and a Half partial trace. In addition, we address the degenerate case and evaluate the polynomial complexity of the algorithm, also providing a parallelized version. We implemented and tested them with other well-known classical algorithms and observed an improvement in the quality of the results. The performance of the proposed algorithms is compared with the Google OR-TOOLS and dimod solvers, improving their results.