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:0911.4419 · Mathematica Slovaca

Weakly sufficient quantum statistics

Katarzyna Lubnauer, Andrzej Łuczak, Hanna Podsȩdkowska

Published Nov 2, 2011• 2 citations
arXivHTMLPDF

Abstract

Abstract Some aspects of weak sufficiency of quantum statistics are investigated. In particular, we give necessary and sufficient conditions for the existence of a weakly sufficient statistic for a given family of vector states, investigate the problem of its minimality, and find the relation between weak sufficiency and other notions of sufficiency employed so far.

DOI
10.2478/s12175-011-0062-x

Related papers

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

Quantum Sufficiency in the Operator Algebra Framework

Andrzej Łuczak

The paper is devoted to the investigation of the notion of sufficiency in quantum statistics. Three kinds of this notion are considered: plain sufficiency (called simply: sufficiency), Petz’s sufficiency, and Umegaki’s sufficiency. The problem of the existence and structure of the minimal sufficient subalgebra is analyzed in some detail, conditions yielding equivalence of the three modes of sufficiency are considered, and quantum Basu’s theorem is obtained. Moreover, it is shown that an interesting “factorization theorem” of Jenčová and Petz needs some corrections to hold true.

International Journal of Theoretical Physics•Jul 31, 2013•11 citations

An example of a quantum statistical model which cannot be mapped to a less informative one by any trace preserving positive map

Keiji Matsumoto

Comparison of statistical models (experiments) is an important branch of mathematical statistics, which gives deep insights in many aspects of foundation of statistics. So far, there are two quantum versions of the concept: Comparison with respect to classical tasks and full quantum tasks. In the latter version, a quantum statistical model is more informative than another if and only if a trace preserving positive map sends the former to the latter. On the other hand, in the former version, the existence of a trace preserving positive map sending the former to the latter is a useful sufficient condition. A natural question is whether this is necessary or not. We resolve this question negatively by giving a counter example.

arXiv:1409.5658•Sep 19, 2014•8 citations

SUFFICIENCY IN QUANTUM STATISTICAL INFERENCE: A SURVEY WITH EXAMPLES

Anna Jenčová, Dėnes Petz

This paper attempts to give an overview about sufficiency in the setting of quantum statistics. The basic concepts are treated in parallel to the measure theoretic case. It turns out that several classical examples and results have a noncommutative analogue. Some of the results are presented without proof (but with exact references) and the presentation is intended to be self-contained. The main examples discussed in the paper are related to the Weyl algebra and to the exponential family of states. The characterization of sufficiency in terms of quantum Fisher information is a new result.

arXiv:quant-ph/0604091•Infinite Dimensional Analysis Quantum Probability and Related Topics•Sep 1, 2006•35 citations

A note on Korobov lattice rules for integration of analytic functions

Friedrich Pillichshammer

We study numerical integration for a weighted Korobov space of analytic periodic functions for which the Fourier coefficients decay exponentially fast. In particular, we are interested in how the error depends on the dimension d. Many recent papers deal with this problem or similar problems and provide matching necessary and sufficient conditions for various notions of tractability. In most cases even simple algorithms are known which allow to achieve these notions of tractability. However, there is a gap in the literature: while for the notion of exponential-weak tractability one knows matching necessary and sufficient conditions, so far no explicit algorithm has been known which yields the desired result. In this paper we close this gap and prove that Korobov lattice rules are suitable algorithms in order to achieve exponential-weak tractability for integration in weighted Korobov spaces of analytic periodic functions.

arXiv:2010.03286•Journal of Complexity•Oct 10, 2020•0 citations

Necessary and Sufficient Condition for Quantum State-Independent Contextuality

Adán Cabello, Matthias Kleinmann, Costantino Budroni

We solve the problem of whether a set of quantum tests reveals state-independent contextuality and use this result to identify the simplest set of the minimal dimension. We also show that identifying state-independent contextuality graphs [R. Ramanathan and P. Horodecki, Phys. Rev. Lett. 112, 040404 (2014)] is not sufficient for revealing state-independent contextuality.

arXiv:1501.03432•Physical Review Letters•Jun 24, 2015•51 citations
Abstract Some aspects of weak sufficiency of quantum statistics are investigated. In particular, we give necessary and sufficient conditions for the existence of a weakly sufficient statistic for a given family of vector states, investigate the problem of its minimality, and find the relation between weak sufficiency and other notions of sufficiency employed so far.
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.
The paper is devoted to the investigation of the notion of sufficiency in quantum statistics. Three kinds of this notion are considered: plain sufficiency (called simply: sufficiency), Petz’s sufficiency, and Umegaki’s sufficiency. The problem of the existence and structure of the minimal sufficient subalgebra is analyzed in some detail, conditions yielding equivalence of the three modes of sufficiency are considered, and quantum Basu’s theorem is obtained. Moreover, it is shown that an interesting “factorization theorem” of Jenčová and Petz needs some corrections to hold true.
Comparison of statistical models (experiments) is an important branch of mathematical statistics, which gives deep insights in many aspects of foundation of statistics. So far, there are two quantum versions of the concept: Comparison with respect to classical tasks and full quantum tasks. In the latter version, a quantum statistical model is more informative than another if and only if a trace preserving positive map sends the former to the latter. On the other hand, in the former version, the existence of a trace preserving positive map sending the former to the latter is a useful sufficient condition. A natural question is whether this is necessary or not. We resolve this question negatively by giving a counter example.
This paper attempts to give an overview about sufficiency in the setting of quantum statistics. The basic concepts are treated in parallel to the measure theoretic case. It turns out that several classical examples and results have a noncommutative analogue. Some of the results are presented without proof (but with exact references) and the presentation is intended to be self-contained. The main examples discussed in the paper are related to the Weyl algebra and to the exponential family of states. The characterization of sufficiency in terms of quantum Fisher information is a new result.
We study numerical integration for a weighted Korobov space of analytic periodic functions for which the Fourier coefficients decay exponentially fast. In particular, we are interested in how the error depends on the dimension d. Many recent papers deal with this problem or similar problems and provide matching necessary and sufficient conditions for various notions of tractability. In most cases even simple algorithms are known which allow to achieve these notions of tractability. However, there is a gap in the literature: while for the notion of exponential-weak tractability one knows matching necessary and sufficient conditions, so far no explicit algorithm has been known which yields the desired result. In this paper we close this gap and prove that Korobov lattice rules are suitable algorithms in order to achieve exponential-weak tractability for integration in weighted Korobov spaces of analytic periodic functions.