Complete Continuous Delay Regions, Quantized Passive Memory, and Pick Tomography for Quantum Networks

Lower bounds do not determine which resource profiles are physically attainable. We close the continuous inverse problem for passive subspace transport. Let two rank-k subspaces in C^N, N >= 2k, have ordered canonical angles beta, and let q_j be the integrated leading eigenvalues of a positive generator Q = -iS* dS/dt. We prove the exact equivalence: q is attainable if and only if 2 beta is weakly majorized by q. Every feasible profile has a compiler using at most k+1 mutually commuting positive generators of rank at most k, with constant ordered top spectrum. Analytic rationality adds an integer-valued resource: for two boundary frequencies, the least McMillan degree of an inner matrix sending a fixed input subspace to two prescribed output subspaces equals the number of nonzero canonical angles. We also give a fail-closed finite-error certificate for both resources from noisy projectors.At multiple frequencies, Wigner-Smith delay is only the block diagonal of a boundary de Branges-Rovnyak Pick matrix. This positive matrix is the Gram matrix of frequency-excited internal states and has rank bounded by the McMillan degree. Its spectrum yields robust degree certificates and unavoidable model-reduction tails. An exact example exhibits identical local proper delays for degree-one and degree-two devices while their Pick ranks distinguish them. Deterministic code reconstructs the compilers, tests 2,240 randomized theorem interfaces, checks the strict separation, and independently replays the certificate.