Pith. sign in

REVIEW 1 cited by

Using matrix product states to study the dynamical large deviations of kinetically constrained 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

arxiv 1903.01570 v2 pith:HNVIMXDF submitted 2019-03-04 cond-mat.stat-mech quant-ph

classification cond-mat.stat-mechquant-ph
keywords modelsdynamicalconstrainedkcmskineticallylargematrixproduct
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Here we demonstrate that tensor network techniques - originally devised for the analysis of quantum many-body problems - are well suited for the detailed study of rare event statistics in kinetically constrained models (KCMs). As concrete examples we consider the Fredrickson-Andersen and East models, two paradigmatic KCMs relevant to the modelling of glasses. We show how variational matrix product states allow to numerically approximate - systematically and with high accuracy - the leading eigenstates of the tilted dynamical generators which encode the large deviation statistics of the dynamics. Via this approach we can study system sizes beyond what is possible with other methods, allowing us to characterise in detail the finite size scaling of the trajectory-space phase transition of these models, the behaviour of spectral gaps, and the spatial structure and "entanglement" properties of dynamical phases. We discuss the broader implications of our results.

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. Evolutionary reinforcement learning of dynamical large deviations

    cond-mat.stat-mech 2019-09 conditional novelty 6.0 of 10

    An evolutionary algorithm that mutates a reference model's rates or neural-network weights produces tight upper bounds on dynamical large-deviation rate functions, matching exact results on three test models.

Pith tools