Pith. sign in

REVIEW 1 cited by

Entanglement-based tensor-network strong-disorder renormalization group

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 2107.01555 v2 pith:SULBCQKR submitted 2021-07-04 cond-mat.str-el cond-mat.dis-nncond-mat.stat-mech

Entanglement-based tensor-network strong-disorder renormalization group

classification cond-mat.str-el cond-mat.dis-nncond-mat.stat-mech
keywords algorithmentanglement-basedrandomnesstsdrgaccuracygrouplatticemodels
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

We propose an entanglement-based algorithm of the tensor-network strong-disorder renormalization group (tSDRG) method for quantum spin systems with quenched randomness. In contrast to the previous tSDRG algorithm based on the energy spectrum of renormalized block Hamiltonians, we directly utilizes the entanglement structure associated with the blocks to be renormalized. We examine accuracy of the new algorithm for the random antiferromagnetic Heisenberg models on the one-dimensional, triangular, and square lattices. We then find that the entanglement-based tSDRG achieves better accuracy than the previous one for the square lattice model with weak randomness, while it is less efficient for the one-dimensional and triangular lattice models particularly in the strong randomness region. The theoretical background and possible improvements of the algorithm are also discussed.

discussion (0)

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

Forward citations

Cited by 1 Pith paper

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

  1. Uncertainty and Autarky: Cooperative Game Theory for Stable Local Energy Market Partitioning

    eess.SY 2026-03 unverdicted novelty 5.0

    Under deterministic prosumption the grand coalition is the optimal stable local-energy-market partition; under high congestion, individual autarky is; an algorithm covers the stochastic moderate-congestion case.