# Computational complexity of PEPS zero testing

@article{Scarpa2018ComputationalCO, title={Computational complexity of PEPS zero testing}, author={G. Scarpa and A. Molnar and Y. Ge and J. Garc{\'i}a-Ripoll and N. Schuch and D. P{\'e}rez-Garc{\'i}a and S. Iblisdir}, journal={arXiv: Quantum Physics}, year={2018} }

Projected entangled pair states aim at describing lattice systems in two spatial dimensions that obey an area law. They are specified by associating a tensor with each site, and they are generated by patching these tensors. We consider the problem of determining whether the state resulting from this patching is null, and prove it to be NP-hard; the PEPS used to prove this claim have a boundary and are homogeneous in their bulk. A variation of this problem is next shown to be undecidable. These… CONTINUE READING

6 Citations

Oracle complexity classes and local measurements on physical Hamiltonians

- Computer Science, Physics
- 2020

- 2
- PDF

Symmetries in topological tensor network states: classification, construction and detection

- Mathematics, Physics
- 2019

Mixed states in one spatial dimension: decompositions and correspondence with nonnegative matrices

- Physics, Mathematics
- 2019

- 6
- PDF

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 22 REFERENCES

A: Math

- 1982

Phys

- 2014

Quantum Information & Computation 15

- 2015

Adv

- 2008

Invent

- 1971

Invent

- 1971

Mech

- 2007

Nature 528

- 2015

Phys

- 2010