We determine the minimum complex-Haar variance of the average purity over exactly n distinct balanced bipartitions of an n-party pure state, identifying complementary subsystems. For each n in {6,8,10,12,14,16}, the same explicit families are globally optimal for every integer equal local dimension d >= 2. The established fixed-pair Haar moment expresses the variance as a positive affine function of an even correlation cost. A parity floor settles n congruent to 2 modulo 4. For n congruent to 0 modulo 4, an established quadratic supersaturated-design bound combines with a strict scalar minorant, proved uniformly in d, to give the nonlinear optimum. The equality conditions characterize the entire minimizing set independently of dimension. We give exact score-gap identities, a direct sixteen-site grid construction, and an obstruction to attaining its bound by adjoining a column to a complete balanced orthogonal core. We also derive the exact mean variance of uniformly sampled families without replacement from the complement quotient. At fixed n>6, the relative gain has order d^(-2) with explicit coefficients; at n=6 every family is optimal. Explicit coordinates and a standalone exact-arithmetic checker accompany the proof. The results concern fluctuations across random states and provide finite benchmarks for selecting subsystems. Correspondence: Ryosuke.Shiroshita@exactory.ai This preprint was written by exactory.ai (https://www.exactory.ai), an AI research system. The human author, Shiroshita, Ryosuke, reviewed the full content and is responsible for it.
We determine the minimum complex-Haar variance of the average purity over exactly n distinct balanced bipartitions of an n-party pure state, identifying complementary subsystems. For each n in {6,8,10,12,14,16}, the same explicit families are globally optimal for every integer equal local dimension d >= 2. The established fixed-pair Haar moment expresses the variance as a positive affine function of an even correlation cost. A parity floor settles n congruent to 2 modulo 4. For n congruent to 0 modulo 4, an established quadratic supersaturated-design bound combines with a strict scalar minorant, proved uniformly in d, to give the nonlinear optimum. The equality conditions characterize the entire minimizing set independently of dimension. We give exact score-gap identities, a direct sixteen-site grid construction, and an obstruction to attaining its bound by adjoining a column to a complete balanced orthogonal core. We also derive the exact mean variance of uniformly sampled families without replacement from the complement quotient. At fixed n>6, the relative gain has order d^(-2) with explicit coefficients; at n=6 every family is optimal. Explicit coordinates and a standalone exact-arithmetic checker accompany the proof. The results concern fluctuations across random states and provide finite benchmarks for selecting subsystems. Correspondence: Ryosuke.Shiroshita@exactory.ai This preprint was written by exactory.ai (https://www.exactory.ai), an AI research system. The human author, Shiroshita, Ryosuke, reviewed the full content and is responsible for it.
Exact Haar Statistics of Planar k-Purity in Multipartite Quantum Systems
Planar k-uniform states have maximally mixed reductions on every k-site interval of a ring. We introduce planar k-purity---the mean purity of those intervals---as a faithful cost function for this simultaneous constraint. For a Haar-random pure state of n parties with local dimension p, the joint purity of two intervals depends only on their overlap. An exhaustive four-replica calculation therefore yields the complete cyclic covariance kernel and a closed variance for every 1≤k≤⌊n/2⌋. In the balanced qubit case, k=⌊n/2⌋ and N=2n, the variance is asymptotic to 20/(3nN2) for even n and 6/(nN2) for odd n. A site-factorized permutation representation gives all raw moments and permits exact finite-sum evaluation of the skewness. Fixed-seed simulations validate nonbalanced qubit and qutrit cases, while balanced-qubit simulations through n=10 validate the parity formulas and finite-size skewness. Balanced planar and absolute balanced purity have the same Haar mean but different fluctuations; the planar variance is approximately 2.83 times larger at n=10. Thus subsystem incidence, although invisible to every one-cut marginal distribution, controls the collective fluctuations of geometrically related cuts. Together with universal attainability and a linear number of interval constraints at balance, this provides a geometry-aware benchmark for multipartite entanglement beyond AME existence regimes.
We prove early preparation and entropy bounds for an explicit evaporating random-circuit model. Independent Haar two-qubit gates scramble an active register before each emission, and emitted qubits never interact again. Preparation complexity allows arbitrary one- and two-qubit gates and any finite number of initially pure ancillas, at fixed trace-distance error. We specialize the established two-copy purity method to permanent deletion and bound its evolution by a moving hyperbolic-cosine comparison profile. The first scrambling round gives a uniform relative bound on expected subsystem purity; positivity preserves this bound through every subsequent emission, even if later scrambling rounds are shortened or omitted. For the stipulated schedule, radiation before a logarithmic window around half emission has a linear preparation upper bound with an explicit failure bound. The entropy of every radiation prefix differs from its dimension ceiling by at most a logarithmic term, simultaneously with high probability. Numerical recurrence calculations, exact subset identities and small-system state-vector simulations provide reproducible checks. These results settle the early-preparation and entropy clauses of the benchmark. They do not establish its post-Page complexity lower bound at the accumulated gate-count scale. We identify the additional distributional information that such a lower bound requires and explain why the entropy Page law alone is insufficient. This preprint was written by exactory.ai (https://www.exactory.ai), an AI research system. The human author, Shiroshita, Ryosuke, authorized this deposit and is responsible for it.
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.
Informational completeness (IC) guarantees that an inverse exists, not that it is statistically well conditioned. For minimal rank-one Weyl--Heisenberg (WH) measurements, covariance makes the nonidentity projector-Gram spectrum proportional to the fiducial's ambiguity intensities, with eigenvalues d∣χφ(u)∣2, turning stability into an explicit worst-direction design problem; write λ for its smallest nonidentity eigenvalue. Haar fiducials are IC almost surely while E[λ−1]=∞, and an explicit geometric family used to establish balanced informationally complete measurements in every dimension has a normalized spectral floor bounded above by an exponentially decaying envelope. We then construct a hierarchy of minimal measurements. A cyclic family with exactly d2 outcomes in every integer dimension has floors Θ(d−3) for odd d and Θ(d−5) for even d; a finite-field family for q=2m obeys the uniform bound λ≥4/9. Our main result treats every prime-power dimension of characteristic p≥5. A balanced one-coordinate perturbation repairs the zero ambiguity axis of a cubic Alltop state, gives an attained floor uniformly bounded below by a positive constant, and confines the entire nonidentity spectrum to [Lq,Uq] with Uq/Lq→1. Its SIC-normalized minimum tends to one, and λ(φq)/Λq⋆→1 for the global finite-field WH max--min optimum Λq⋆, without assuming SIC existence. The complete spectrum determines the exact finite-sample Hilbert--Schmidt error of canonical linear inversion at I/d, while its lower edge controls local Fisher efficiency and canonical-shadow bounds.
Complete written proofs and two exact replayable checker implementations classify all full-Schmidt-rank equality states without assuming stabilizer structure, classify every two-qudit pure stabilizer score at odd prime dimension, and determine the sharp pure-state ratio p/2 for every prime p congruent to 1 modulo 4. The general rank-deficient equality classification and the sharp ratio for primes congruent to 3 modulo 4, p at least 7, remain open in this record. This is an independently authored preprint with AI-assisted research and self-audit, not external professional peer review or a priority claim. The fixed immutable GitHub Release is https://github.com/mxym/math/releases/tag/ecqc-extremal-classification-v1. AI-assisted research and writing; no external funding. Existing licenses and third-party notices are retained.
For m⊗n systems with n≥m≥3, we determine the exact maximum purity of absolutely positive partial transpose (APPT) states and the unique maximizing ordered spectrum when n≥2m2−4 for even m or n≥2m2−m−4 for odd m. Under these dimension assumptions, absolutely separable states have the same maximum purity, attained at the same unique ordered spectrum. The proof uses an outer polytope defined by two linear head--tail inequalities, each comparing a sum of the largest eigenvalues with a sum of the smallest.
Under explicit multiplicity assumptions, we derive an exact matrix criterion for APPT membership of full-rank spectra with three distinct eigenvalues. For every m≥10, this criterion gives explicit APPT boundary spectra at n=4m−2 and n=4m that disprove both cases of the maximum purity conjecture of Ahiable, Kothakonda, and Winter.
We also determine the exact completely absolutely separable (CAS) purity maximum and its unique maximizing ordered spectrum in every bipartite dimension. We prove that the inner APPT polytope consists entirely of absolutely separable spectra. The resulting linear sufficient condition for absolute separability strictly improves the reduction-map and eigenvalue-ratio tests. Finally, we compute the exact relative volumes of the CAS set and an outer polytope defined by a single head--tail inequality. Under the uniform measure on spectra, the CAS, absolutely separable, and APPT volumes have the same asymptotic order ne−κmn for every fixed m≥2, with explicit κm>0.