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 $\mathcal{D}_a \succeq_r \mathcal{D}_b \Longleftrightarrow -1/(dr-1) \leq b/a \leq 1$ for $a\neq 0$. We derive closed formulas for the restricted level-r deficiency and for the distance to every physical post-processing, $δ_{\mathrm{phys}}(\mathcal{D}_b\mid\mathcal{D}_a)=(1-1/d^2)\operatorname{dist}(b,I_a)$, where $I_a=\operatorname{conv}\{a,-a/(d^2-1)\}$. The largest physical conversion cost hidden from all tests through level k is $(d-k)/[d(d^2-1)]$. An untouched m-level spectator changes the first detecting external level from k+1 to $\lfloor k/m\rfloor+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.
Comments
12 pages, 3 figures; includes ancillary verification code and a deterministic regression certificate
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.
A finite quantum reference token with group-valued misalignment induces a random-unitary channel, but optimal degradation is generally an optimization over all quantum post-processings. For a unitary representation U of a finite group G, we prove that the following conditions are equivalent: U contains every irreducible type; one ancilla-assisted input has an orthonormal G-orbit; signed group measures embed isometrically into channels in diamond norm; and, for every pair of noise laws p,q, infΛ∈CPTP21∥ΦqU−Λ∘ΦpU∥⋄=minr∈P(G)21∥q−r∗p∥1. Thus representation completeness is the exact carrier condition for universal reduction of quantum post-processing to classical convolution. We determine the minimum ancilla dimensions for an orthogonal orbit and for an invariant calibration seed. For an incomplete carrier, with visible Plancherel dimension S(U), we derive the exact conditional-expectation distance 21∥id−ΦuU∥⋄=1−1/S(U) and an explicit quantum--classical deficiency gap. For irreducible carriers the deficiency is obtained in closed form; the faithful two-dimensional representation of S3 yields an exact ten-percent reduction relative to classical convolution. We also characterize law identifiability through the conjugation representation, provide finite linear programs and decision witnesses, and establish both a finite-dimensional obstruction and stable visible-band reconstruction for infinite compact groups. Deterministic ancillary code reproduces the finite-group examples and numerical regression checks.
Several ways to ask whether one quantum channel preserves more information turn out to give the same answer when every finite quantum reference is allowed. That complete comparison remains undecidable, even for strictly positive rational measurements. The result. Quantum channels can be compared by their preservation of relative entropy, Holevo information or symmetric logarithmic derivative Fisher information. Allowing an arbitrary finite untouched quantum reference makes these three comparisons equivalent. Passing to complementary channels reverses the order. The resulting comparison problem is coRE-complete, already for measurements with strictly positive rational-complex effects. The paper also gives an additive bounded entropy defect whose value cannot be computed to any fixed positive rational additive accuracy. How the argument works. An untouched reference is an auxiliary quantum system that may be correlated with the input. Its freedom connects local Fisher-information tests to global entropy comparisons through coherent blocks and resolvent identities. A purification identity relates information retained by the receiver to information lost to the environment. For the undecidability reduction, finite nonlocal games are encoded into inverse Sylvester kernels and then into strictly positive measurement effects. Finite witnesses detect failed comparisons, but their required reference dimensions have no computable uniform bound. Scope. Each individual channel, measurement and test is finite dimensional. Completeness quantifies over every finite reference dimension, with no common bound. The equivalence is a statistical information order; it does not by itself assert that one channel can be obtained by physically processing the other. The fixed-accuracy obstruction concerns the bounded entropy defect defined in the paper. Its conclusion depends on the complete comparison and the specified exact input representation. Related work. From complete channel order to capacity and one-way distillation.
A common self-consistent channel diagnostic uses a reference contrast matrix R and a processed contrast matrix P. Under a fixed d-dimensional carrier, a common preparation/readout interface, and an invertible reference, one obtains W = Tr(P R^{-1}) = Tr T, where T is the transfer block on the d^2 − 1 traceless operator coordinates. Every entanglement-breaking d-dimensional channel obeys W ≤ d − 1. The inequality is useful only if the dimension and interface assumptions are part of the experimental contract. We construct an exact countermodel when they are not. For every d ≥ 2, set m = d^2 − 1 and let n_1, …, n_{m+1} be the vertices of a regular simplex in R^m. An affine encoding of a local m-dimensional signal ball into the m + 1 = d^2 classical simplex, paired with binary linear readouts, gives an invertible isotropic contrast matrix R = β I_m. The stochastic memory transition K_q = q I_{m+1} + (1 − q) 11^T/(m+1), 0 ≤ q ≤ 1, acts as r ↦ q r on the encoded local chart. Hence for every depth n the observed contrasts satisfy P_n = q^n R, all semigroup identities P_{n+k} = P_n R^{-1} P_k, and the apparent transfer spectrum is exactly that of the d-dimensional depolarizing channel. Yet the physical realization is a measure-and-prepare channel on a d^2-state classical memory and is therefore entanglement breaking for every q. A naive d-dimensional trace witness returns W = (d^2 − 1)q, which exceeds the legitimate entanglement-breaking threshold d − 1 whenever q > 1/(d + 1). At q = 1 the apparent violation factor is d + 1 although the physical memory is classical. Under affine mixture-preserving encodings, d^2 classical states are also minimal for faithfully representing an open (d^2 − 1)-dimensional interface chart. The result does not contradict valid dimension witnesses or trusted-input quantum-memory tests. It identifies a precise failure mode of transferring a dimension-conditioned trace certificate outside its interface contract: repetition consistency, spectral consistency, and arbitrarily deep Markov consistency do not by themselves recover the missing dimension assumption.
How much distinguishability can a noisy quantum channel preserve when its input is correlated with an untouched quantum memory? This paper gives an exact finite semidefinite program for that question for every finite-dimensional completely positive, trace-preserving channel. The complete coefficient compares joint states with the same memory marginal. The conditional coefficient instead subtracts the distinguishability already present in the memory. Both coefficients, and conditional mutual-information contraction with a separate conditioning system, equal one minus the reciprocal of an optimization in the channel’s unnormalized Choi matrix. The equivalent inverse formula retains an essential range condition, including for singular channels. The proof solves a centered matrix-Gram problem, shows that its optimization center can be positive, and constructs a signed observable lift through an erasure channel. Two weighted quadratic inequalities give the universal entropy bound. A rare coherent memory sector proves sharpness while preserving both local marginals exactly. A memory of bounded dimension suffices, including with prescribed faithful input marginals. The same program gives exact coefficients for regular modular Petz divergences whose generators have finite endpoint value and recession slope, every fixed Petz Rényi order strictly between zero and one, and quantum Chernoff divergence. Further results include a harmonic dual, an exact tensor-product law, a strict-contraction criterion, a sharp comparison with positive quantum Doeblin minorization, and explicit classical, depolarizing and orthogonal-unitary-noise formulas. Ordinary quantum mutual-information contraction is a different optimization. For qubit depolarization the paper determines its exact value on the full completely positive parameter interval. At shrinkage one half, ordinary relative-entropy, ordinary mutual-information and complete entropy contraction are respectively 1/4, 1/3 and 3/8. In higher dimension, bounds and a strict separation are proved without asserting an exact ordinary-MI formula. A discontinuity between nearly complete amplitude damping and pure reset rules out uniformly bounded-use estimation of the exact coefficient from an unknown channel, even with adaptive experiments and quantum ancillas. Thus evaluation from exact supplied Choi data does not imply stable experimental acquisition. Rare sharpness witnesses can carry vanishing absolute information; the results do not assert a communication rate, physical simulator, general recovery map or polynomial cost in physical qubit count.
Finite local calibration does not by itself determine how a preparation and a detector are related through a joint physical transport. We study the ancilla-orientation family A_theta(rho) = (1-theta)rho + theta rho^Gamma for an arbitrary two-qubit state rho and binary effect E, followed by an unknown joint completely positive trace-preserving channel. Eight jointly transmitted product inputs, comprising the complete X tensor X and Z tensor Z bases, give a complementary-basis bound on the channel's Choi infidelity. A channel-distance estimate and the retained local calibration bound then yield the uniform selector enclosure b_E + sqrt(2 s_rho) + (1+theta)epsilon, including the generally nonpositive candidate. One physical compatibility set gives simultaneous inner and outer confidence intervals for the restricted safe class. A sufficient fixed allocation of 21,600,000 trials has coverage at least 0.99; an explicit integer rule has transpose-exclusion power at least 0.996 at a stated alternative and an accepted upper endpoint at most -0.000620. The construction consumes 43,200,000 prepared qubit instances. Conversely, an exact joint channel can fix every isolated-leg input with the other leg held in |0>, remain at maximal half diamond distance from identity, and change the safe interval while preserving the complete permitted record law. A one-basis phase-channel obstruction provides a second control. The result combines established process-verification methods with a finite-count safety certificate and precisely specified weaker-record obstructions. Compatible complex types, bounded controls, a common transport context, and declared drift remain explicit premises. The source-and-evidence companion preserves the paper-specific Lean sources and historical execution, exact numerical programs and receipts, the separate AI-assisted review return, and the release source/build/validation records. Formal support remains conditional on eleven analytic-law inputs and three acquisition contracts. No end-to-end formal verification, experimental validation, or external human peer review is claimed. Release rights are scoped by component: CC BY 4.0 for the article and author-owned documentation/data; a newly prepared MIT grant for original author-owned software and Lean sources; and the original licenses and notices for third-party or inherited material. The companion rights notice specifies the scope and exclusions.
How much memory does it take to apply the same quantum channel many times, when each output must be released before the next input arrives and every retained qubit counts? One-use invariants do not decide it. Two explicit channels on dimension 1664 have identical normalized Choi spectra (32 eigenvalues 1/32), the same maximal complementary entropy 5, and zero asymptotic purity cost. At the same optimal exchange rate, one is implemented exactly with five memory qubits for any number of uses, while the other needs Omega(n^(1/(2 log_2(107)+2))) memory qubits for n uses, at every fixed error at most 1/16 and whatever purity is available; memory O(n^(1/3) log^(4/3) n) suffices for it. The hard channel is built from Houghton's group H_3. Behind the example is a general theory: the achievable exchange and purity rates, the purity cost kappa, which vanishes exactly on the closure of finite tracial factorizations, and memory bounds from how well a channel's environment is approximated by finite ones, and, for channels built from finite presentations, from the approximation profile of the group. Version 1.1 adds where the expensive channels lie: on the relative boundary of the closure; any fixed depolarizing admixture brings them down to polylogarithmic memory at the rank rate; on a face containing the Houghton channel a single moment of a trace on the group decides expense; and one free fermion per site already forces polynomial memory. Version 1.1.1 adds a map of what the main separation depends on (published inputs, companion results and new arguments), sets finite-budget and asymptotic-rate statements side by side, cites the companion papers at their published versions, pins the tested software versions, and makes every check refuse to run under optimized Python. The mathematical results are unchanged. Version 1.1.2 corrects attributions and makes two headline statements precise. The separation of Theorem A is stated at the exchange budget 5n/2, and the channels that need polynomial memory at every exchange rate are those with purity limited to O(log n). Credits added or corrected: Bisio, D'Ariano, Perinotti and Chiribella, and Bisio, D'Ariano, Perinotti and Sedlak; Boes et al. for the square-root dephasing construction; Lie, Son, Boes, Ng and Wilming for the exact case of the tracialization lemma; Faist, Berta and Brandao for the relation to the thermodynamic capacity; Haagerup, Musat and Rordam for the moment criteria; Thoma, Johnson, Watrous, Horodecki-Oppenheim-Winter and Lie-Jeong; Cornulier for the Baumslag-Solitar bound. Known results are moved out of numbered statements. The mathematical results and the numbering are unchanged. All operational bounds use complete-experiment error against adaptive observers with quantum references. The general rate-region achievability result uses a cited closed-device theorem; the explicit separation does not. This preprint archive includes the PDF, TeX source, finite verification scripts, and scoped Lean arithmetic proofs. The artifacts do not formally verify the entire manuscript; their scope and external dependencies are documented in verification/README.md.