---
res:
bibo_abstract:
- "Tensor networks are a central tool in condensed matter physics. In this paper,
we initiate the study of tensor network non-zero testing (TNZ): Given a tensor
network T, does T represent a non-zero vector? We show that TNZ is not in the
Polynomial-Time Hierarchy unless the hierarchy collapses. We next show (among
other results) that the special cases of TNZ on non-negative and injective tensor
networks are in NP. Using this, we make a simple observation: The commuting variant
of the MA-complete stoquastic k-SAT problem on D-dimensional qudits is in NP for
logarithmic k and constant D. This reveals the first class of quantum Hamiltonians
whose commuting variant is known to be in NP for all (1) logarithmic k, (2) constant
D, and (3) for arbitrary interaction graphs.\r\n@eng"
bibo_authorlist:
- foaf_Person:
foaf_givenName: Sevag
foaf_name: Gharibian, Sevag
foaf_surname: Gharibian
foaf_workInfoHomepage: http://www.librecat.org/personId=71541
orcid: 0000-0002-9992-3379
- foaf_Person:
foaf_givenName: Zeph
foaf_name: Landau, Zeph
foaf_surname: Landau
- foaf_Person:
foaf_givenName: Seung
foaf_name: Woo Shin, Seung
foaf_surname: Woo Shin
- foaf_Person:
foaf_givenName: Guoming
foaf_name: Wang, Guoming
foaf_surname: Wang
bibo_issue: 9{\&}10
bibo_volume: 15
dct_date: 2015^xs_gYear
dct_language: eng
dct_title: Tensor network non-zero testing@
...