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.
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.
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.
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.
Quantum experiments without a definite causal order offer new ways to distinguish devices, estimate physical parameters, and communicate. We prove a common limit on these tasks: the geometric Rényi divergence at the output of a deterministic completely positive process cannot exceed the sum of the divergences of its individual channel uses. The inequality holds for every Rényi order in (0,1)∪(1,2] and any number of independently replaceable channels. Parallel experiments with separate reference-assisted inputs approach the bound, giving an exact equality after optimization over processes. We also prove an additive bound on the right logarithmic derivative Fisher information of parameter-dependent channels under every fixed process in this class. A resulting Cramér--Rao bound limits locally unbiased estimation precision without assuming a definite causal order, and an erasure-probability example attains the bound. The proofs for the geometric Rényi divergence and RLD Fisher information follow from the requirement that every independent choice of channels produce a normalized output. We show how this requirement controls positive local operations, and how small channel perturbations convert the divergence inequality into a Fisher-information bound, including for singular channels. Further applications give finite-use bounds on channel discrimination and exclusion, together with communication and private-state-generation converses when the processes preserve the relevant comparison conditions.
We compare three quantum information contraction coefficients and determine when contraction close to its optimum can retain nonvanishing input divergence. Using the exact complete coefficient and complex inverse-pencil inequality of SR-012, we prove that conditional relative-entropy contraction, conditional mutual-information contraction, and complete equal-reference contraction have the same coefficient for every finite quantum channel. For a depolarizing qubit with parameter −1/3 ≤ λ ≤ 1, the ordinary mutual-information coefficient is 2λ²/(1+λ), whereas the complete and conditional coefficients are 3λ²/(1+2λ). These differ strictly except at λ = 0, 1; at half-depolarization the values are 1/3 and 3/8. For a general channel with input dimension at least two, let P project onto the largest output subspace whose tensor product with the input space lies in the Choi support, and put b = ‖N*(I−P)‖op. A maximizing sequence with input divergence bounded away from zero exists exactly when b = ηc. In this case every positive limiting divergence is possible with reference dimension at most the square of the input dimension. Otherwise an explicit nonlinear deficit is uniform over all finite references, including growing ones. The proof gives an eighteenth-power trace-distance deficit in general and a fourth-power bound for faithful Choi matrices. Product criteria and logarithmic copy bounds follow. The mutual-information lower family converges pointwise with vanishing input information; the positive-divergence construction has vanishing trace distance. Neither construction establishes a fixed-error or capacity statement, and the resource constants are not claimed optimal. A visual guide records the mathematical routes, joint proof dependencies, and provenance of the results.
We prove a generalized quantum Stein lemma for parallel discrimination of an arbitrary finite-dimensional channel against families of alternative channels. The alternatives are compact and convex, closed under tensor products, and contain a faithful replacer. At every fixed type-I error tolerance, the optimal type-II error exponent equals the regularized Umegaki channel relative entropy minimized over the alternatives, and both defining limits exist. Inputs may be entangled across channel uses and with a reference system. The main technical result constructs exactly trace-preserving approximations with exponentially small diamond error, dominated in completely positive order by free channels at every rate above the common exponent. The proof combines uniform auxiliary map approximation, iterative reduction of the domination rate, and tensor amplification. It yields asymptotic equipartition with trace-preserving smoothing at every subexponentially vanishing error, an exponential strong converse, and stability under vanishing diamond-norm perturbations. Under additional permutation invariance and closure under insertion of a fixed faithful input state and discarding of its output, we also prove an explicit finite-block completion bound. This quantitative construction uses weighted discarding, local operator corrections, and comparison with auxiliary extensions. Applications include state-preserving, coherence-restricted, covariant, entanglement-breaking, and positive-partial-transpose channels. For isometric targets against entanglement-breaking or positive-partial-transpose alternatives, we obtain exact finite-block testing and smoothing formulas.
The channel right-logarithmic-derivative (RLD) Fisher information is a computable upper bound on the optimal asymptotic symmetric-logarithmic-derivative (SLD) Fisher information per channel use over causally ordered, parameter-independent strategies. The bound is not always attained, even if the Choi matrix is positive definite. We determine exactly when equality holds using a semidefinite feasibility condition involving only the Choi matrix and its first derivative. The condition allows a degenerate largest eigenvalue of the RLD matrix and rank-deficient Choi matrices with derivatives supported on their range. The original channel family may change rank nearby. For generalized dephasing channels with a positive-definite correlation matrix at the evaluation point, the condition becomes a system of linear equations for nonnegative certificate weights that sum to one. At a completely dephasing point we also calculate the optimal SLD information for every finite number of uses and show that a repeated, ancilla-free probe attains it, even against adaptive strategies. Explicit examples give an unbounded ratio of the channel RLD information to the optimal asymptotic SLD information per use, either as the dimension grows or at fixed qubit dimension as the smallest Choi eigenvalue tends to zero. We derive the equality criterion and its consequences from the asymptotic optimization of Zhou and Jiang.