Relative quantumness data-processing conjecture for CoP channels

Less than 1 year old · traced to

Let H\mathcal H be a finite-dimensional Hilbert space, let ρ,σ∈D(H)\rho,\sigma\in\mathcal D(\mathcal H) satisfy [ρ,σ]≠0[\rho,\sigma]\neq0, and let ρε,σε\rho_\varepsilon,\sigma_\varepsilon be their regularized states. A commutativity-preserving (CoP) channel is a CPTP map N:B(H)→B(H)\mathcal N:\mathcal B(\mathcal H)\to\mathcal B(\mathcal H) that maps every commuting pair of states to a commuting pair. Assume

supp⁡ ⁣(N(ρε))⊆supp⁡ ⁣(N(σε)).\operatorname{supp}\!\bigl(\mathcal N(\rho_\varepsilon)\bigr)\subseteq\operatorname{supp}\!\bigl(\mathcal N(\sigma_\varepsilon)\bigr).

Relative quantumness data-processing conjecture. Under these assumptions,

Q(ρε∥σε)≥Q(N(ρε)∥N(σε))≥0.Q(\rho_\varepsilon\|\sigma_\varepsilon)\geq Q\left(\mathcal N(\rho_\varepsilon)\|\mathcal N(\sigma_\varepsilon)\right)\geq0.

The conjecture asks whether relative quantumness is monotone under physically relevant commutativity-preserving channels for non-commuting inputs. The support condition ensures that the regularized functional remains well-defined even when channel outputs are rank-deficient; the data-processing inequality is not established in the supplied text.

References

Primary source

Atirat Meunson and Tanapat Deesuwan, “Cumulant-based quantum relative Rényi functional”, arXiv:2606.31205 (2026).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.