اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدConnection between matrix-product states and superposition of Bernoulli shock measures
107
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a generalized coagulation-decoagulation system on a one-dimensional discrete lattice with reflecting boundaries. It is known that a Bernoulli shock measure with two shock fronts might have a simple random-walk dynamics, provided that some constraints on the microscopic reaction rates of this system are fulfilled. Under these constraints the steady-state of the system can be written as a linear superposition of such shock measures. We show that the coefficients of this expansion can be calculated using the finite-dimensional representation of the quadratic algebra of the system obtained from a matrix-product approach.
قيم البحث
اقرأ أيضاً
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.
We revisit the question of describing critical spin systems and field theories using matrix product states, and formulate a scaling hypothesis in terms of operators, eigenvalues of the transfer matrix, and lattice spacing in the case of field theorie
s. Critical exponents and central charge are determined by optimizing the exponents such as to obtain a data collapse. We benchmark this method by studying critical Ising and Potts models, where we also obtain a scaling ansatz for the correlation length and entanglement entropy. The formulation of those scaling functions turns out to be crucial for studying critical quantum field theories on the lattice. For the case of $lambdaphi^4$ with mass $mu^2$ and lattice spacing $a$, we demonstrate a double data collapse for the correlation length $ delta xi(mu,lambda,D)=tilde{xi} left((alpha-alpha_c)(delta/a)^{-1/ u}right)$ with $D$ the bond dimension, $delta$ the gap between eigenvalues of the transfer matrix, and $alpha_c=mu_R^2/lambda$ the parameter which fixes the critical quantum field theory.
Recent work has shown the effectiveness of tensor network methods for computing large deviation functions in constrained stochastic models in the infinite time limit. Here we show that these methods can also be used to study the statistics of dynamic
al observables at arbitrary finite time. This is a harder problem because, in contrast to the infinite time case where only the extremal eigenstate of a tilted Markov generator is relevant, for finite time the whole spectrum plays a role. We show that finite time dynamical partition sums can be computed efficiently and accurately in one dimension using matrix product states, and describe how to use such results to generate rare event trajectories on demand. We apply our methods to the Fredrickson-Andersen (FA) and East kinetically constrained models, and to the symmetric simple exclusion process (SSEP), unveiling dynamical phase diagrams in terms of counting field and trajectory time. We also discuss extensions of this method to higher dimensions.
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 probab
ility 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.
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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
