Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1701.03394 · Journal of Mathematical Physics

Minimal sufficient statistical experiments on von Neumann algebras

Yui Kuramochi

Published Jun 1, 2017• 7 citations
arXivHTMLPDF

Abstract

A statistical experiment on a von Neumann algebra is a parametrized family of normal states on the algebra. This paper introduces the concept of minimal sufficiency for statistical experiments in such operator algebraic situations. We define equivalence relations of statistical experiments indexed by a common parameter set by completely positive or Schwarz coarse-graining and show that any statistical experiment is equivalent to a minimal sufficient statistical experiment unique up to normal isomorphism of outcome algebras. We also establish the relationship between the minimal sufficiency condition for a statistical experiment in this paper and those for subalgebra. These concepts and results are applied to the concatenation relation for completely positive channels with general input and outcome von Neumann algebras. In the case of the quantum-classical channel corresponding to the positive-operator valued measure (POVM), we prove the equivalence of the minimal sufficient condition previously proposed by the author and that in this paper. We also give a characterization of the discreteness of a POVM up to postprocessing equivalence in terms of the corresponding quantum-classical channel.

DOI
10.1063/1.4986247

Related papers

Directed-Completeness of Quantum Statistical Experiments in the Randomization Order

Yui Kuramochi

A parametrized family of normal states on a von Neumann algebra is called a statistical experiment, which generalizes the corresponding concepts in classical statistics and finite-dimensional quantum systems. We introduce randomization preorder and equivalence relations for statistical experiments with a fixed parameter set and for normal channels with a fixed input space by post-processing completely positive channels. In this paper, we prove that the set of equivalence classes of statistical experiments or those of normal channels is an upper and lower directed-complete partially ordered set with respect to the randomization order, i.e. any increasing or decreasing net of statistical experiments or channels has its supremum or infimum in the randomization order. We also show that if the outcome space of each statistical experiment or channel of a randomization-monotone net is commutative, the outcome space of the supremum or infimum can also be taken to be commutative. We consider two examples of homogeneous Markov processes of channels on infinite-dimensional separable Hilbert spaces, namely block-diagonalization with irrational translation and ideal quantum linear amplifier channels, and explicitly derive their infima. Throughout the paper, the concept of channel conjugation is used to obtain results for decreasing channels from those for increasing channels.

arXiv:1805.04357•Open Systems & Information Dynamics•Mar 1, 2020•3 citations

Quantum incompatibility of channels with general outcome operator algebras

Yui Kuramochi

A pair of quantum channels is said to be incompatible if they cannot be realized as marginals of a single channel. This paper addresses the general structure of the incompatibility of completely positive channels with a fixed quantum input space and with general outcome operator algebras. We define a compatibility relation for such channels by identifying the composite outcome space as the maximal (projective) C*-tensor product of outcome algebras. We show theorems that characterize this compatibility relation in terms of the concatenation and conjugation of channels, generalizing the recent result for channels with quantum outcome spaces. These results are applied to the positive operator valued measures (POVMs) by identifying each of them with the corresponding quantum-classical (QC) channel. We also give a characterization of the maximality of a POVM with respect to the post-processing preorder in terms of the conjugate channel of the QC channel. We consider another definition of compatibility of normal channels by identifying the composite outcome space with the normal tensor product of the outcome von Neumann algebras. We prove that for a given normal channel, the class of normally compatible channels is upper bounded by a special class of channels called tensor conjugate channels. We show the inequivalence of the C*- and normal compatibility relations for QC channels, which originates from the possibility and impossibility of copying operations for commutative von Neumann algebras in C*- and normal compatibility relations, respectively.

arXiv:1708.00150•Journal of Mathematical Physics•Apr 1, 2018•15 citations

Some aspects of quantum sufficiency for finite and full von Neumann algebras

Andrzej Łuczak

Abstract Some features of the notion of sufficiency in quantum statistics are investigated. Three kinds of this notion are considered: plain sufficiency (called simply: sufficiency), strong sufficiency and Umegaki’s sufficiency. It is shown that for a finite von Neumann algebra with a faithful family of normal states the minimal sufficient von Neumann subalgebra is sufficient in Umegaki’s sense. Moreover, a proper version of the factorization theorem of Jenčová and Petz is obtained. The structure of the minimal sufficient subalgebra is described in the case of pure states on the full algebra of all bounded linear operators on a Hilbert space.

Letters in Mathematical Physics•Jul 14, 2021•0 citations

Sufficiency and Petz recovery for positive maps

Lauritz van Luijk, Henrik Wilming

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 $α$-$z$ 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 prove Frenkel's formula for approximately finite-dimensional von Neumann algebras.

quant-pharXiv:2604.08380•Apr 10, 2026•0 citations

Minimal sufficient positive-operator valued measure on a separable Hilbert space

Yui Kuramochi

We introduce a concept of a minimal sufficient positive-operator valued measure (POVM), which is the least redundant POVM among the POVMs that have the equivalent information about the measured quantum system. Assuming the system Hilbert space to be separable, we show that for a given POVM, a sufficient statistic called a Lehmann-Scheffé-Bahadur statistic induces a minimal sufficient POVM. We also show that every POVM has an equivalent minimal sufficient POVM and that such a minimal sufficient POVM is unique up to relabeling neglecting null sets. We apply these results to discrete POVMs and information conservation conditions proposed by the author.

arXiv:1506.07288•Journal of Mathematical Physics•Oct 1, 2015•15 citations

Minimal sufficient positive-operator valued measure on a separable Hilbert space

Yui Kuramochi

We introduce a concept of a minimal sufficient positive-operator valued measure (POVM), which is the least redundant POVM among the POVMs that have the equivalent information about the measured quantum system. Assuming the system Hilbert space to be separable, we show that for a given POVM, a sufficient statistic called a Lehmann-Scheffé-Bahadur statistic induces a minimal sufficient POVM. We also show that every POVM has an equivalent minimal sufficient POVM and that such a minimal sufficient POVM is unique up to relabeling neglecting null sets. We apply these results to discrete POVMs and information conservation conditions proposed by the author.

•Oct 22, 2015•6 citations
A statistical experiment on a von Neumann algebra is a parametrized family of normal states on the algebra. This paper introduces the concept of minimal sufficiency for statistical experiments in such operator algebraic situations. We define equivalence relations of statistical experiments indexed by a common parameter set by completely positive or Schwarz coarse-graining and show that any statistical experiment is equivalent to a minimal sufficient statistical experiment unique up to normal isomorphism of outcome algebras. We also establish the relationship between the minimal sufficiency condition for a statistical experiment in this paper and those for subalgebra. These concepts and results are applied to the concatenation relation for completely positive channels with general input and outcome von Neumann algebras. In the case of the quantum-classical channel corresponding to the positive-operator valued measure (POVM), we prove the equivalence of the minimal sufficient condition previously proposed by the author and that in this paper. We also give a characterization of the discreteness of a POVM up to postprocessing equivalence in terms of the corresponding quantum-classical channel.
A parametrized family of normal states on a von Neumann algebra is called a statistical experiment, which generalizes the corresponding concepts in classical statistics and finite-dimensional quantum systems. We introduce randomization preorder and equivalence relations for statistical experiments with a fixed parameter set and for normal channels with a fixed input space by post-processing completely positive channels. In this paper, we prove that the set of equivalence classes of statistical experiments or those of normal channels is an upper and lower directed-complete partially ordered set with respect to the randomization order, i.e. any increasing or decreasing net of statistical experiments or channels has its supremum or infimum in the randomization order. We also show that if the outcome space of each statistical experiment or channel of a randomization-monotone net is commutative, the outcome space of the supremum or infimum can also be taken to be commutative. We consider two examples of homogeneous Markov processes of channels on infinite-dimensional separable Hilbert spaces, namely block-diagonalization with irrational translation and ideal quantum linear amplifier channels, and explicitly derive their infima. Throughout the paper, the concept of channel conjugation is used to obtain results for decreasing channels from those for increasing channels.
A pair of quantum channels is said to be incompatible if they cannot be realized as marginals of a single channel. This paper addresses the general structure of the incompatibility of completely positive channels with a fixed quantum input space and with general outcome operator algebras. We define a compatibility relation for such channels by identifying the composite outcome space as the maximal (projective) C*-tensor product of outcome algebras. We show theorems that characterize this compatibility relation in terms of the concatenation and conjugation of channels, generalizing the recent result for channels with quantum outcome spaces. These results are applied to the positive operator valued measures (POVMs) by identifying each of them with the corresponding quantum-classical (QC) channel. We also give a characterization of the maximality of a POVM with respect to the post-processing preorder in terms of the conjugate channel of the QC channel. We consider another definition of compatibility of normal channels by identifying the composite outcome space with the normal tensor product of the outcome von Neumann algebras. We prove that for a given normal channel, the class of normally compatible channels is upper bounded by a special class of channels called tensor conjugate channels. We show the inequivalence of the C*- and normal compatibility relations for QC channels, which originates from the possibility and impossibility of copying operations for commutative von Neumann algebras in C*- and normal compatibility relations, respectively.
Abstract Some features of the notion of sufficiency in quantum statistics are investigated. Three kinds of this notion are considered: plain sufficiency (called simply: sufficiency), strong sufficiency and Umegaki’s sufficiency. It is shown that for a finite von Neumann algebra with a faithful family of normal states the minimal sufficient von Neumann subalgebra is sufficient in Umegaki’s sense. Moreover, a proper version of the factorization theorem of Jenčová and Petz is obtained. The structure of the minimal sufficient subalgebra is described in the case of pure states on the full algebra of all bounded linear operators on a Hilbert space.
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 ααα-zzz 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 prove Frenkel's formula for approximately finite-dimensional von Neumann algebras.
We introduce a concept of a minimal sufficient positive-operator valued measure (POVM), which is the least redundant POVM among the POVMs that have the equivalent information about the measured quantum system. Assuming the system Hilbert space to be separable, we show that for a given POVM, a sufficient statistic called a Lehmann-Scheffé-Bahadur statistic induces a minimal sufficient POVM. We also show that every POVM has an equivalent minimal sufficient POVM and that such a minimal sufficient POVM is unique up to relabeling neglecting null sets. We apply these results to discrete POVMs and information conservation conditions proposed by the author.
We introduce a concept of a minimal sufficient positive-operator valued measure (POVM), which is the least redundant POVM among the POVMs that have the equivalent information about the measured quantum system. Assuming the system Hilbert space to be separable, we show that for a given POVM, a sufficient statistic called a Lehmann-Scheffé-Bahadur statistic induces a minimal sufficient POVM. We also show that every POVM has an equivalent minimal sufficient POVM and that such a minimal sufficient POVM is unique up to relabeling neglecting null sets. We apply these results to discrete POVMs and information conservation conditions proposed by the author.