相关论文: Rubik's Cube Scrambling Requires at Least 26 Rando…
This paper studies the random walk on the hypercube $(\mathbb{Z}/2\mathbb{Z})^n$ which at each step flips $k$ randomly chosen coordinates. We prove that the mixing time for this walk is of order $\frac{n}{k} \log n$. We also prove that if…
Random transformations are typically good at "scrambling" information. Specifically, in the quantum setting, scrambling usually refers to the process of mapping most initial pure product states under a unitary transformation to states which…
We consider the random walk on the hypercube which moves by picking an ordered pair $(i,j)$ of distinct coordinates uniformly at random and adding the bit at location $i$ to the bit at location $j$, modulo $2$. We show that this Markov…
The mixer chain on a graph G is the following Markov chain. Place tiles on the vertices of G, each tile labeled by its corresponding vertex. A "mixer" moves randomly on the graph, at each step either moving to a randomly chosen neighbor, or…
A simple way to sample a uniform triangulation of the sphere with a fixed number $n$ of vertices is a Monte-Carlo method: we start from an arbitrary triangulation and flip repeatedly a uniformly chosen edge. We give a lower bound in…
We study how many riffle shuffles are required to mix n cards if only certain features of the deck are of interest, e.g. suits disregarded or only the colors of interest. For these features, the number of shuffles drops from 3/2 log_2(n) to…
The first 2x2x2 twisty cube was created as a demonstration tool by Erno Rubik in 1974 to help his students understand the complexity of space and the movements in 3D. He fabricated a novel 3x3x3 mechanism where the 26 cubies were turning,…
In this paper we give a upper bound of 40 on Rubik's cube group. The previously known upper bound has been 42 since 1995. In order to prove our claim we use computational methods. The program used is GAP computer algebra. Further more we…
The core mechanical system is built around three stepper motors for physical manipulation, a microcontroller for hardware control, a camera and YOLO detection model for real-time cube state detection. A significant software component is the…
We describe in details the nxnxn Rubik's Cube, namely a Rubik's Cube with n rotating slices in each face. Then we state and prove the "first law of Cubology", i.e. the solvability criterion, for it
The Card-Cyclic-to-Random shuffle on $n$ cards is defined as follows: at time $t$ remove the card with label $t$ mod $n$ and randomly reinsert it back into the deck. Pinsky introduced this shuffle and asked how many steps are needed to mix…
This paper explores the mixing time of the random transposition walk on the symmetric group. While it has long been known that this walk mixes in order n*log(n) time, this result has not previously been attained using coupling. A coupling…
The mixing time of a discrete-time quantum walk on the hypercube is considered. The mean probability distribution of a Markov chain on a hypercube is known to mix to a uniform distribution in time O(n log n). We show that the mean…
The card-cyclic-to-random shuffle is the card shuffle where the $n$ cards are labeled $1,\ldots,n$ according to their starting positions. Then the cards are mixed by first picking card $1$ from the deck and reinserting it at a uniformly…
Consider an n by n array of cards shuffled in the following manner. An element x of the array is chosen uniformly at random; Then with probability 1/2 the rectangle of cards above and to the left of x is rotated 180 degrees, and with…
Quantum scrambling is the dispersal of local information into many-body quantum entanglements and correlations distributed throughout the entire system. This concept underlies the dynamics of thermalization in closed quantum systems, and…
We prove a theorem that reduces bounding the mixing time of a card shuffle to verifying a condition that involves only triplets of cards. Then we use it to analyze a classic model of card shuffling. In 1988, Diaconis introduced the…
We study quantum information scrambling in spin models with both long-range all-to-all and short-range interactions. We argue that a simple global, spatially homogeneous interaction together with local chaotic dynamics is sufficient to give…
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the…
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…