Related papers: Fast Scramblers, Democratic Walks and Information …
Analyzing the mixing time of random walks is a well-studied problem with applications in random sampling and more recently in graph partitioning. In this work, we present new analysis of random walks and evolving sets using more…
A random walk is a basic stochastic process on graphs and a key primitive in the design of distributed algorithms. One of the most important features of random walks is that, under mild conditions, they converge to a stationary distribution…
Random walks are studied on disordered cellular networks in 2-and 3-dimensional spaces with arbitrary curvature. The coefficients of the evolution equation are calculated in term of the structural properties of the cellular system. The…
We consider the problem of how fast a quantum system can scramble (thermalize) information, given that the interactions are between bounded clusters of degrees of freedom; pairwise interactions would be an example. Based on previous work,…
We present a general approach to study the flooding time (a measure of how fast information spreads) in dynamic graphs (graphs whose topology changes with time according to a random process). We consider arbitrary converging Markovian…
The evolution of many dynamical systems that describe relationships or interactions between objects can be effectively modeled by temporal networks, which are typically represented as a sequence of static network snapshots. In this paper,…
Fast scramblers are dynamical quantum systems that produce many-body entanglement on a timescale that grows logarithmically with the system size $N$. We propose and investigate a family of deterministic, fast scrambling quantum circuits…
Uncertainty persists over how and why some countries become democratic and others do not, or why some countries remain democratic and others 'backslide' toward autocracy. Furthermore, while scholars generally agree on the nature of…
We perform simulations for one dimensional continuous-time random walks in two dynamic random environments with fast (independent spin-flips) and slow (simple symmetric exclusion) decay of space-time correlations, respectively. We focus on…
We study the entanglement dynamics of discrete time quantum walks acting on bounded finite sized graphs. We demonstrate that, depending on system parameters, the dynamics may be monotonic, oscillatory but highly regular, or quasi-periodic.…
The information scrambling in many-body systems is closely related to quantum chaotic dynamics, complexity, and gravity. Here we propose a collision model to simulate the information dynamics in an all-optical system. In our model the…
Consider a discrete-time quantum walk on the $N$-cycle subject to decoherence both on the coin and the position degrees of freedom. By examining the evolution of the density matrix of the system, we derive some new conclusions about the…
The black hole information paradox remains a profound challenge in theoretical physics. Among the proposed resolutions, the soft-hair approach stands out for its independence from any specific quantum gravity model. In this paper, we…
We consider a system of independent one-dimensional random walks in a common random environment under the condition that the random walks are transient with positive speed $v_P$. We give upper bounds on the quenched probability that at…
Many systems across the sciences evolve through a combination of multiplicative growth and diffusive transport. In the presence of disorder, these systems tend to form localized structures which alternate between long periods of relative…
Quantum speed limits set an upper bound to the rate at which a quantum system can evolve and as such can be used to analyze the scrambling of information. To this end, we consider the survival probability of a thermofield double state under…
In this article, we investigate the convergence behavior of two classes of gathering protocols with fixed circulant topologies using tools from dynamical systems. Given a fixed number of mobile entities moving in the Euclidean plane, we…
Scramble intersections stand as compelling examples of complex systems, shedding light on the pressing challenge of urban mobility. In this paper, we introduce a model aimed at unraveling the statistical intricacies of pedestrian crossing…
In this paper we study random walks on dynamical random environments in $1 + 1$ dimensions. Assuming that the environment is invariant under space-time shifts and fulfills a mild mixing hypothesis, we establish a law of large numbers and a…
Randomly breaking connections in a graph alters its transport properties, a model used to describe percolation. In the case of quantum walks, dynamic percolation graphs represent a special type of imperfections, where the connections appear…