Sign problem in tensor network contraction

We investigate how the computational difficulty of contracting tensor networks depends on the sign structure of the tensor entries. Using results from computational complexity, we observe that the approximate contraction of tensor networks with only positive entries has lower complexity. This raises...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Chen, Jielun, Jiang, Jiaqing, Hangleiter, Dominik, Schuch, Norbert
Format:	Artikel
Sprache:	eng
Schlagworte:	Physics - Computational Physics Physics - Quantum Physics Physics - Statistical Mechanics Physics - Strongly Correlated Electrons
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!