Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userComment on Speed Limit for Classical Stochastic Processes
133
0
0.0
(
0
)
Authors
Yunxin Zhang
Ask ChatGPT about the research
No Arabic abstract
In recent letter [Phys. Rev. Lett {bf 121}, 070601 (2018), arXiv:1802.06554], the speed limit for classical stochastic Markov processes is considered, and a trade-off inequality between the speed of the state transformation and the entropy production is given. In this comment, a more accurate inequality will be presented.
rate research
Read More
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 consider 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.
Quantifying how distinguishable two stochastic processes are lies at the heart of many fields, such as machine learning and quantitative finance. While several measures have been proposed for this task, none have universal applicability and ease of use. In this Letter, we suggest a set of requirements for a well-behaved measure of process distinguishability. Moreover, we propose a family of measures, called divergence rates, that satisfy all of these requirements. Focussing on a particular member of this family -- the co-emission divergence rate -- we show that it can be computed efficiently, behaves qualitatively similar to other commonly-used measures in their regimes of applicability, and remains well-behaved in scenarios where other measures break down.
We study the spectral properties of classical and quantum Markovian processes that are reset at random times to a specific configuration or state with a reset rate that is independent of the current state of the system. We demonstrate that this simple reset dynamics causes a uniform shift in the eigenvalues of the Markov generator, excluding the zero mode corresponding to the stationary state, which has the effect of accelerating or even inducing relaxation to a stationary state. Based on this result, we provide expressions for the stationary state and probability current of the reset process in terms of weighted sums over dynamical modes of the reset-free process. We also discuss the effect of resets on processes that display metastability. We illustrate our results with two classical stochastic processes, the totally asymmetric random walk and the one-dimensional Brownian motion, as well as two quantum models: a particle coherently hopping on a chain and the dissipative transverse field Ising model, known to exhibit metastability.
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.
We reply to Comment by J. Gemmer, L. Knipschild, R. Steinigeweg (arXiv:1712.02128) on our paper Phys. Rev. Lett. 119, 100601 (2017).
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
