REVIEW 1 cited by
Low-rank Tree Tensor Network Operators for Long-Range Pairwise Interactions
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Compactly representing and efficently applying linear operators are fundamental ingredients in tensor network methods for simulating quantum many-body problems and solving high-dimensional problems in scientific computing. In this work, we study such representations for tree tensor networks, the so called tree tensor network operators (TTNOs), paying particular attention to Hamiltonian operators that involve long-range pairwise interactions between particles. Generalizing the work by Lin, Tong, and others on matrix product operators, we establish a direct connection between the hierarchical low-rank structure of the interaction matrix and the TTNO property. This connection allows us to arrive at very compact TTNO representations by compressing the interaction matrix into a hierarchically semi-separable matrix. Numerical experiments for different quantum spin systems validate our results and highlight the potential advantages of TTNOs over matrix product operators.
Forward citations
Cited by 1 Pith paper
-
Automatic partitioning for the low-rank integration of stochastic Boolean reaction networks
A Kernighan-Lin plus information-entropy heuristic automatically partitions Boolean reaction networks for low-rank master equation integration, outperforming manual and cut-minimal partitions in tests on mTOR, pancrea...
Discussion (0). Continue with ORCID to comment.