Tytuł | Limitations of tensor-network approaches for optimization and sampling: A comparison to quantum and classical Ising machines |
Publication Type | Journal Article |
Rok publikacji | 2025 |
Autorzy | Dziubyna A, Śmierzchalski T, Gardas B, Rams M, Mohseni M |
Journal | Physical Review Applied |
Volume | 23 |
Issue | 5 |
Date Published | 05/2025 |
Słowa kluczowe | NP-hard problems, Projected entangled pair states, Quantum algorithms & computation, Random field Ising model, Simulated annealing, Spin glasses, Tensor network methods, Variational approach |
Abstract | Optimization problems pose challenges across various fields. In recent years, quantum annealers have emerged as a promising platform for tackling such challenges. Here, to provide an additional perspective, we develop a heuristic tensor-network-based algorithm to reveal the low-energy spectra of Ising spin-glass systems with interaction graphs relevant to present-day quantum annealers. Our deterministic approach combines a branch-and-bound search strategy with an approximate calculation of marginals via tensor-network contractions. Its application to quasi-two-dimensional lattices with large unit cells of up to 24 spins, realized in current quantum annealing processors, requires a dedicated approach that uses sparse structures in the tensor-network representation and GPU hardware acceleration. We benchmark our approach on random problems defined on Pegasus and Zephyr graphs with up to a few thousand spins, comparing it against the D-Wave Advantage quantum annealer and the simulated bifurcation algorithm, with the latter representing an emerging class of classical Ising solvers. In addition to examining the quality of the best solutions, we compare the diversity of low-energy states sampled by all the solvers. For the largest considered independent and identically distributed problems with over 5000 spins, the state-of-the-art tensor-network approaches lead to solutions that are 0.1% to 1% worse than the best solutions obtained by Ising machines while being 2 orders of magnitude slower. We attribute these results to approximate contraction failures. For embedded tile planting instances, our approach reaches approximately 0.1% from the planted ground state, a factor of 3 better than the Ising solvers. While all three methods can output diverse low-energy solutions—e.g., differing by at least a quarter of spins with energy error below 1%—our deterministic branch-and-bound approach finds sets of a few such states at most. In contrast, both Ising machines prove capable of sampling sets of thousands of such solutions. |
URL | https://link.aps.org/doi/10.1103/PhysRevApplied.23.054049 |
DOI | 10.1103/PhysRevApplied.23.054049 |