We classify the ranks of nonzero operators with at most three terms in a fixed cyclic Weyl basis in every prime-power dimension. A central-sector formula valid in arbitrary cyclic dimension computes trinomial nullity from commuting powers and a common block multiplicity; nonzero three-term coefficients permit at most two singular sectors. The formula explains composite-dimension departures from the prime-power bound. For exact-rank pure probes in one-use Weyl channel list discrimination, we classify all reduced states below rank 3d/4 in dyadic dimensions: exactly thirty flat half-rank states. Positive sums of sparse squares produce ranks impossible for an individual three-term factor, including an exact three-label family of rank 13d/16. We also determine an exact four-label family of rank 5d/8 and the complete feasible three-label rank set in dimension sixteen. Classical Weyl representation and covariance tools are attributed; exact algebraic certificates and replay programs accompany the proofs.
A quantum list measurement succeeds when its output contains the prepared label. Building on the known equivalence between learning width and Gram-matrix factor width, this paper closes an exact realization-sensitive branch. Every full-spark ensemble of N pure-state rays spanning C^r that admits strictly positive tight representatives has minimum zero-error list size N-r+1. Weighted Hodge duals of all (r-1)-fold frame wedges give an explicit attaining POVM, and a physical-space annihilator-cone formulation gives constructive compression to at most r^2 outcomes. A smallest-eigenvalue functional supplies a positive and perturbatively stable Bayes-error floor below threshold. For a flat consecutive-support Schmidt-rank-r probe of the complete d-dimensional Weyl-channel ensemble, the fixed-probe threshold is d-r+1. When r divides d, an arithmetic-support construction and dimension converse close the optimization over all pure Schmidt-rank-r probes at d/r. For the consecutive rank-two probe, the complete one-shot Bayes list curve is determined exactly. The nondivisible probe optimum, adaptive or multiuse testers, asymptotic capacity, arbitrary mixed states, and non-scalable full-spark ensembles remain outside scope.
In quantum list discrimination a measurement returns at most ell candidate labels and succeeds when the true hypothesis belongs to the returned list. We associate a Rado independent-transversal matroid to the support subspaces of a mixed quantum ensemble and prove that every true-label inclusion vector lies in the independence polytope of the ell-fold matroid union. This yields all-subset Bayesian bounds for arbitrary priors, soft rewards, an integer congestion deficit, equality audits, and canonical compression to quantum-process testers. Exact attainment and insufficiency examples separate support combinatorics from quantum geometry. We then solve two input-dependent process families. For binary laminar dephase-prepare channels with M=2^h, list size ell=2^s, and q uses, arbitrary entangled parallel probes and adaptive quantum memories obey P_parallel=min(1,ell(q+1)/M) and P_adaptive=min(1,ell 2^q/M). For complete unitary-error ensembles we translate the known approximate dense-coding spectrum law into a list cap, derive an exact serial/parallel/Bell multitime trichotomy, and give a fixed-probe example where the coarse list-rank cap is not attained. The matroid theorem is a support obstruction rather than a general POVM feasibility characterization; the laminar separation is a classical feedback tradeoff embedded quantumly, and no indefinite-causal-order advantage is claimed.
Minimum-error discrimination of quantum processes is normally optimized over testers whose normalization may encode parallel, sequential, or indefinite-order access. For a fixed physical deterministic normalization, Moore-Penrose compression maps the tester exactly to a POVM on normalized effective states and preserves every conditional probability. We associate to the support subspaces of arbitrary positive process operators a Rado matroid on the hypothesis labels and prove that every correct-label probability vector lies in its independence polytope. Consequently the Bayes success probability is at most the prior weight of a maximum-weight independent transversal. A robust extension replaces exact supports by arbitrary positive low-rank cores and charges only the prior-weighted worst-case discarded tester mass; valid full-rank process admixture of weight eta degrades the certificate by at most eta. We give an explicit reduction to linear matroid intersection, an equality audit at strict prior drops, a deterministic Gram criterion for perfect rank-one discrimination, and exactly solved qubit phase-gate families. In a five-channel instance the exact general-tester optimum is 0.80 while the total-dimension relaxation is 0.90. The result is a support-based upper bound and is not claimed to determine every mixed-process optimum.
The standard k-query dimension bound for an unknown d-dimensional unitary uses the entire degree-k symmetric tensor space and scales as k^(d^2-1). We refine that bound to the degree-k Hilbert function of the projective oracle variety and compute the resulting support exactly in two physically structured families. For a fixed-angle qubit rotation with unknown axis, the repeated-query span has dimension (k+1)^2 on the generic branch, binomial(k+2,2) on the traceless branch, and one on the central branch. A compact-orbit leverage argument inserts this exact support into the general-tester bound, applying to the parallel, sequential, and mathematically admissible indefinite-order strategies covered by the standard tester model. The associated spherical and planar-axis frames admit closed harmonic spectra, purity formulae, endpoint cascades, and a complete tightness classification. For d-level selective-phase oracles, the projective closure is a Segre variety and the exact support is binomial(k+d-1,d-1)^2, reducing the ambient exponent from d^2-1 to 2d-2. These results quantify geometry-dependent query support rather than physical memory or an achievable discrimination probability in every finite ensemble. The work excludes inverse-oracle access, controlled bypasses, noise, finite-sample estimation, and tester models beyond those explicitly stated.
Four balanced Pauli kicks along the vertices of a regular tetrahedron, followed by their reverse echo, generate 24 order-labelled qubit unitary channels. The words share a trace and form two 12-element orbits of the proper tetrahedral group. One query sees only their common trace. At two queries, orbit-dependent quadratic energies yield closed formulas for the Bell-square and globally optimized parallel strategies. At the algebraic point q=1/2, every causally ordered two-query protocol has success at most 9/24 because the fixed trace removes one dimension from the universal quadratic query space. An explicit rational two-comb normalization, a six-Kraus realization, and an exact weighted-frame identity attain the cap, giving P_causal=3/8 and P_parallel=(5+sqrt(15))/24. A uniform Lipschitz estimate proves that the same causal tester remains strictly better on an explicit open pulse interval. The result is an analytic adaptive advantage for a concrete non-group ensemble. It does not address indefinite causal order, noise, finite statistics, or arbitrary qubit ensembles. The central causal certificate is replayed exactly in quotient-ring arithmetic; the supplied word/collision and representation scripts are mixed symbolic-numerical corroborating audits.
