primary paper · identifier verified 2026-07-29

The computational complexity of PEPS

Norbert Schuch, Michael M. Wolf, Frank Verstraete, J. Ignacio Cirac · 2006

Identifier: arXiv:quant-ph/0611050
Canonical URL: https://arxiv.org/abs/quant-ph/0611050

Why it is in this atlas

Establishes hardness results for contracting PEPS — the reason higher-dimensional tensor networks are approximated, not contracted exactly.

Claims citing this source

tn-009 · Established resultPEPS extend tensor networks beyond one dimension, but exact contraction of PEPS is computationally hard.

Concepts citing this source

PEPS Contraction complexity