اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDynamical simulations of classical stochastic systems using matrix product states
316
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We adapt the time-evolving block decimation (TEBD) algorithm, originally devised to simulate the dynamics of 1D quantum systems, to simulate the time-evolution of non-equilibrium stochastic systems. We describe this method in detail; a systems probability distribution is represented by a matrix product state (MPS) of finite dimension and then its time-evolution is efficiently simulated by repeatedly updating and approximately re-factorizing this representation. We examine the use of MPS as an approximation method, looking at parallels between the interpretations of applying it to quantum state vectors and probability distributions. In the context of stochastic systems we consider two types of factorization for use in the TEBD algorithm: non-negative matrix factorization (NMF), which ensures that the approximate probability distribution is manifestly non-negative, and the singular value decomposition (SVD). Comparing these factorizations we find the accuracy of the SVD to be substantially greater than current NMF algorithms. We then apply TEBD to simulate the totally asymmetric simple exclusion process (TASEP) for systems of up to hundreds of lattice sites in size. Using exact analytic results for the TASEP steady state, we find that TEBD reproduces this state such that the error in calculating expectation values can be made negligible, even when severely compressing the description of the system by restricting the dimension of the MPS to be very small. Out of the steady state we show for specific observables that expectation values converge as the dimension of the MPS is increased to a moderate size.
قيم البحث
اقرأ أيضاً
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.
The power of matrix product states to describe infinite-size translational-invariant critical spin chains is investigated. At criticality, the accuracy with which they describe ground state properties of a system is limited by the size $chi$ of the m
atrices that form the approximation. This limitation is quantified in terms of the scaling of the half-chain entanglement entropy. In the case of the quantum Ising model, we find $S sim {1/6}log chi$ with high precision. This result can be understood as the emergence of an effective finite correlation length $xi_chi$ ruling of all the scaling properties in the system. We produce five extra pieces of evidence for this finite-$chi$ scaling, namely, the scaling of the correlation length, the scaling of magnetization, the shift of the critical point, and the scaling of the entanglement entropy for a finite block of spins. All our computations are consistent with a scaling relation of the form $xi_chisim chi^{kappa}$, with $kappa=2$ for the Ising model. In the case of the Heisenberg model, we find similar results with the value $kappasim 1.37$. We also show how finite-$chi$ scaling allow to extract critical exponents. These results are obtained using the infinite time evolved block decimation algorithm which works in the thermodynamical limit and are verified to agree with density matrix renormalization group results.
The large deviation (LD) statistics of dynamical observables is encoded in the spectral properties of deformed Markov generators. Recent works have shown that tensor network methods are well suited to compute the relevant leading eigenvalues and eige
nvectors accurately. However, the efficient generation of the corresponding rare trajectories is a harder task. Here we show how to exploit the MPS approximation of the dominant eigenvector to implement an efficient sampling scheme which closely resembles the optimal (so-called Doob) dynamics that realises the rare events. We demonstrate our approach on three well-studied lattice models, the Fredrickson-Andersen and East kinetically constrained models (KCMs), and the symmetric simple exclusion process (SSEP). We discuss how to generalise our approach to higher dimensions.
We describe a possible general and simple paradigm in a classical thermal setting for discrete time crystals (DTCs), systems with stable dynamics which is subharmonic to the driving frequency thus breaking discrete time-translational invariance. We c
onsider specifically an Ising model in two dimensions, as a prototypical system with a phase transition into stable phases distinguished by a local order parameter, driven by a thermal dynamics and periodically kicked. We show that for a wide parameter range a stable DTC emerges. The phase transition to the DTC state appears to be in the equilibrium 2D Ising class when dynamics is observed stroboscopically. However, we show that the DTC is a genuine non-equilibrium state. More generally, we speculate that systems with thermal phase transitions to multiple competing phases can give rise to DTCs when appropriately driven.
We quantify how well matrix product states approximate exact ground states of 1-D quantum spin systems as a function of the number of spins and the entropy of blocks of spins. We also investigate the convex set of local reduced density operators of t
ranslational invariant systems. The results give a theoretical justification for the high accuracy of renormalization group algorithms, and justifies their use even in the case of critical systems.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
