Efficient Application of Tensor Network Operators to Tensor Network States Through Successive Deterministic Compression

Abstract:We introduce an algorithm to apply tree tensor network operators to tree tensor network states followed by compression. Especially when applying a matrix product operator to matrix product states, this serves as a key subroutine in tensor network algorithms. We name the method successive deterministic compression (SDC). We compare SDC to existing operator application and compression algorithms in benchmarks involving random tensor network operators and states, as well as circuit simulation with standard entangling gates. We find that successive deterministic compression is consistently among the best-performing techniques when the tensor network state (after the operator application) is not highly compressible. Our results also highlight the flexibility of general tree tensor network structures for simulating circuits with long-range entanglement.

Quantum Physics (quant-ph); Strongly Correlated Electrons (cond-mat.str-el); Chemical Physics (physics.chem-ph)

arXiv:2601.19650 [quant-ph]

(or arXiv:2601.19650v3 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2601.19650 Focus to learn more arXiv-issued DOI via DataCite

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.