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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
unclear 1representative citing papers
Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.
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.
-
Clifford-deformed zero-rate LDPC codes with 50% biased noise thresholds
Clifford-deformed zero-rate LDPC codes achieve code-capacity thresholds approaching 50% under i.i.d. pure dephasing when the number of biased logical operators scales slower than distance or overlaps satisfy stated conditions, with new examples from tile codes.