REVIEW 1 cited by
Low-rank quantics tensor train representations of Feynman diagrams for multiorbital electron-phonon models
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
Feynman diagrams are an essential tool for simulating strongly correlated electron systems. However, stochastic quantum Monte Carlo sampling suffers from the sign problem, particularly when solving a multiorbital quantum impurity model. Recently, two approaches have been proposed for efficient numerical treatment of Feynman diagrams: Tensor Cross Interpolation (TCI) to replace stochastic sampling and the Quantics Tensor Train (QTT) representation for compressing space-time dependence. One of the remaining challenges is the nontrivial task of identifying low-rank structures in weak-coupling Feynman diagrams for multiorbital electron-phonon systems. In particular, the traditional TCI algorithm faces an ergodicity problem, which prevents it from fully exploring the multiorbital space. To address this, we incorporate a new algorithm called global search, which resolves this issue. By combining this approach with QTT, we uncover low-rank structures and achieve efficient numerical integration with exponential resolution in time and faster-than-power-law convergence of error relative to computational cost. Additionally, our approach does not require the division of discontinuous regions necessary in non-quantics TCI.
Forward citations
Cited by 1 Pith paper
-
Inchworm tensor train hybridization expansion quantum impurity solver
A tensor-train inchworm hybridization-expansion solver is benchmarked against exact solutions, but its multi-orbital results bypass the inchworm propagation step by substituting the exact diagonalization propagator.
Discussion (0). Continue with ORCID to comment.