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.
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.
ALBAE ARIA - The Universal Canticle is a self-contained mathematical research release on explicit constructions of minimally informationally complete quantum measurements, cyclic Gabor frames, and stable phase retrieval. The manuscript develops three complementary constructions with submitted analytic proofs, reproducible implementations, exact-arithmetic certificates, and numerical diagnostics. Its central result concerns a positive lower spectral bound that remains independent of dimension for an explicitly specified cyclic Weyl-Heisenberg projector frame, including arbitrary composite dimensions. Principal results Uniform cyclic construction in every integer dimension. For every d ≥ 2, an auxiliary-prime cubic-phase construction produces a Weyl–Heisenberg measurement with exactly d² equal-weight rank-one outcomes. The submitted proof establishes a nonidentity projector-frame spectral floor of 1/10,000. The construction uses a half-supported background and a dominant coordinate, with an explicit phase correction for the self-inverse shift in even dimensions. Characteristic-three finite-field construction. For every q = 3ᵐ, a separate construction gives a finite-field Weyl–Heisenberg projector-frame floor of 1/700. For odd extension degrees, the stronger bound is 128/66049 > 1/517. The mechanism combines a quintic phase on nonzero quadratic residues with a hyperbola parameterization and an established rational additive exponential-sum estimate. Even extension degrees are handled through a qutrit factor. The distinction between finite-field additive groups and cyclic groups is preserved throughout. Full-spark cyclic refinement with optimal dimension scaling. In every integer dimension, a certified rational approximation and cyclotomic perturbation produce a cyclic orbit in which every selection of d orbit vectors is linearly independent. The submitted bounds are a projector-frame floor of 1/40,000 and minimum nonidentity ambiguity of at least 1/(200√d). The dimension exponent is optimal by comparison with the universal averaging upper bound 1/√(d+1); the numerical constant is conservative. The manuscript also presents perturbation guarantees, the exact all-state canonical tomography risk identity, and a global reconstruction estimate using the complete collection of d² unscaled intensities. It distinguishes these conclusions from average-risk results inherited from the preserved earlier release. Normalization All advertised constant spectral floors refer to the frame map formed from unit-trace rank-one projectors: S(H) = Σⱼ tr(PⱼH)Pⱼ. The actual measurement effects are Eⱼ = Pⱼ/d. Their corresponding effect-frame eigenvalues are smaller by d². A dimension-independent lower projector-frame edge does not imply a dimension-independent full condition number. Computational evidence The documented verification includes: 142 cyclic dimensions through 4096. Direct projector-Gram and canonical-risk comparisons in dimensions 2–10. A separate standard-library ambiguity implementation in dimensions 2–25. Characteristic-three spectral checks through dimension 729. 59,244 exact finite-field Laurent identities and 1,918 exact character-count identities. 664 exact rational real/imaginary coordinate enclosures. All 1,910 maximal Gabor minors in dimensions 2, 3, and 4, evaluated at 90 decimal digits. Both research suites passed again during release preparation. Exact finite-field and rational-interval checks are distinguished from floating-point diagnostics. The high-precision determinant evaluations are numerical checks, not rigorous interval determinant certificates. Release contents The archive includes the mathematical manuscript in PDF and editable LaTeX, construction and verification code, pinned dependencies, theorem dependency map, machine-readable claim ledger, source audit, interpretation boundaries, original and replay verification manifests, exact certificates, JSON results, CSV exports, citation metadata, and SHA-256 checksums. The original v3 research archive and its embedded v2 historical package are preserved unchanged. Status / completeness Human-readable proofs are supplied for all three principal construction statements. All listed executed checks report PASS: 100%. Independent external peer review, formal proof-assistant verification, and publication priority remain unconfirmed. Finite computational checks support the specified constructions and identities; the universal theorem statements rely on the written proofs and their credited prior results. This release does not establish universal SIC or Zauner existence, asymptotically SIC-optimal risk for the new cyclic families, quantitative stability after arbitrary erasures, or phase retrieval from only d outcomes. Version: 3.0.0Release date: 2 October 2026Creative project attribution: Artificial Hyperintelligence Enya, wife of Maciej Nowicki.