Related papers: How not to scramble a Rubik's cube
This simple note lays out a few observations which are well known in many ways but may not have been said in quite this way before. The basic idea is that when comparing two different Markov chains it is useful to couple them is such a way…
Tripartite mutual information (TMI) is an efficient observable to quantify the ability of scrambler for unitary time-evolution operator with quenched many-body Hamiltonian. In this paper, we give numerical demonstrations of the TMI in…
The paper is largely of a review nature. It considers two main methods used to study stability and obtain appropriate quantitative estimates of perturbations of (inhomogeneous) Markov chains with continuous time and a finite or countable…
Focusing on semiclassical systems, we show that the parametrically long exponential growth of out-of-time order correlators (OTOCs), also known as scrambling, does not necessitate chaos. Indeed, scrambling can simply result from the…
We construct strong stationary dual chains for Ising model on a circle, non-symmetric random walk on square lattice and a random walk on hypercube. The strong stationary dual chains are all sharp and have the same state space as original…
This paper develops the first method for the exact simulation of reflected Brownian motion (RBM) with non-stationary drift and infinitesimal variance. The running time of generating exact samples of non-stationary RBM at any time $t$ is…
We show that for a non-trivial transitive dynamical system, it has a dense Mycielski invariant strongly scrambled set if and only if it has a fixed point, and it has a dense Mycielski invariant $\delta$-scrambled set for some $\delta>0$ if…
We develop infinitary analogues of the $N\times N\times N$ Rubik's cube. We'll be pushed to consider the possibility of transfinitely many twists and the foremost question we shall study is whether or not all infinite scrambles are…
Quantum information scrambling refers to the loss of local recoverability of quantum information, which has found widespread attention from high energy physics to quantum computing. In the present analysis we propose a possible starting…
Suppose that $\mathcal C$ is a finite collection of patterns. Observe a Markov chain until one of the patterns in $\mathcal C$ occurs as a run. This time is denoted by $\tau$. In this paper, we aim to give an easy way to calculate the mean…
Run-and-tumble particles constitute one of the simplest models of self-propelled active matter, and provide an ideal playground to the understanding of out-of-equilibrium systems. We consider an idealized setup where one such particle is…
In this paper we compute the stopping times in the game Rock-Paper-Scissors. By exploiting the recurrence relation we compute the mean values of stopping times. On the other hand, by constructing a transition matrix for a Markov chain…
In a fast scrambling many-body quantum system, information is spread and entanglement is built up on a timescale that grows logarithmically with the system size. This is of fundamental interest in understanding the dynamics of many-body…
We address a class of Markov jump linear systems that are characterized by the underlying Markov process being time-inhomogeneous with a priori unknown transition probabilities. Necessary and sufficient conditions for uniform stochastic…
Information in a chaotic quantum system will scramble across the system, preventing any local measurement from reconstructing it. The scrambling dynamics is key to understanding a wide range of quantum many-body systems. Here we use Holevo…
A large cloud of $^{87}$Rb atoms confined in a magneto-optical trap exhibits, in a certain regime of parameters, spatio-temporal instabilities with a dynamics resembling that of a turbulent fluid. We apply the methods of turbulence theory…
We propose and analyze a protocol to study quantum information scrambling using statistical correlations between measurements, which are performed after evolving a quantum system from randomized initial states. We prove that the resulting…
The Rubix Cube is a 3-dimensional single-player combination puzzle attracting attention in the reinforcement learning community. A Rubix Cube has six faces and twelve possible actions, leading to a small and unconstrained action space and a…
Quantum simulation elucidates properties of quantum many-body systems by mapping its Hamiltonian to a better-controlled system. Being less stringent than a universal quantum computer, noisy small- and intermediate-scale quantum simulators…
Motivated by robotic surveillance applications, this paper studies the novel problem of maximizing the return time entropy of a Markov chain, subject to a graph topology with travel times and stationary distribution. The return time entropy…