For PEPS with strong injectivity above a threshold, belief propagation finds fixed points efficiently and cluster-corrected BP approximates observables to 1/poly(N) error in poly(N) time, with local perturbations affecting the fixed point only locally.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Algorithmic Locality via Provable Convergence in Quantum Tensor Networks
For PEPS with strong injectivity above a threshold, belief propagation finds fixed points efficiently and cluster-corrected BP approximates observables to 1/poly(N) error in poly(N) time, with local perturbations affecting the fixed point only locally.