Polynomial-time Solver of Tridiagonal QUBO and QUDO problems with Tensor Networks
arxiv(2023)
摘要
We present an algorithm for solving tridiagonal Quadratic Unconstrained
Binary Optimization (QUBO) problems and Quadratic Unconstrained Discrete
Optimization (QUDO) problems with one-neighbor interactions using the
quantum-inspired technology of tensor networks. Our method is based on the
simulation of a quantum state to which we will apply an imaginary time
evolution and perform a series of partial traces to obtain the state of maximum
amplitude, since it will be the optimal state. We will also deal with the
degenerate case and check the polynomial complexity of the algorithm.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要