Pith. sign in

REVIEW

Efficient mapping for Anderson impurity problems with matrix product states

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 2012.01424 v1 pith:IY6HJVXO submitted 2020-12-02 cond-mat.str-el quant-ph

Efficient mapping for Anderson impurity problems with matrix product states

classification cond-mat.str-el quant-ph
keywords andersonefficientimpuritymappingmatrixproblemsproductstates
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

We propose an efficient algorithm to numerically solve Anderson impurity problems using matrix product states. By introducing a modified chain mapping we obtain significantly lower entanglement, as compared to all previous attempts, while keeping the short-range nature of the couplings. Our approach naturally extends to finite temperatures, with applications to dynamical mean field theory, non-equilibrium dynamics and quantum transport.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.