A tensor-network branch-and-bound solver is slower and slightly less accurate than Ising machines on large random Pegasus and Zephyr spin glasses, but beats them on planted-instance energy.
A particular challenge here is the bond dimensions of MPO tensors (siteandmediating tensors); see the previous section
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cond-mat.dis-nn 1years
2024 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Limitations of tensor network approaches for optimization and sampling: A comparison to quantum and classical Ising machines
A tensor-network branch-and-bound solver is slower and slightly less accurate than Ising machines on large random Pegasus and Zephyr spin glasses, but beats them on planted-instance energy.