Pith. sign in

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

arxiv 2405.09952 v1 pith:UNKH5TXQ submitted 2024-05-16 math.NA cs.NA

classification math.NAcs.NA
keywords operatorsmatrixtensornetworktreeconnectioninteractioninteractions
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Automatic partitioning for the low-rank integration of stochastic Boolean reaction networks

    math.NA 2025-01 conditional novelty 6.0 of 10

    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...

Pith tools