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.38738

Generating random unitaries by products of conjugated Hamiltonian evolutions

Oscar Scholin, Apollonas S. Matsoukas-Roubeas, Sathyawageeswar Subramanian

quant-phSubmitted Sep 30, 2026• Announced Oct 1, 2026• 0 citations
arXivHTMLPDF

Abstract

Random unitary operations are a fundamental resource for quantum information processing, yet provably generating them with experimentally available controls remains challenging. Existing approaches often require calculating higher-order operator expectation values, relying on statistical assumptions about the experimental Hamiltonian's spectrum to make these calculations tractable. We show how to implement random unitaries by a sequence of evolutions generated by a fixed Hamiltonian conjugated by a global control operator. We give a geometric argument that establishes exponential convergence to the uniform random (Haar) measure on the accessible unitary group under uniform parameter sampling, beyond a finite sequence-length threshold that we bound. We show this holds when the connected Lie subgroup generated by the conjugated Hamiltonians is closed. Native dynamics and global control thus provide a constructive route to uniform randomness, with applications to many experimental platforms including Rydberg atoms, bosons and fermions in optical lattices, transmons, and trapped ions.

AI Summary

Can native Hamiltonian dynamics with a single global control parameter generate Haar-random operations without assumptions about quantum chaos? This paper studies independent products of $F(\phi,t)=e^{i\phi A}e^{itB}e^{-i\phi A}$ for fixed Hermitian $A,B$, uniformly sampling $\phi$ and nonnegative durations from bounded domains containing intervals, including arbitrarily short durations. Let $\mathfrak h$ be the Lie algebra generated by $i e^{i\phi A}Be^{-i\phi A}$, and let $G$ be the closure of the accessible products. If the connected subgroup associated with $\mathfrak h$ is closed, the endpoint distribution becomes absolutely continuous relative to Haar measure after finitely many steps and converges exponentially in total variation. Writing $n=\dim G$ and $r$ for the real span dimension of the conjugated generators, the minimum submersion length satisfies $\lceil n/2\rceil\leq L_0\leq r+(n-r)(n-r+1)\leq d^4$. The proof constructs a full-rank product-map differential; real analyticity and the coarea formula establish absolute continuity, enabling existing compact-group random-walk theorems. For the full unitary group, convergence implies approximate designs at every fixed moment order. An additional rejection-sampling construction gives exact finite-length Haar sampling under fiber-volume and boundedness assumptions. The asymptotic rate is characterized through irreducible-representation Fourier coefficients, not bounded explicitly for concrete Hamiltonians. Physical examples span Rydberg arrays, Hubbard models, transmons, and trapped ions, but their closed-subgroup conditions and practical mixing times remain unanalysed. Application-specific design bounds, coherence-time constraints, and control errors are left open.

Little sign of AI-generated textAI use disclosedUnclear novelty
to improve the clarity of the manuscript throughout, in particular to make discussion of the application to experimental Hamiltonians in Appendix \Cref{apdx:examples} more pedagogical.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Related papers

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

Unitary designs from perturbed time evolutions of a chaotic Hamiltonian

Zhongyi Yang, Biao Wu

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.

quant-pharXiv:2607.24851•Jul 28, 2026•3 citations

Random Quantum Circuits and Pseudo-Random Unitary Operators

Joseph Emerson, Etera R. Livine, Seth Lloyd

Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudo-random ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group and describe how the rate of convergence may be calculated for specific applications.

•Mar 28, 2005•4 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

Generating Haar-Uniform Randomness Using Stochastic Quantum Walks on a Photonic Chip

Hao Long Tang, Leonardo Banchi, Tian-Yu Wang +9 more

As random operations for quantum systems are intensively used in various quantum information tasks, a trustworthy measure of the randomness in quantum operations is highly demanded. The Haar measure of randomness is a useful tool with wide applications, such as boson sampling. Recently, a theoretical protocol was proposed to combine quantum control theory and driven stochastic quantum walks to generate Haar-uniform random operations. This opens up a promising route to converting classical randomness to quantum randomness. Here, we implement a two-dimensional stochastic quantum walk on the integrated photonic chip and demonstrate that the average of all distribution profiles converges to the even distribution when the evolution length increases, suggesting the 1-pad Haar-uniform randomness. We further show that our two-dimensional array outperforms the one-dimensional array of the same number of waveguide for the speed of convergence. Our Letter demonstrates a scalable and robust way to generate Haar-uniform randomness that can provide useful building blocks to boost future quantum information techniques.

arXiv:2112.06549•Physical Review Letters•Feb 3, 2022•30 citations

Strong unitary designs in optimal depth and space

Teodor Parella-Dilmé, Júlia Barberà-Rodríguez, Salvatore F. E. Oliviero +1 more

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 $Θ(\log n)$ 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.

quant-pharXiv:2608.13491•Aug 14, 2026•5 citations
Random unitary operations are a fundamental resource for quantum information processing, yet provably generating them with experimentally available controls remains challenging. Existing approaches often require calculating higher-order operator expectation values, relying on statistical assumptions about the experimental Hamiltonian's spectrum to make these calculations tractable. We show how to implement random unitaries by a sequence of evolutions generated by a fixed Hamiltonian conjugated by a global control operator. We give a geometric argument that establishes exponential convergence to the uniform random (Haar) measure on the accessible unitary group under uniform parameter sampling, beyond a finite sequence-length threshold that we bound. We show this holds when the connected Lie subgroup generated by the conjugated Hamiltonians is closed. Native dynamics and global control thus provide a constructive route to uniform randomness, with applications to many experimental platforms including Rydberg atoms, bosons and fermions in optical lattices, transmons, and trapped ions.
Can native Hamiltonian dynamics with a single global control parameter generate Haar-random operations without assumptions about quantum chaos? This paper studies independent products of F(ϕ,t)=eiϕAeitBe−iϕAF(\phi,t)=e^{i\phi A}e^{itB}e^{-i\phi A}F(ϕ,t)=eiϕAeitBe−iϕA for fixed Hermitian A,BA,BA,B, uniformly sampling ϕ\phiϕ and nonnegative durations from bounded domains containing intervals, including arbitrarily short durations.
Let h\mathfrak hh be the Lie algebra generated by ieiϕABe−iϕAi e^{i\phi A}Be^{-i\phi A}ieiϕABe−iϕA, and let GGG be the closure of the accessible products. If the connected subgroup associated with h\mathfrak hh is closed, the endpoint distribution becomes absolutely continuous relative to Haar measure after finitely many steps and converges exponentially in total variation. Writing n=dim⁡Gn=\dim Gn=dimG and rrr for the real span dimension of the conjugated generators, the minimum submersion length satisfies ⌈n/2⌉≤L0≤r+(n−r)(n−r+1)≤d4\lceil n/2\rceil\leq L_0\leq r+(n-r)(n-r+1)\leq d^4⌈n/2⌉≤L0​≤r+(n−r)(n−r+1)≤d4. The proof constructs a full-rank product-map differential; real analyticity and the coarea formula establish absolute continuity, enabling existing compact-group random-walk theorems. For the full unitary group, convergence implies approximate designs at every fixed moment order. An additional rejection-sampling construction gives exact finite-length Haar sampling under fiber-volume and boundedness assumptions.
The asymptotic rate is characterized through irreducible-representation Fourier coefficients, not bounded explicitly for concrete Hamiltonians. Physical examples span Rydberg arrays, Hubbard models, transmons, and trapped ions, but their closed-subgroup conditions and practical mixing times remain unanalysed. Application-specific design bounds, coherence-time constraints, and control errors are left open.
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.
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.
Efficient methods for generating pseudo-randomly distributed unitary operators are needed for the practical application of Haar distributed random operators in quantum communication and noise estimation protocols. We develop a theoretical framework for analyzing pseudo-random ensembles generated through a random circuit composition. We prove that the measure over random circuits converges exponentially (with increasing circuit length) to the uniform (Haar) measure on the unitary group and describe how the rate of convergence may be calculated for specific applications.
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.
As random operations for quantum systems are intensively used in various quantum information tasks, a trustworthy measure of the randomness in quantum operations is highly demanded. The Haar measure of randomness is a useful tool with wide applications, such as boson sampling. Recently, a theoretical protocol was proposed to combine quantum control theory and driven stochastic quantum walks to generate Haar-uniform random operations. This opens up a promising route to converting classical randomness to quantum randomness. Here, we implement a two-dimensional stochastic quantum walk on the integrated photonic chip and demonstrate that the average of all distribution profiles converges to the even distribution when the evolution length increases, suggesting the 1-pad Haar-uniform randomness. We further show that our two-dimensional array outperforms the one-dimensional array of the same number of waveguide for the speed of convergence. Our Letter demonstrates a scalable and robust way to generate Haar-uniform randomness that can provide useful building blocks to boost future quantum information techniques.
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 kkk and measurable-error tolerance, we construct strong approximate unitary kkk-designs in optimal Θ(log⁡n)Θ(\log n)Θ(logn) all-to-all circuit depth using only the nnn 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.