Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2609.32067

From Ehrenfest to Heisenberg scales: a hierarchy of mixing times for a phase-randomized quantum baker walk

Amir Sepehri

Published Sep 25, 2026• 0 citations
arXivHTMLPDF

Abstract

The quantum baker map is a standard model of quantum chaos, but rigorous analysis of how it spreads random perturbations remains difficult. Following the repeated ``baker plus refreshed diagonal perturbation'' architecture of Schack and Caves, we study a tractable strong-noise model based on the Balazs--Voros quantization: at each time step, its unitary propagator is followed by a diagonal unitary whose entries are independent and uniform on the unit circle. The resulting random propagator is a structured random walk on $\U(N)$, $N=2^k$. We quantify how quickly the baker dynamics spreads this basis-local randomness at three levels: ensemble means, two-copy statistics, and the full law of the accumulated propagator. The walk becomes an exact unitary $1$-design at time $k+1$, while its fixed-accuracy $2$-design mixing time is $Θ(\log N)$. Thus the induced state ensembles reproduce Haar means and two-copy statistics on the Ehrenfest scale. The full law mixes much more slowly. A phase-adapted path coupling gives normalized Wasserstein mixing in $O_\varepsilon(N)$ steps, whereas metric-entropy and Haar small-ball estimates give an $Ω_\varepsilon(N/\log N)$ lower bound and asymptotically maximal distance at every $t=o(N/\log N)$. The law remains singular with respect to Haar measure for every $t

DOI
10.48550/arxiv.2609.32067

Related papers

Rapid Mixing of Parallel Kac's Walk: From Spheres to Stiefel Manifolds

Qian Chen, Minglong Qin, Fang Song +2 more

Kac's walk is a classical local random walk whose action on a single real unit vector in dimension $d$ mixes in total variation in $Θ(d\log d)$ sequential steps~\cite{PS17}. Lu, Qin, Song, Yao, and Zhao introduced a parallel version of Kac's walk that mixes a single quantum state in $O(\log d)$ rounds~\cite{LQSY+26}. After discretizing the randomness and replacing it by suitable pseudorandom primitives, this parallel walk gives rise to pseudorandom state scramblers, and was subsequently shown to yield pseudorandom unitaries~\cite{LQSY+25}. We study what happens when the parallel Kac's walk acts simultaneously on $k$ orthonormal quantum states. We prove that, for any $1\leq k < d$, after $O\!\left((k+\log d)\log(d/\varepsilon)\right)$ steps, the joint distribution of the $k$ output states is $\varepsilon$-close, in both Wasserstein and total variation distance, to that obtained by applying a common Haar-random unitary to the same inputs. This generalizes the dispersing property of the parallel Kac's walk from a single quantum state to multiple orthonormal quantum states. Equivalently, viewing an ordered collection of $k$ orthonormal states as a point on the complex Stiefel manifold $V_{d,k}=\{X\in\mathbb C^{d\times k}:X^\dagger X=I_k\}$, we show that the parallel Kac's walk mixes rapidly on $V_{d,k}$, with both Wasserstein and total variation mixing times bounded by $O\!\left((k+\log d)\log(d/\varepsilon)\right)$. This extends the Wasserstein mixing result of Pillai, Smith, and Vaikuntanathan for the standard Kac's walk on real Stiefel manifolds~\cite{PSV26}.

quant-pharXiv:2609.37999•Sep 30, 2026•0 citations

Random Quantum Circuits Beyond Moment Matching

Shih-Han Hung

Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. We establish quantitative guarantees for how accurately these designs reproduce the distribution of each output probability. We show that, for every strong $\varepsilon$-approximate unitary $k$-design on $n$ qubits, the distribution of each output probability is within $O(k^{-1/2}(1+k/2^n)^{-1/2}+\varepsilon)$ in Kolmogorov distance of the Porter-Thomas distribution, a beta distribution with parameters $1$ and $2^n-1$. This bound is optimal up to constant factors, implying that a substantially better uniform bound requires additional structure. We then show that a mild form of local invariance suffices. We prove that any such design that is invariant under unitary translations acting on a single qubit approximates Porter-Thomas to total variation distance $O(k^{-1/2}+\varepsilon)$. Every strong $\varepsilon$-approximate unitary $k$-design invariant on $\log k+O(1)$ qubits achieves error $2^{-Ω(k)}+O(\varepsilon)$ in Kolmogorov distance and $2^{-Ω(k)}+O(\varepsilon\log(2/\varepsilon))$ in total variation distance. These results identify the distributional accuracy guaranteed by moment matching and the structure that improves it. As an application, we show that the Shannon entropy of the output distribution of a strong $\varepsilon$-approximate $k$-design is concentrated around its Haar value $n-Θ(1)$: its mean differs from the Haar mean by $O(k^{-1/4}+\varepsilon^{1/2})$ and its standard deviation is $O(2^{-n/2}+k^{-1/8}+\varepsilon^{1/4})$. Consequently, a trusted device sampling such circuits generates $n-O(1)$ bits of entropy per sample, which makes them useful for random number generation.

quant-pharXiv:2610.02135•Oct 2, 2026•0 citations

Random Processes over the Unitary Group

Emilio Onorati

According to one of the fundamental axioms of quantum mechanics, unitary operators rule the evolution of any quantum system; it is thus of prominent importance to investigate the corresponding group and discover its properties. Random processes over the unitary group have indeed a wide range of applications in the context of quantum information; in particular, they are involved in the construction of peculiar distributions called unitary designs which mimic the uniform Haar measure by matching its moments and are thus deeply connected to the description of phenomena such as quantum tomography, equilibration, thermalization, encryption and scrambling. Previous approaches have shown that unitary designs are efficiently approximated by random quantum circuits with local unitary operators. Moreover, these circuits are used to characterize the precision of experimental implementations of unitary gates via randomized benchmarking protocols and to rapidly decouple a system from the environment. The main novel contribution of this work is to extend these mixing properties to a continuous-time framework, namely, Brownian motion over the unitary group induced by stochastic local Hamiltonians. In order to achieve these new results, on the one hand we move to a representation theoretic formulation and make use of its tools to establish the gap of local generators linked to the moments of the distribution induced by the diffusion process; from this we then derive an expression for the length of time it takes to ensure convergence toward the moments of the Haar measure. On the other hand we project the stochastic evolution onto a random walk on Pauli matrices and tie this description to the analogous one for random quantum circuits to achieve decoupling in a run time scaling almost linearly with respect to the system size. In addition to providing a unifying framework for random processes over the unitary group, we hence aim at presenting new mathematical results and techniques for quantum information. We furthermore discuss applications to black holes dynamics in the perspective of the information paradox. As an additional novel result not related to Brownian motion, we propose a randomized benchmarking protocol exploiting the symmetry of the gate whose accuracy has to be estimated, in order to overcome current shortcomings afflicting the known schemes. We again rely on representation theory to reduce the computational effort and the amount of employed quantum resources.

•Jan 1, 2019•0 citations

Typical Mixing and Rare-State Bottlenecks in Open Quantum Systems

Caisheng Cheng, Ruicheng Bao

Mixing in open quantum systems is often summarized by a single worst-case time, even though that benchmark can be set by exponentially rare initial states. We show that for broad unstructured ensembles the nonlinear trace-distance relaxation curve itself concentrates around a deterministic mean. For Haar-random pure states this yields fixed-time concentration of the instantaneous trace distance to the steady state, which we term vertical concentration since typical relaxation curves bundle along the distance axis. Whenever the mean curve crosses the distance threshold with a finite slope, it converts this vertical concentration into a horizontal concentration of the mixing time, extending typicality from standard physical observables to a fundamentally non-observable dynamical quantity. This sharp concentration naturally raises the question of how the typical mixing timescale compares to the worst-case benchmark. We show that in a one-mode tail regime, this separation is controlled by the logarithmic ratio of extremal to typical initial-state overlaps for the slow left eigenoperator. This rare-state bottleneck law yields a hierarchy that is logarithmic in skin-effect settings, linear for boundary-supported many-body slow modes, and exponential in a protected-sector family where generic states mix rapidly while rare states stagnate. The framework also extends beyond Haar to exact and approximate unitary 2-designs and Hilbert-Schmidt/induced ensembles.

quant-pharXiv:2605.07619•May 11, 2026•1 citation

Randomization Times under Quantum Chaotic Hamiltonian Evolution

Souradeep Ghosh, Nicholas Hunter-Jones, Joaquin F. Rodriguez-Nieva

Randomness generation through quantum-chaotic evolution underpins foundational questions in statistical mechanics and applications across quantum information science, including benchmarking, tomography, metrology, and demonstrations of quantum computational advantage. While statistical mechanics successfully captures the temporal averages of local observables, understanding randomness at the level of higher statistical moments remains a daunting challenge, with analytic progress largely confined to random quantum circuit models or fine-tuned systems exhibiting space-time duality. Here we study how much randomness can be dynamically generated by generic quantum-chaotic evolution under physical, non-random Hamiltonians. Combining theoretical insights with numerical simulations, we show that for broad classes of initially unentangled states, the dynamics become effectively Haar-random well before the system can ergodically explore the physically accessible Hilbert space. Both local and highly nonlocal observables, including entanglement measures, equilibrate to their Haar expectation values and fluctuations on polynomial timescales with remarkably high numerical precision, and with the fastest randomization occurring in regions of parameter space previously identified as maximally chaotic. Interestingly, this effective randomization can occur on timescales linear in system size, suggesting that the sub-ballistic growth of Renyi entropies typically observed in systems with conservation laws can be bypassed in non-random Hamiltonians with an appropriate choice of initial conditions.

cond-mat.stat-mechCross-listedarXiv:2512.25074•Jan 1, 2026•3 citations

A Frame-Spread Lower Bound for Quantum Entropy Estimation under Fixed Rank-One Measurements

Xinyu Song

We study estimation of the von Neumann entropy of a $d$-dimensional quantum state from independent outcomes of a fixed rank-one measurement. Let $κ_ν\in[1,d+1]$ denote the normalized trace-zero frame spread; $κ_ν=1$ for exact complex projective $2$-designs. For any fixed rank-one measurement and $n\le c_2d^2/κ_ν$, the minimax mean-squared error is at least $c_1\log^2\{d^2/(κ_νn)\}$. For bounded frame spread and every fixed $0<a<2$, the minimax risk is of order $\log^2 d$ throughout $n\lesssim d^{2-a}$; hence fixed uniform accuracy requires $Ω(d^2)$ observations. Existing tomography bounds give bounded risk from $O(d^3\log^3 d)$ observations for finite equal-weight exact designs and the Haar covariant measurement, while the intermediate minimax regime remains open. The results concern a fixed measurement repeated independently across copies; adaptive and collective protocols, and protocols that reuse common randomness across copies, are not covered.

quant-pharXiv:2610.00270•Statistics & Probability Letters•Aug 26, 2026•0 citations
The quantum baker map is a standard model of quantum chaos, but rigorous analysis of how it spreads random perturbations remains difficult. Following the repeated ``baker plus refreshed diagonal perturbation'' architecture of Schack and Caves, we study a tractable strong-noise model based on the Balazs--Voros quantization: at each time step, its unitary propagator is followed by a diagonal unitary whose entries are independent and uniform on the unit circle. The resulting random propagator is a structured random walk on \U(N)\U(N)\U(N), N=2kN=2^kN=2k. We quantify how quickly the baker dynamics spreads this basis-local randomness at three levels: ensemble means, two-copy statistics, and the full law of the accumulated propagator. The walk becomes an exact unitary 111-design at time k+1k+1k+1, while its fixed-accuracy 222-design mixing time is Θ(log⁡N)Θ(\log N)Θ(logN). Thus the induced state ensembles reproduce Haar means and two-copy statistics on the Ehrenfest scale. The full law mixes much more slowly. A phase-adapted path coupling gives normalized Wasserstein mixing in Oε(N)O_\varepsilon(N)Oε​(N) steps, whereas metric-entropy and Haar small-ball estimates give an Ωε(N/log⁡N)Ω_\varepsilon(N/\log N)Ωε​(N/logN) lower bound and asymptotically maximal distance at every t=o(N/log⁡N)t=o(N/\log N)t=o(N/logN). The law remains singular with respect to Haar measure for every $t
Kac's walk is a classical local random walk whose action on a single real unit vector in dimension ddd mixes in total variation in Θ(dlog⁡d)Θ(d\log d)Θ(dlogd) sequential steps~\cite{PS17}. Lu, Qin, Song, Yao, and Zhao introduced a parallel version of Kac's walk that mixes a single quantum state in O(log⁡d)O(\log d)O(logd) rounds~\cite{LQSY+26}. After discretizing the randomness and replacing it by suitable pseudorandom primitives, this parallel walk gives rise to pseudorandom state scramblers, and was subsequently shown to yield pseudorandom unitaries~\cite{LQSY+25}. We study what happens when the parallel Kac's walk acts simultaneously on kkk orthonormal quantum states. We prove that, for any 1≤k<d1\leq k < d1≤k<d, after O ⁣((k+log⁡d)log⁡(d/ε))O\!\left((k+\log d)\log(d/\varepsilon)\right)O((k+logd)log(d/ε)) steps, the joint distribution of the kkk output states is ε\varepsilonε-close, in both Wasserstein and total variation distance, to that obtained by applying a common Haar-random unitary to the same inputs. This generalizes the dispersing property of the parallel Kac's walk from a single quantum state to multiple orthonormal quantum states. Equivalently, viewing an ordered collection of kkk orthonormal states as a point on the complex Stiefel manifold Vd,k={X∈Cd×k:X†X=Ik}V_{d,k}=\{X\in\mathbb C^{d\times k}:X^\dagger X=I_k\}Vd,k​={X∈Cd×k:X†X=Ik​}, we show that the parallel Kac's walk mixes rapidly on Vd,kV_{d,k}Vd,k​, with both Wasserstein and total variation mixing times bounded by O ⁣((k+log⁡d)log⁡(d/ε))O\!\left((k+\log d)\log(d/\varepsilon)\right)O((k+logd)log(d/ε)). This extends the Wasserstein mixing result of Pillai, Smith, and Vaikuntanathan for the standard Kac's walk on real Stiefel manifolds~\cite{PSV26}.
Random quantum circuits aim to efficiently reproduce the statistical properties of ideal random quantum evolution. One approach is to construct approximate unitary designs, which match the moments of Haar-random unitaries up to a prescribed order with controlled error. We establish quantitative guarantees for how accurately these designs reproduce the distribution of each output probability. We show that, for every strong ε\varepsilonε-approximate unitary kkk-design on nnn qubits, the distribution of each output probability is within O(k−1/2(1+k/2n)−1/2+ε)O(k^{-1/2}(1+k/2^n)^{-1/2}+\varepsilon)O(k−1/2(1+k/2n)−1/2+ε) in Kolmogorov distance of the Porter-Thomas distribution, a beta distribution with parameters 111 and 2n−12^n-12n−1. This bound is optimal up to constant factors, implying that a substantially better uniform bound requires additional structure. We then show that a mild form of local invariance suffices. We prove that any such design that is invariant under unitary translations acting on a single qubit approximates Porter-Thomas to total variation distance O(k−1/2+ε)O(k^{-1/2}+\varepsilon)O(k−1/2+ε). Every strong ε\varepsilonε-approximate unitary kkk-design invariant on log⁡k+O(1)\log k+O(1)logk+O(1) qubits achieves error 2−Ω(k)+O(ε)2^{-Ω(k)}+O(\varepsilon)2−Ω(k)+O(ε) in Kolmogorov distance and 2−Ω(k)+O(εlog⁡(2/ε))2^{-Ω(k)}+O(\varepsilon\log(2/\varepsilon))2−Ω(k)+O(εlog(2/ε)) in total variation distance. These results identify the distributional accuracy guaranteed by moment matching and the structure that improves it. As an application, we show that the Shannon entropy of the output distribution of a strong ε\varepsilonε-approximate kkk-design is concentrated around its Haar value n−Θ(1)n-Θ(1)n−Θ(1): its mean differs from the Haar mean by O(k−1/4+ε1/2)O(k^{-1/4}+\varepsilon^{1/2})O(k−1/4+ε1/2) and its standard deviation is O(2−n/2+k−1/8+ε1/4)O(2^{-n/2}+k^{-1/8}+\varepsilon^{1/4})O(2−n/2+k−1/8+ε1/4). Consequently, a trusted device sampling such circuits generates n−O(1)n-O(1)n−O(1) bits of entropy per sample, which makes them useful for random number generation.
According to one of the fundamental axioms of quantum mechanics, unitary operators rule the evolution of any quantum system; it is thus of prominent importance to investigate the corresponding group and discover its properties. Random processes over the unitary group have indeed a wide range of applications in the context of quantum information; in particular, they are involved in the construction of peculiar distributions called unitary designs which mimic the uniform Haar measure by matching its moments and are thus deeply connected to the description of phenomena such as quantum tomography, equilibration, thermalization, encryption and scrambling. Previous approaches have shown that unitary designs are efficiently approximated by random quantum circuits with local unitary operators. Moreover, these circuits are used to characterize the precision of experimental implementations of unitary gates via randomized benchmarking protocols and to rapidly decouple a system from the environment. The main novel contribution of this work is to extend these mixing properties to a continuous-time framework, namely, Brownian motion over the unitary group induced by stochastic local Hamiltonians. In order to achieve these new results, on the one hand we move to a representation theoretic formulation and make use of its tools to establish the gap of local generators linked to the moments of the distribution induced by the diffusion process; from this we then derive an expression for the length of time it takes to ensure convergence toward the moments of the Haar measure. On the other hand we project the stochastic evolution onto a random walk on Pauli matrices and tie this description to the analogous one for random quantum circuits to achieve decoupling in a run time scaling almost linearly with respect to the system size. In addition to providing a unifying framework for random processes over the unitary group, we hence aim at presenting new mathematical results and techniques for quantum information. We furthermore discuss applications to black holes dynamics in the perspective of the information paradox. As an additional novel result not related to Brownian motion, we propose a randomized benchmarking protocol exploiting the symmetry of the gate whose accuracy has to be estimated, in order to overcome current shortcomings afflicting the known schemes. We again rely on representation theory to reduce the computational effort and the amount of employed quantum resources.
Mixing in open quantum systems is often summarized by a single worst-case time, even though that benchmark can be set by exponentially rare initial states. We show that for broad unstructured ensembles the nonlinear trace-distance relaxation curve itself concentrates around a deterministic mean. For Haar-random pure states this yields fixed-time concentration of the instantaneous trace distance to the steady state, which we term vertical concentration since typical relaxation curves bundle along the distance axis. Whenever the mean curve crosses the distance threshold with a finite slope, it converts this vertical concentration into a horizontal concentration of the mixing time, extending typicality from standard physical observables to a fundamentally non-observable dynamical quantity. This sharp concentration naturally raises the question of how the typical mixing timescale compares to the worst-case benchmark. We show that in a one-mode tail regime, this separation is controlled by the logarithmic ratio of extremal to typical initial-state overlaps for the slow left eigenoperator. This rare-state bottleneck law yields a hierarchy that is logarithmic in skin-effect settings, linear for boundary-supported many-body slow modes, and exponential in a protected-sector family where generic states mix rapidly while rare states stagnate. The framework also extends beyond Haar to exact and approximate unitary 2-designs and Hilbert-Schmidt/induced ensembles.
Randomness generation through quantum-chaotic evolution underpins foundational questions in statistical mechanics and applications across quantum information science, including benchmarking, tomography, metrology, and demonstrations of quantum computational advantage. While statistical mechanics successfully captures the temporal averages of local observables, understanding randomness at the level of higher statistical moments remains a daunting challenge, with analytic progress largely confined to random quantum circuit models or fine-tuned systems exhibiting space-time duality. Here we study how much randomness can be dynamically generated by generic quantum-chaotic evolution under physical, non-random Hamiltonians. Combining theoretical insights with numerical simulations, we show that for broad classes of initially unentangled states, the dynamics become effectively Haar-random well before the system can ergodically explore the physically accessible Hilbert space. Both local and highly nonlocal observables, including entanglement measures, equilibrate to their Haar expectation values and fluctuations on polynomial timescales with remarkably high numerical precision, and with the fastest randomization occurring in regions of parameter space previously identified as maximally chaotic. Interestingly, this effective randomization can occur on timescales linear in system size, suggesting that the sub-ballistic growth of Renyi entropies typically observed in systems with conservation laws can be bypassed in non-random Hamiltonians with an appropriate choice of initial conditions.
We study estimation of the von Neumann entropy of a ddd-dimensional quantum state from independent outcomes of a fixed rank-one measurement. Let κν∈[1,d+1]κ_ν\in[1,d+1]κν​∈[1,d+1] denote the normalized trace-zero frame spread; κν=1κ_ν=1κν​=1 for exact complex projective 222-designs. For any fixed rank-one measurement and n≤c2d2/κνn\le c_2d^2/κ_νn≤c2​d2/κν​, the minimax mean-squared error is at least c1log⁡2{d2/(κνn)}c_1\log^2\{d^2/(κ_νn)\}c1​log2{d2/(κν​n)}. For bounded frame spread and every fixed 0<a<20<a<20<a<2, the minimax risk is of order log⁡2d\log^2 dlog2d throughout n≲d2−an\lesssim d^{2-a}n≲d2−a; hence fixed uniform accuracy requires Ω(d2)Ω(d^2)Ω(d2) observations. Existing tomography bounds give bounded risk from O(d3log⁡3d)O(d^3\log^3 d)O(d3log3d) observations for finite equal-weight exact designs and the Haar covariant measurement, while the intermediate minimax regime remains open. The results concern a fixed measurement repeated independently across copies; adaptive and collective protocols, and protocols that reuse common randomness across copies, are not covered.