Back to Explorer
Research PaperResearchia:202604.11068[Quantum Computing > Quantum Physics]

Sufficiency and Petz recovery for positive maps

Lauritz van Luijk

Abstract

We study the interconversion of families of quantum states ("statistical experiments") via positive, trace-preserving (PTP) maps and clarify its mathematical structure in terms of minimal sufficient Jordan algebras, which can be seen to generalize the Koashi-Imoto decomposition to the PTP setting. In particular, we show that Neyman-Pearson tests generate the minimal sufficient Jordan algebra, and hence also the minimal sufficient *-algebra corresponding to the Koashi-Imoto decomposition. As applications, we show that a) equality in the data-processing inequality for the relative entropy or the αα-zz quantum Rényi divergence implies the existence of a recovery map also in the PTP case and b) that two dichotomies can be interconverted by PTP maps if and only if they can be interconverted by decomposable, trace-preserving maps. We thoroughly review the necessary mathematical background on Jordan algebras. As a step beyond the finite-dimensional case, we also prove Frenkel's formula for approximately finite-dimensional von Neumann algebras.


Source: arXiv:2604.08380v1 - http://arxiv.org/abs/2604.08380v1 PDF: https://arxiv.org/pdf/2604.08380v1 Original Link: http://arxiv.org/abs/2604.08380v1

Submission:4/11/2026
Comments:0 comments
Subjects:Quantum Physics; Quantum Computing
Original Source:
View Original PDF
arXiv: This paper is hosted on arXiv, an open-access repository
Was this helpful?

Discussion (0)

Please sign in to join the discussion.

No comments yet. Be the first to share your thoughts!