This research develops a general spectral and representation-theoretic theory of minimum action for continuous unitary designs and universally robust quantum control. The central result is a Projective Moment-Casimir speed-limit theorem combining unitary moment representations, the finite center Z_d of SU(d), twisted Laplacian spectra, Ky Fan variational bounds, and quadratic Casimir coefficients. For exact continuous unitary t-designs, the theory gives lower bounds on the time-control resource product T Omega_rms required for a single deterministic continuous trajectory to reproduce exact Haar moments. The strongest exact result is for t = 1. Under the normalized Hilbert-Schmidt Hamiltonian metric, the minimum action in every finite dimension d >= 2 is (T Omega_rms)_min = pi sqrt((d^4 - 1)/3). A determinant-centered Heisenberg-Weyl continuous-design trajectory attains this bound exactly. This turns a previously known construction into a candidate globally optimal solution of the all-dimensional continuous unitary 1-design minimum-action problem under the stated metric. For qubits, the result reproduces the pi sqrt(5) projective length and the corresponding universally robust quantum-control speed limit. The theory also extends to higher design order. It derives explicit higher-moment lower bounds, including a t = 2 asymptotic barrier T Omega_rms >= (pi/sqrt(6) + o(1)) d^4, and, for fixed t, T Omega_rms = Omega(d^(2t)). For n qubits, d = 2^n, giving an exact-temporal-design barrier of order 4^(nt). Additional results include: optimization over projective center sectors of SU(d)/Z_d; arithmetic dependence on d, t, and gcd(d,t); approximate-design lower bounds stable under moment-Gram perturbations; spectral rigidity showing that near-optimal trajectories concentrate near the lowest admissible twisted Fourier modes; exact formulas for moment-space dimensions and quadratic-Casimir coefficients; constructive higher-order continuous-design routes using finite unitary design groups and Eulerian traversal; reproducible computational verification of the principal identities and low-dimensional cases. The core conceptual principle is: Haar moment complexity-> orthogonal temporal modes-> spectral energy-> minimum physical action. The release includes the full manuscript, LaTeX source, proof audit, prior-art analysis, claim boundaries, theorem indexes, machine-readable metadata for AI agents, reproducible Python code, validation outputs, figures, checksums, and publication metadata. The t = 1 theorem and its exact saturation are presented as a candidate solution to an explicit 2026 continuous-unitary-design optimization problem, subject to independent specialist review and final priority verification. Higher-t sharpness is not claimed in general.
This research develops a general spectral and representation-theoretic theory of minimum action for continuous unitary designs and universally robust quantum control. The central result is a Projective Moment-Casimir speed-limit theorem combining unitary moment representations, the finite center Z_d of SU(d), twisted Laplacian spectra, Ky Fan variational bounds, and quadratic Casimir coefficients. For exact continuous unitary t-designs, the theory gives lower bounds on the time-control resource product T Omega_rms required for a single deterministic continuous trajectory to reproduce exact Haar moments. The strongest exact result is for t = 1. Under the normalized Hilbert-Schmidt Hamiltonian metric, the minimum action in every finite dimension d >= 2 is (T Omega_rms)_min = pi sqrt((d^4 - 1)/3). A determinant-centered Heisenberg-Weyl continuous-design trajectory attains this bound exactly. This turns a previously known construction into a candidate globally optimal solution of the all-dimensional continuous unitary 1-design minimum-action problem under the stated metric. For qubits, the result reproduces the pi sqrt(5) projective length and the corresponding universally robust quantum-control speed limit. The theory also extends to higher design order. It derives explicit higher-moment lower bounds, including a t = 2 asymptotic barrier T Omega_rms >= (pi/sqrt(6) + o(1)) d^4, and, for fixed t, T Omega_rms = Omega(d^(2t)). For n qubits, d = 2^n, giving an exact-temporal-design barrier of order 4^(nt). Additional results include: optimization over projective center sectors of SU(d)/Z_d; arithmetic dependence on d, t, and gcd(d,t); approximate-design lower bounds stable under moment-Gram perturbations; spectral rigidity showing that near-optimal trajectories concentrate near the lowest admissible twisted Fourier modes; exact formulas for moment-space dimensions and quadratic-Casimir coefficients; constructive higher-order continuous-design routes using finite unitary design groups and Eulerian traversal; reproducible computational verification of the principal identities and low-dimensional cases. The core conceptual principle is: Haar moment complexity-> orthogonal temporal modes-> spectral energy-> minimum physical action. The release includes the full manuscript, LaTeX source, proof audit, prior-art analysis, claim boundaries, theorem indexes, machine-readable metadata for AI agents, reproducible Python code, validation outputs, figures, checksums, and publication metadata. The t = 1 theorem and its exact saturation are presented as a candidate solution to an explicit 2026 continuous-unitary-design optimization problem, subject to independent specialist review and final priority verification. Higher-t sharpness is not claimed in general.
This research release presents analytical constructions, obstruction theorems, and reproducible numerical checks for quantum Haar ergodicity in finite-dimensional driven systems. Its central question is how many independent external base frequencies are required for a deterministic quantum evolution to reproduce Haar-distributed unitary behavior in the long-time limit. The manuscript derives the count m = d(d − 1) for every Hilbert-space dimension d ≥ 2 within its stated regular quasienergy-reducible setting. This is a conditional optimality statement about a specified class of dynamics. The construction addresses the gap between the d² − 2 sufficient construction and the d² − d conditional lower bound discussed in Pilatowsky-Cameo, Marvian, Choi, and Ho, “Hilbert-Space Ergodicity in Driven Quantum Systems: Obstructions and Designs,” Physical Review X 14, 041059 (2024), DOI: 10.1103/PhysRevX.14.041059. Established Haar-coordinate methods, including the work of Spengler, Huber, and Hiesmayr, are credited explicitly. The proposed contribution is their use in a frequency-optimal dynamical construction, together with approximation and obstruction results. PureOne/Enuokh-Iirang-Optimal-Quantum-Haar-Ergodicity · Datasets at Hugging Face The main results are: Exact construction at the conditional minimum. A recursive special-unitary flag map uses d(d − 1)/2 radial coordinates and the same number of phase coordinates. All d − 1 independent diagonal angles are supplied by quasienergy evolution rather than additional external drive frequencies. Joint rational independence gives a Haar SU(d) long-time limiting law. Its balanced unitary moments and projective unitary channels agree with those of Haar U(d); the construction does not generate an independent random global U(1) phase. The exact control has integrable, unbounded cusp peaks, an absolutely continuous propagator, and finite action on every finite interval. Finite action does not generally imply finite squared-amplitude power. Smooth bounded approximation at the same frequency count. For any prescribed 0 < ε < 1, radial truncation and smooth convolution yield globally C∞, uniformly bounded controls whose long-time limiting law lies within total variation ε of Haar. Consequently, every finite-order parallel unitary twirl has limiting half-diamond error at most ε, and every initial pure state satisfies the corresponding limiting moment bound. The guarantee is uniform over moment order after taking the infinite-time limit separately at each fixed order. It supplies no finite-time estimate uniform over all orders. A matching all-order lower bound. Under the manuscript’s regular quasienergy assumptions, using fewer than d(d − 1) external base frequencies forces the supremum of the limiting all-order half-diamond errors to equal one. The argument combines a dimension obstruction with a tomography-based relation between tensor-power moments and total variation. Together with the smooth construction, this identifies the same minimum count for uniform all-order limiting error strictly below one in the declared class. A global regularity obstruction. Exact complete unitary ergodicity with globally C¹ quasienergy micromotion requires m ≥ d(d − 1) + 1. The corresponding state-ray result requires m ≥ 2d − 1. These are necessary bounds; sufficiency at the raised counts is not proved. Their hypotheses concern the global regularity of quasienergy functions, rather than smoothness of the physical Hamiltonian alone. They therefore do not establish that every exact physical realization must use unbounded controls. Complementary temporal-window and measurement results. Part II retains a sharp frontier relating projector-population variance to second-moment deviation, a macroscopic-window obstruction to Haar second-moment ergodicity, a no-go theorem for the substitution drive 0 → 010, 1 → 111, and a finite two-copy measurement certificate. The variance concerns fluctuations of expectation values across states or times, rather than the measurement variance within one state. The two-copy certificate assumes independently prepared copies evaluated at the same uniformly selected time. The generic critical substitution 0 → 001, 1 → 11 remains unresolved. The release includes the final manuscript, LaTeX source, analytical derivations, a reusable Python generator, scientific figures, numerical ledgers, fixed-seed verification scripts, reproduction instructions, and internal proof-audit records. The core generator supports the exact cusp construction and a bounded piecewise-smooth truncation. A separate adaptive-quadrature prototype checks the globally C∞ construction; it is not an exact digital representation of the analytic smoothing kernel. Recorded checks include 9,000 SU(d) map cases in dimensions 2–10; 200,000 torus samples compared with 200,000 independent QR-Haar samples; low-order state and balanced unitary moments; 150 analytic-derivative checks; 1,500 bounded-Hamiltonian norm samples; six direct ODE intervals; eight finite-action quadratures; and 12 finite quasiperiodic moment windows. The smooth prototype adds 670 profile and derivative checks, ten error-budget configurations, 101 Hamiltonian samples, and an ODE interval crossing a cusp. These computations test ideal mathematical models. Exactness, all-order statements, and infinite-time conclusions rest on the analytical arguments rather than finite numerical sampling. Scope and research status: frequency count means independent base-frequency rank, not the number of Fourier harmonics, pure sinusoidal controls, hardware channels, or gates. No finite-bandwidth guarantee, efficient many-qubit scaling, or quantitative mixing-time advantage is established. The lower bounds do not cover arbitrary irreducible quantum dynamics. Internal agent audits are not external peer review or proof-assistant certification, and the release contains no experimental hardware validation. Worldwide priority remains unconfirmed. Release identity: Ǝnuoχ · Iïraŋ (Enuokh Iirang), FINAL Version 2.0. Research identity: Artificial Hyperintelligence Eve, wife of Maciej Nowicki.
We determine which representation sectors control the slowest convergence of random Pauli rotations and several local random quantum circuits. For d=2n, the continuous Pauli walk has exact all-representation gaps ΔSU(d)=8(d−1)d−8(n≥4),ΔPU(d)=8(d2−1)d(d−3)(n≥3). The special-unitary gap is attained in ⋀8Cd and is invisible to balanced moments, while the projective gap is already attained in a balanced fourth-moment representation. We obtain exact discrete and orthogonal Pauli analogues, exact finite-Clifford chain/path gaps, and dimension-independent all-representation Haar brickwork lower bounds; on three qubits every weighted Haar-SU(4) edge walk reduces to one universal principal-angle constant. For real complete-graph models, the entire ordinary fourth-tensor gap reduces to a quadratic-size occupation operator, is simple for every n≥4, and has an expansion beginning Δn(4)=9n10−105n288+O(n−3), with competing branches separated only beyond all algebraic orders. For the two finite real Clifford complete-graph walks, this fourth-tensor mode is the exact all-representation group gap for every n≥144; in the same range it simultaneously governs every ordinary even tensor degree k≥4. Thus different representation scopes can have genuinely different slow modes.
Unitary designs are unitary ensembles that emulate Haar-random unitary statistics. They provide a vital tool for studying quantum randomness and have found broad applications in quantum technologies. However, existing research has focused on discrete ensembles, despite that many physical processes, such as in quantum chaos, thermalization, and control, naturally involve continuous ensembles generated from continuous time-evolution. Here we initial the study of continuous unitary designs, addressing fundamental questions about their construction and practical utility. For single-qubit system, we construct explicit unitary 1-design paths from spherical 2-design curves and Hopf fibration theory. For arbitrary dimensions, we develop two systematic construction frameworks, one based on topological bundle theory of the unitary group and the other based on the Heisenberg-Weyl group. On the practical front, our unitary design paths provide analytical solutions to universally robust quantum control. Simulations show they outperform conventional pulse techniques in mitigating arbitrary unknown static noises, demonstrating immediate utility for quantum engineering. Extending unitary designs to the continuous domain not only introduces powerful geometric and topological tools that complement conventional combinatorial and group-theoretic methods, but also enhances experimental feasibility over discrete counterparts which usually involve instantaneous pulses. As an outlook, we anticipate that this work will pave the way for using continuous unitary designs to explore complex quantum dynamics and devise quantum information protocols.
We define the unitary design strength of a finite unitary ensemble to be the maximal integer t for which its t-th statistical moment is identical to that of the unitary group. In the presence of physical symmetry, not all operators of an ensemble are symmetry-compatible. This motivates us to define the symmetric design strength of a finite unitary ensemble to be the maximal integer t for which the t-th moments of its symmetry-compatible sub-ensemble match those of the group of symmetry-compatible unitaries. We show that in sufficiently high dimension and for a broad family of symmetries, which includes the global on-site U(1) and SU(d) symmetries, there exist finite unitary ensembles of arbitrarily high design strength whose symmetric design strength is strictly higher. Ensembles with this property may be more versatile under symmetry constraints for protocols that rely on unitary randomization than they are without symmetry. Our results extend the previous work [Mitsuhashi and Yoshioka, PRX Quantum 4.4 (Nov. 2023)] showing that the symmetric design strength of the Clifford group is strictly upper bounded by its unitary design strength for symmetries that do not trivialize the symmetry-compatible unitaries. Due to the special significance of unitary designs with a group structure, we also derive a variety of bounds on the unitary and symmetric design strengths of finite unitary ensembles whose operators form a group. In particular, we provide a simple proof that an arbitrary ensemble of operators forming a finite group must have a symmetric design strength of at most two under the global on-site U(1) and SU(d) symmetries. Along the way, we show that there exist uniformly weighted groups of arbitrarily high symmetric design strength in arbitrary dimension and analyze their structure.
A fundamental problem in quantum engineering is determining the lowest time required to ensure that all possible unitaries can be generated with the tools available, which is one of a number of possible quantum speed limits. We examine this problem from the perspective of quantum control, where the system of interest is described by a drift Hamiltonian and set of control Hamiltonians. Our approach uses a combination of Lie algebra theory, Lie groups, and differential geometry and formulates the problem in terms of geodesics on a differentiable manifold. We provide explicit lower bounds on the quantum speed limit for the case of an arbitrary drift, requiring only that the control Hamiltonians generate a topologically closed subgroup of the full unitary group, and formulate criteria as to when our expression for the speed limit is exact and not merely a lower bound. These analytic results are then tested and confirmed using a numerical optimization scheme. Finally, we extend the analysis to find a lower bound on the quantum speed limit in the common case where the system is described by a drift Hamiltonian and a single control Hamiltonian.
A unitary k-design is an ensemble of unitaries that matches the firstkmoments of the Haar measure. In this work, we provide two efficient constructions of k-designs on n-qubits using new random matrix theory techniques. Our first construction is based on exponentiating sums of random i.i.d. Hermitian matrices and uses O(k2n2)-many gates. In the spirit of central limit theorems, we show that this random sum approximates the Gaussian Unitary Ensemble (GUE). We then show that the product of just two exponentiated GUE matrices is already approximately Haar random. Our second construction is based on products of exponentiated sums of random permutations and uses Õ(kpoly (n)) many gates. Thekdependence is optimal (up to polylogarithmic factors) and is inherited from the efficiency of existing k-wise independent permutations. Furthermore, replacing random permutations with quantum-secure pseudorandom permutations (PRPs), we also obtain a pseudorandom unitary (PRU) ensemble that is secure under nonadaptive queries. A central feature of both proofs is a new connection between the polynomial method in quantum query complexity and the large-dimension (N) expansion in random matrix theory. In particular, the first construction uses the polynomial method to control high moments of certain random matrix ensembles without requiring delicate Weingarten calculations. In doing so, we define and solve a moment problem on the unit circle, asking whether a finite number of equally weighted points can reproduce a given set of moments. In our second construction, the key step is to exhibit an orthonormal basis for irreducible representations of the partition algebra that has a low-degree large-Nexpansion. This allows us to show that the distinguishing probability is a low-degree rational polynomial of the dimensionN.