Quantum reference frame (QRF) transformations are usually presented as unitary or gauge-fixing changes of coordinates. That picture is exact for ideal frames but fails for finite clocks, gyroscopes, POVM-defined tokens, observers correlated with the targets they describe, and relativistic frames with quantum boost and clock degrees of freedom; the obstruction is loss of distinguishability. We model a non-ideal frame by a normal covariant perspective channel. A deterministic transformation A → B then exists exactly when the kernel of A's channel is contained in the kernel of B's channel, and is unique on the preparable image. Ancilla-stable transformations are complete-order quotient morphisms, while a laboratory implementation on a chosen output space is a separate Choi-Arveson extension problem. The common invariant content of a family of frames is a Heisenberg operator system, carrying an algebraic product only on its product-compatible core. For finite frames in the regular representation, concrete covariant degradability A → B is decided by a group-convolution linear program with explicit dual witnesses ; for Abelian groups this becomes a Fourier mode-support resource lattice. Our main result is that for every finite group this convolution linear program already equals the full diamond-norm deficiency: coherent, multiplicity-exploiting post-processings never outperform random translations, so the resource theory of frame degradation is entirely classical. The same quotient principle governs process tensors, protected relational sectors, entangled observers, relativistic covariance — the boosted-spin perspective being an explicit U(1) dephasing channel — and observer networks. Reproducible numerical certificates accompany every analytic claim.
A finite group-valued temporal reference frame defines a correlated random-unitary process rather than a list of independent channels. We identify a regime in which its complete trajectory law is an exact operational coordinate. If the carrier contains every irreducible representation of the finite group
G, one ancilla-assisted input resolves all group elements, and for arbitrary laws
μ,ν on
Gn the strategy half-distance equals
dTV(μ,ν). Optimal output-side causal post-processing likewise reduces to classical convolution on
Gn. This converts temporal hiding into a
q-ary coding problem. Uniform coset laws of an
[n,k]q code are identical on every set of fewer than
d(C⊥) slots and perfectly distinguishable globally. For
M sectors with leakage at most
η from
t selected slots and global decoding error
ε, we obtain
(1−ε)logM≤(n−t)logq+η+h2(ε). For nested codes
C⊂D, the payload
R=dimD−dimC, invisible depth
t=drel(C⊥,D⊥)−1, and sector distance
drel(D,C) obey
R+t+drel(D,C)−1≤n and
R+t+2e+f≤n, where
e and
f are adversarial errors and known erasures. Nested generalized Reed-Solomon codes attain the bounds in their existence range. We also give the exact projection-rank leakage profile and show that hiding arbitrary coherent superpositions from
t slots is precisely quantum erasure correction, yielding
logqK+2t≤n. The results separate classical trajectory privacy from coherent temporal privacy and quantify the robust payload hidden from reduced process tomography.
Comparing two noisy quantum reference frames as statistical experiments depends on the dimension of the ancillary memory available to the decision procedure. For finite-dimensional channels A and B with invertible A, we show that exact simulation of all measurements assisted by an r-dimensional ancilla is equivalent to r-positivity of the unique factor Gamma = BA^{-1}. The hierarchy can be realized by physical channel pairs: every unital, trace-preserving map that is k-positive but not (k+1)-positive embeds as the factor between the channels D_a and Gamma composed with D_a on an exact interval determined by the smallest Choi eigenvalue. For depolarizing source and target channels D_a and D_b, including negative and singular source parameters, the phase boundary is
Da⪰rDb⟺−1/(dr−1)≤b/a≤1 for
a=0. We derive closed formulas for the restricted level-r deficiency and for the distance to every physical post-processing,
δphys(Db∣Da)=(1−1/d2)dist(b,Ia), where
Ia=conv{a,−a/(d2−1)}. The largest physical conversion cost hidden from all tests through level k is
(d−k)/[d(d2−1)]. An untouched m-level spectator changes the first detecting external level from k+1 to
⌊k/m⌋+1. A transpose--depolarizing construction shows that the separation is not confined to depolarizing factors. The results quantify the distinction between ancilla-restricted statistical simulation and implementation by a single quantum channel.
Two quantum channels can have identical information geometry while allowing different physical simulations. This paper asks whether a complete RLD information profile has a greatest realization: a channel from which every other realization of that profile can be produced by deterministic postprocessing. Equality of right logarithmic derivative (RLD) Fisher information for every faithful input, tangent and finite quantum reference determines a labelled von Neumann algebra, a normalized channel and a faithful normal state. The same equivalence relation is obtained from complete maximal f-divergences. Every finite-dimensional invariant has a greatest representative of minimum possible effective output dimension, without requiring the invariant state to be tracial. For separable trace-class outputs with a faithful normal tracial invariant state, an exact greatest member exists precisely when the algebra is a countable product of finite matrix algebras. Arbitrarily accurate greatest members within the same exact profile class exist precisely when the algebra is injective. Existence of a single sequence approximating every fixed target already implies existence of a sequence whose diamond-norm error is uniform over all targets. Spectral pinching and finite-dimensional Haar averaging connect these operational requirements to established operator-algebraic approximation theory. The paper gives diffuse binary examples, an explicit free-group class with a finite quantitative obstruction, polynomial-time exact profile comparison and polynomial-bit faithful witnesses for rational finite channels, and finite probe identification with conditioned stability. A fixed full-support family shows that capacity optimized over an exact profile class can be discontinuous even while every physical channel in the family is antidegradable and has zero quantum capacity. The infinite-output classification requires the stated tracial hypothesis. It supplies neither an effective general filtration nor an experimental convergence rate. The atomic/injective distinction, reverse-test and sufficiency theory, amenability machinery and finite identification methods are credited to their primary sources. RLD-profile equality is distinct from the SLD, Umegaki and Holevo comparison problems studied in Complete information orders of quantum channels: equivalence and undecidability.
Exact physical memory is an unstable target: a process of Hankel rank one can be arbitrarily close to processes requiring larger classical and quantum carriers. We make this obstruction quantitative and then identify the extra structure under which a physical finite-sample upper theorem is possible. First, on a stationary binary Markov family whose mixing gap is uniformly at least one half, every estimator of exact linear rank, minimum classical memory, or minimum quantum Hilbert dimension has worst-case error at least 3/8 at local separation
Θ([N(L−1)]−1/2) from the rank-one model. The smallest nonzero singular value of an explicit Hankel core is proportional to the same parameter. Thus a spectral or dynamical margin is necessary even under rapid mixing. Second, finite Hankel data determine a minimum linear realization only up to similarity, whereas nonnegativity and complete positivity are not invariant under a generic similarity. We give an exact two-state counterexample and then formulate the missing assumption as a calibrated physical core. For an invertible core
H, all shifts are recovered in one basis by
A~a=H~−1H~a. An explicit perturbation theorem, followed by Choi positive-part projection and one common trace-preserving correction, returns a genuine quantum instrument. A direct-query finite-sample corollary controls its error uniformly over adaptive policies and exposes every dependence on core conditioning, physical calibration, horizon, and confidence. The resulting linear-in-horizon coefficient is first-order sharp: a one-state classical process attains the exact discrepancy
1−(1−Δ/2)L at one-step diamond radius
Δ. Third, we prove a compact-state classicalization theorem. Any finite-dimensional physical memory described by a compact base-norm state space has, at horizon
L and operational error
η>0, a classical realization whose number of states is the seeded covering number at radius
2η/L, uniformly over adaptive policies. For a
d-dimensional quantum instrument this gives, for
d≥2,
(1+η2(1−d−1)L)d2−1 states, with no extra transient state; one state suffices for
d=1. The ambient exponent
d2−1 is optimal for universal trace-norm discretization, while a compact branch-invariant reachable set replaces it by its own metric entropy. Consequently, an unbounded exact quantum/classical memory separation cannot remain unbounded at fixed
d,
L,
η. Robust quantum advantage must instead be quantified as a joint precision–horizon tradeoff. Deterministic verification code audits the mixing lower bound, the similarity-gauge counterexample, common-shift recovery, physical repair, and finite-net simulation.
Abstract Random-unitary noise is an implementable way to hide quantum information, since it can be realized by applying unitary gates sampled from a classical random key. However, the unconstrained minimization of pairwise quantum
α-
z R\'enyi divergences over all mixed-unitary channels is degenerate: the completely depolarizing channel is a Weyl average and maps every input state to
Id/d. This paper develops a non-erasing privacy--utility framework based on Pauli--Weyl randomization. For a finite protected ensemble
E={ρ1,…,ρm}, a compact admissible set
K of Weyl probability distributions, and a fidelity-type utility threshold
η, we study the robust radius
Rα,zη(E;K)=infp∈K:UE(Φp)≥ηmaxi=jDα,z(Φp(ρi)∥Φp(ρj)). We prove well-posedness, a zero-radius characterization, and active-pair optimality conditions. The main exact result is a Pauli reduction theorem for equal-purity binary qubit ensembles: in adapted Bloch coordinates, optimization over all Pauli channels reduces to a two-parameter contraction problem separating the sensitive direction from the common direction. This yields an explicit two-eigenvalue formula for the reduced
α-
z divergence and a closed-form optimal mechanism on the fidelity line
α=z=1/2 for arbitrary pure binary qubit states. A complementary commuting result solves antipodal binary pairs throughout the data-processing region. For diagonal qudit ensembles, Weyl randomization reduces to cyclic convolution; the utility has a Fourier autocorrelation representation, and the minimax problem admits convex global formulations for
0<α<1 and
α=2. Finally, the radius is shown to be stable under post-processing and measurement, to imply binary discrimination bounds, and to support hardware-aware calibration certificates. MSC Classification: Primary 81P45 , 94A17; Secondary 81P50 , 47N50 , 49K35 , 90C25 ,90C30