Directed-completeness of quantum statistical experiments in the randomization order
Yui Kuramochi

TL;DR
This paper establishes that the set of equivalence classes of quantum statistical experiments and channels is mathematically complete in the randomization order, allowing for the existence of least upper and greatest lower bounds in this framework.
Contribution
It introduces the concept of directed-completeness for the set of statistical experiments and channels under the randomization order, extending classical and finite-dimensional quantum results.
Findings
Set of equivalence classes is upper and lower directed-complete.
Supremum and infimum exist for nets of experiments and channels.
Explicit derivation of infima for specific quantum channels.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
