Related papers: How not to scramble a Rubik's cube

In warehouse and manufacturing environments, manipulation platforms are frequently deployed at conveyor belts to perform pick and place tasks. Because objects on the conveyor belts are moving, robots have limited time to pick them up. This…

In a series of recent works, Boyd, Diaconis, and their co-authors have introduced a semidefinite programming approach for computing the fastest mixing Markov chain on a graph of allowed transitions, given a target stationary distribution.…

This article aims to investigate sufficient conditions for the stability of stochastic differential equations with a random structure, particularly in contexts involving the presence of concentration points. The proof of asymptotic…

We consider a class of discrete time Markov chains with state space [0,1] and the following dynamics. At each time step, first the direction of the next transition is chosen at random with probability depending on the current location. Then…

This article provides the first procedure for computing a fully data-dependent interval that traps the mixing time $t_{\text{mix}}$ of a finite reversible ergodic Markov chain at a prescribed confidence level. The interval is computed from…

Out-of-Time-Order Correlators (OTOCs) quantify quantum information scrambling, but their connection to localized phase-space structures, such as chemical transition states, requires formal development. We derive a leading-order…

The rotor-router model is a deterministic process analogous to a simple random walk on a graph. This paper is concerned with a generalized model, functional-router model, which imitates a Markov chain possibly containing irrational…

The switch chain is a well-known Markov chain for sampling directed graphs with a given degree sequence. While not ergodic in general, we show that it is ergodic for regular degree sequences. We then prove that the switch chain is rapidly…

Fast scrambling of quantum correlations, reflected by the exponential growth of Out-of-Time-Order Correlators (OTOCs) on short pre-Ehrenfest time scales, is commonly considered as a major quantum signature of unstable dynamics in quantum…

Operator growth in spatially local quantum many-body systems defines a scrambling velocity. We prove that this scrambling velocity bounds the state dependence of the out-of-time-ordered correlator in local lattice models. We verify this…

In this paper we consider stopping problems for continuous-time Markov chains under a general risk-sensitive optimization criterion for problems with finite and infinite time horizon. More precisely our aim is to maximize the certainty…

We show that it is impossible to determine the time a tunneling particle spends under the barrier. However, it is possible to determine the asymptotic time, i.e., the time the particle spends in a large area including the barrier. We…

In this work the stability of perturbed linear time-varying systems is studied. The main features of the problem are threefold. Firstly, the time-varying dynamics is not required to be continuous but allowed to have jumps. Also the system…

Quantum information scrambling under many-body dynamics is of fundamental interest. The tripartite mutual information can quantify the scrambling via its negative value. Here, we first study the quench dynamics of tripartite mutual…

We study the problem of characterizing the expected hitting times for a robust generalization of continuous-time Markov chains. This generalization is based on the theory of imprecise probabilities, and the models with which we work…

We consider a class of relaxation problems mixing slow and fast variations which can describe population dynamics models or hyperbolic systems, with varying stiffness (from non-stiff to strongly dissipative), and develop a multi-scale…

We study the relaxation time in the random walk with jumps. The random walk with jumps combines random walk based sampling with uniform node sampling and improves the performance of network analysis and learning tasks. We derive various…

We study a classical model for the accumulation of errors in multi-qubit quantum computations. By modeling the error process in a quantum computation using two coupled Markov chains, we are able to capture a weak form of time-dependency…

Motivated by the question of whether all fast scramblers are holographically dual to quantum gravity, we study the dynamics of a non-integrable spin chain model composed of two ingredients - a nearest neighbor Ising coupling, and an…

We present a loosely coupled, non-iterative time-splitting scheme based on Robin-Robin coupling conditions. We apply a novel unified analysis for this scheme applied to both a Parabolic/Parabolic coupled system and a Parabolic/Hyperbolic…