Within flagged unitary–replacer channels, optimized recovered entanglement fidelity is spectrally incomplete: it fixes weighted transparency but not the hidden replacer spectrum or conditional Choi entropy. For a resolved positive-probability sector with known transparency 0 ≤ a < 1, we prove a family-specific noncommutative triangular transfer from conditional Choi moments M2, . . . , Md to hidden-spectrum power sums. Recursive inversion, Newton–Girard identities, and a rank-one step recover the unordered replacer and conditional Choi spectra, including multiplicities and zero eigenvalues. The order-d threshold is sharp within the consecutive sector-resolved hierarchy: every truncation below d fails local injectivity on positive simple-spectrum chambers. At fixed dimension and flag distribution, we also determine the complete homogeneous and heterogeneous fixed-fidelity Choi-entropy intervals, including lower/equality structure, interval filling, and heterogeneous optimizer geometry, while retaining the established quantum-Fano upper envelope. With transparency unknown, the consecutive map (a, λ) ↦ (M2, . . . , Md+1) is generically locally invertible on the positive ordered simple-spectrum interior for every d ≥ 2. Global uniqueness holds in d = 2, 3; for the specific map F4 = (M2, M3, M4, M5), d = 4 exhibits an exact open two-sheet ambiguity with exactly two ordered physical inverse branches, while d ≥ 5 remains unresolved. At a = 1, the moments lose all replacer-spectrum information. The results are family-specific and assume sector-resolved access; they do not imply universal channel reconstruction, tomography, or resource optimality.
Within flagged unitary–replacer channels, optimized recovered entanglement fidelity is spectrally incomplete: it fixes weighted transparency but not the hidden replacer spectrum or conditional Choi entropy. For a resolved positive-probability sector with known transparency 0 ≤ a < 1, we prove a family-specific noncommutative triangular transfer from conditional Choi moments M2, . . . , Md to hidden-spectrum power sums. Recursive inversion, Newton–Girard identities, and a rank-one step recover the unordered replacer and conditional Choi spectra, including multiplicities and zero eigenvalues. The order-d threshold is sharp within the consecutive sector-resolved hierarchy: every truncation below d fails local injectivity on positive simple-spectrum chambers. At fixed dimension and flag distribution, we also determine the complete homogeneous and heterogeneous fixed-fidelity Choi-entropy intervals, including lower/equality structure, interval filling, and heterogeneous optimizer geometry, while retaining the established quantum-Fano upper envelope. With transparency unknown, the consecutive map (a, λ) ↦ (M2, . . . , Md+1) is generically locally invertible on the positive ordered simple-spectrum interior for every d ≥ 2. Global uniqueness holds in d = 2, 3; for the specific map F4 = (M2, M3, M4, M5), d = 4 exhibits an exact open two-sheet ambiguity with exactly two ordered physical inverse branches, while d ≥ 5 remains unresolved. At a = 1, the moments lose all replacer-spectrum information. The results are family-specific and assume sector-resolved access; they do not imply universal channel reconstruction, tomography, or resource optimality.
Within flagged unitary–replacer channels, optimized recovered entanglement fidelity is spectrally incomplete: it fixes weighted transparency but not the hidden replacer spectrum or conditional Choi entropy. For a resolved positive-probability sector with known transparency 0 ≤ a < 1, we prove a family-specific noncommutative triangular transfer from conditional Choi moments M₂,...,M_d to hidden-spectrum power sums. Recursive inversion, Newton–Girard identities, and a rank-one step recover the unordered replacer and conditional Choi spectra, including multiplicities and zero eigenvalues. The order-d threshold is sharp within the consecutive sector-resolved hierarchy: every truncation below d fails local injectivity on positive simple-spectrum chambers. At fixed dimension and flag distribution, we also determine the complete homogeneous and heterogeneous fixed-fidelity Choi-entropy intervals, including lower/equality structure, interval filling, and heterogeneous optimizer geometry, while retaining the established quantum-Fano upper envelope. With transparency unknown, the consecutive map (a, λ) ↦ (M₂,...,M_{d+1}) is generically locally invertible on the positive ordered simple-spectrum interior for every d ≥ 2. Global uniqueness holds in d = 2, 3; for the specific map F₄ = (M₂, M₃, M₄, M₅), d = 4 exhibits an exact open two-sheet ambiguity with exactly two ordered physical inverse branches, while d ≥ 5 remains unresolved. At a = 1, the moments lose all replacer-spectrum information. The results are family-specific and assume sector-resolved access; they do not imply universal channel reconstruction, tomography, or resource optimality.
A finite-dimensional physical processor cannot exactly program a continuous family of distinct unitary channels. We show that this obstruction becomes quantitative when the target channel is stored in a normalized Choi state and its output observables are reconstructed by sampling physical channels and classically post-processing their measurement outcomes. For arbitrary d-dimensional channels, we construct a target-independent exact reconstruction protocol and prove the optimal one-copy sampling overhead, which grows quadratically with system dimension. We further prove the sharp fixed-d law that the excess overhead vanishes inversely with the number of identical Choi programs. The upper bound combines deterministic port-based teleportation with a quasi-decomposition that corrects its depolarizing distortion. The converse maps any low-overhead reconstruction protocol to a physical learner of unknown unitaries and uses local quantum estimation to recover the same leading coefficient. These results recast the universal no-programming obstruction as a quantitative trade-off between quantum program memory and classical sampling, with a leading cost that reflects the locally learnable unitary degrees of freedom.
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.
A quantum instrument is not determined by its induced positive-operator-valued measure (POVM) and nonselective channel, yet the global control consequences of this residual branch structure remain incompletely characterized. We study the nondegenerate fiber of instruments with both marginals fixed. The subgroup of outcome permutations preserving the effect tuple acts as the deck group of the ordered outcome-frame covering, and closed loops define a conjugacy-class-valued monodromy representation. Nontrivial monodromy obstructs continuous global branch labeling based only on local process continuity. We construct an explicit cyclic family with a uniform m-outcome POVM and a fixed completely dephasing channel, derive robust overlap-based reconstruction and a conservative finite-sample guarantee, and certify entangled conditional Choi states although the nonselective channel is entanglement breaking. For a noisy cyclic family, we prove an exact minimax separation in conditional feedback: recovery rules restricted to the two marginals and the reported local outcome have optimal worst-sector entanglement fidelity 1/m, whereas an outcome-frame-aware controller attains 1-lambda+lambda/m. The exact minimax value of the missing outcome-frame information is therefore (1-lambda)(1-1/m). The results remain entirely within standard finite-dimensional quantum mechanics and are positioned as an instrument-level, permutation-valued specialization of established Kraus-frame/channel holonomy with a distinct global-labeling and feedback limitation.
Inverse Geometry and Identifiability of Protocol Ratios in Dynamical-Decoupling Spectroscopy This work develops an inverse identifiability framework for protocol ratios in dynamical-decoupling spectroscopy. Building on reduced observation geometry, it asks the inverse question: given an observed protocol ratio, what spectral information is uniquely reconstructible, what is only weakly constrained, and what is fundamentally unrecoverable? The analysis is formulated in terms of the Jacobian of the reduced observation map and the associated Fisher information matrix. The paper shows that the inverse problem separates into three qualitatively distinct sectors. In the regular sector, the ratio map is locally invertible and reconstruction accuracy is controlled by a Cramér–Rao bound. For the pure power-law family S(ω)=Aω^α, the ratio R(α)=2/(1+2^{-α}) is strictly monotone, admits a closed-form inverse, and yields an explicit conditioning profile through the slope ∂_αR. In the degenerate sector, exemplified by the white-noise family S(ω)=A, the protocol ratio is exactly pinned to R=1 for all amplitudes. The Fisher information for the amplitude direction vanishes identically, so amplitude reconstruction from ratio data alone is impossible. This gives an exact no-go theorem for identifiability from protocol ratios in the white-noise case. In the branched sector, non-injectivity of the inverse map produces intrinsic ambiguity. Using the mixed family S(ω; α1, α2, w)=wAω^{α1}+(1−w)Aω^{α2}, the paper shows both global non-injectivity and local fold branching. Along an explicit symmetric slice, the ratio develops a fold at Rc=4/3, so nearby observed values admit two distinct inverse branches. These results establish protocol ratios as inverse-geometric probes with sharply defined domains of identifiability and intrinsic limits of spectral reconstruction. The framework clarifies the difference between unique inference, exact information collapse, and multi-valued inversion, and provides a basis for future extensions to multi-ratio, mixed-spectrum, and frequency-resolved inverse design. V2:This work develops an inverse identifiability framework for protocol ratios in dynamical-decoupling spectroscopy. Interpreting the reduced observation map through Fisher information, we show that the inverse problem separates into three sectors: regular (locally invertible with Cramér–Rao bounds), degenerate (exact collapse with vanishing Fisher information), and branched (non-injective with multiple solutions). Using power-law and mixed spectral families, we derive explicit inversion formulas, a white-noise no-go theorem, and fold-induced branching. The framework establishes protocol ratios as inverse-geometric probes with sharply defined limits of spectral reconstruction.
We determine the complete equal-reference Umegaki relative-entropy contraction coefficient of every finite-dimensional quantum channel. For its unnormalized Choi matrix J, let H be the largest output subspace with ℂⁿ ⊗ H ⊆ supp J, and let M(ρ) be the compression to H of Tr_A[(ρᵀ ⊗ I)J⁺]. The coefficient is 1 − min_ρ Tr_H M(ρ)⁻¹, with the minimum set to zero when H = {0}. A Kraus cancellation inequality gives the upper bound, and a weighted trace-zero operator basis gives matching faithful pairs with both marginals equal and reference dimension n². The complementary coefficient has a reciprocal radius formula, a finite semidefinite representation, and an exact product law. Strict contraction is equivalent to a nonzero completely positive replacer minorant. The formula also gives the exact coefficient of depolarizing channels throughout their physical parameter range. The general matching family has vanishing input divergence; its logarithmic rate is pointwise for a fixed faithful input density, with separate finite-accuracy bounds for optimization and conditioning. A different construction retains any prescribed positive limiting divergence when the coefficient is one. This cannot hold universally: a complete nonlinear bound for binary symmetric channels forces every maximizing sequence to lose input divergence, regardless of reference dimension. The positive construction still has vanishing trace distance and exponentially small regularization; no fixed-error or capacity conclusion follows. A visual guide records the mathematical routes, proof dependencies, and provenance of the result.