Unitary designs provide efficient substitutes for Haar-random unitaries in quantum information processing, randomized measurements, and many-body quantum dynamics. We propose a protocol based on time evolutions of a single chaotic Hamiltonian interleaved with unitary perturbations to generate unitary designs. We derive the frame potential of the resulting ensemble in terms of those of the intermediate ensemble. The intermediate ensemble need not itself be Haar random or exhibit Haar-level frame potentials, provided that its trace moments and frame-potential growth are sufficiently suppressed. The nontrivial Pauli set and the Clifford ensemble are simple examples, whereas ensembles whose cardinality does not grow with the Hilbert-space dimension generally fail. We further establish a frame-potential correspondence between multi-Hamiltonian temporal protocols and one-Hamiltonian protocols interleaved with repeated fixed trace-suppressed perturbations, showing that two perturbations suffice to recover Haar-level frame potentials. For local Hamiltonians, we derive a lower bound on the space--depth control resource, while more generally we establish a universal finite-window bound that constrains the required temporal sampling range. Together, these results identify complementary spatial and temporal resource requirements for perturbation-assisted randomness generation.
Unitary
k-designs are central to quantum information and quantum many-body physics, as they provide efficient proxies for Haar-random dynamics. We study how chaotic Hamiltonian evolution can generate unitary
k-designs using the frame potential (FP). Unlike standard approaches based on independently sampled Hamiltonians or fine-tuned evolution times, we consider a quenched temporal ensemble in which the Hamiltonians are sampled once and then held fixed, while randomness enters only through the evolution times. We compare a two-step protocol (2SP), with evolution under two fixed Hamiltonians, to a three-step protocol (3SP) with one additional quench, with three evolution times sampled independently. Analytically and numerically, we show that the 2SP fails to realize general unitary
k-designs, whereas the 3SP realizes them for arbitrary
k. The random phases in the 3SP impose stronger index-matching constraints in the FP, eliminating the independent permutation degrees of freedom that still remain in the 2SP. Even with imperfect time averaging, the 3SP reaches a given accuracy within a parametrically shorter time window. These results hold universally across different symmetry classes and persist in both all-to-all and local models with random interactions.
Unitary
k-designs provide a resource-efficient framework for emulating Haar randomness up to the
k-th order. Quench-based protocols have recently been shown to generate such designs, but achieving this typically requires multiple Hamiltonian realizations, even when using temporal ensembles. Here, we show that no independent Hamiltonians are required: a single chaotic Hamiltonian is sufficient to generate approximate unitary
k-designs, even when that Hamiltonian is spatially local. We introduce a two-Pauli-kick (2PK) protocol, in which unitary evolution under a fixed Hamiltonian is interspersed with two Pauli operator insertions (kicks). We find that the resulting frame potential approaches the Haar value at long times, with deviations suppressed by the inverse Hilbert-space dimension. We verify this for single realizations of Gaussian random matrices, the Majorana and Spin Sachdev-Ye-Kitaev models, and deterministic local quantum spin chains. Remarkably, in deterministic spin systems, the 2PK protocol generates approximate unitary designs in regimes where quench-based protocols are either inapplicable or fail to converge. Furthermore, our protocol provides a finite-temperature extension of the frame potential and establishes an analytic bound in terms of the equilibrium partition function. We discuss a holographic perspective on this mechanism.
The realization of unitary designs is of fundamental interest in quantum science and typically requires the ability to implement structured quantum circuits. Recent developments have explored the possibility of generating unitary designs using only a small number of quantum quenches, in which the evolution during each interval is governed by a static Hamiltonian. In particular, it has been established that at least three chaotic Hamiltonians are required when only Hamiltonian evolutions are employed. In this work, we propose the emergence of unitary designs in the temporal ensemble of qubit systems evolved under two distinct chaotic Hamiltonians for sufficiently long times, supplemented by an intermediate random Pauli operation inserted between them. This result follows from the universal Pauli spectrum of chaotic Hamiltonians, a central concept in the study of non-stabilizerness. Our theoretical predictions are verified numerically using explicit examples, including Gaussian unitary ensemble Hamiltonians and random spin models. We further investigate finite-time and finite-size corrections to the protocol. Our results provide new insights into the dynamical generation of quantum randomness and offer a new route toward realizing unitary designs in chaotic systems.
We study the generation of state
k-designs from time evolution under a fixed Hamiltonian. Specifically, we consider the ensemble
E={e−iHt∣ψ0⟩∣ t∼Unif[0,T],∣ψ0⟩∼E′}, where the initial states are sampled from an ensemble
E′. For Hamiltonians drawn from the Gaussian unitary ensemble, we derive a simple relation between the frame potential of the evolved ensemble
E and that of the initial ensemble
E′ in the large evolution time limit. This relation shows that
E forms an exact state
k-design in the thermodynamic limit as long as
E′ forms a state 1-design. Remarkably, we further show, both analytically and numerically, that time evolution under a simple nonintegrable mixed-field Ising Hamiltonian can generate approximate state
k-designs with high precision, starting from product states in an appropriately chosen Pauli basis. We also analyze the finite-
T correction and find it scales as
O(1/T). To reduce the evolution time, we propose an
M-step quench protocol that suppresses this correction to
O(1/TM), which is also verified numerically. We then extend our analysis to unitary ensembles, deriving an analogous recursion relation for the unitary frame potential. Our results elucidate the mechanisms underlying recent proposals for generating unitary
k-designs through sequential quantum quenches in a unified manner.
Unitary designs provide finite-moment approximations to Haar-random unitaries, with wide-ranging applications across physics and quantum information, from scrambling and black-hole dynamics to foundational primitives in quantum algorithms. Strong unitary designs capture a more demanding operational notion of approximation, requiring indistinguishability from Haar randomness even for quantum algorithms that may access a unitary not only in the forward direction, but also through its inverse, transpose, and complex conjugate. Motivated by the physical requirement that scrambling arise within the system itself, Schuster, Ma, Lombardi, Brandão, and Huang (arXiv:2509.26310) left open whether strong unitary designs can be generated in logarithmic depth using only the system qubits. For every fixed design order
k and measurable-error tolerance, we construct strong approximate unitary
k-designs in optimal
Θ(logn) all-to-all circuit depth using only the
n original system qubits. Our new ingredient is a logarithmic-depth Pauli-mixing bound for the perfect-matching ensemble, whose layers pair the qubits uniformly at random and apply independent random two-qubit gates. This bound controls the mixed forward-reverse two-query case, which we combine with existing design and gluing results to obtain strong unitary designs of arbitrary fixed order.
The nature of randomness and complexity growth in systems governed by unitary dynamics is a fundamental question in quantum many-body physics. This problem has motivated the study of models such as local random circuits and their convergence to Haar-random unitaries in the long-time limit. However, these models do not correspond to any family of physical time-independent Hamiltonians. In this work, we address this gap by studying the indistinguishability of time-independent Hamiltonian dynamics from truly random unitaries. On one hand, we establish a no-go result showing that for any ensemble of constant-local Hamiltonians and any evolution times, the resulting time-evolution unitary can be efficiently distinguished from Haar-random and fails to form a
2-design or a pseudorandom unitary (PRU). On the other hand, we prove that this limitation can be overcome by increasing the locality slightly: there exist ensembles of random polylog-local Hamiltonians in one-dimension such that under constant evolution time, the resulting time-evolution unitary is indistinguishable from Haar-random, i.e. it forms both a unitary
k-design and a PRU. Moreover, these Hamiltonians can be efficiently simulated under standard cryptographic assumptions.