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:1410.3639

Quantum Minimax Theorem

Fuyuhiko Tanaka

Published Oct 14, 2014• 2 citations
arXivHTMLPDF

Abstract

Recently, many fundamental and important results in statistical decision theory have been extended to the quantum system. Quantum Hunt-Stein theorem and quantum locally asymptotic normality are typical successful examples. In the present paper, we show quantum minimax theorem, which is also an extension of a well-known result, minimax theorem in statistical decision theory, first shown by Wald and generalized by LeCam. Our assertions hold for every closed convex set of measurements and for general parametric models of density operator. On the other hand, Bayesian analysis based on least favorable priors has been widely used in classical statistics and is expected to play a crucial role in quantum statistics. According to this trend, we also show the existence of least favorable priors, which seems to be new even in classical statistics.

DOI
10.48550/arxiv.1410.3639

Related papers

Quantum decision theory—minimax approach

Andrzej Łuczak

We show a connection between the minimax and Bayes approaches in quantum decision theory in a general setting of normal states on a von Neumann algebra. In particular, the quantum minimax theorem is proven in a fairly general situation, and it is shown that every minimax strategy is Bayes for some a priori distribution on the set of states—a so-called least favourable prior . Minimax strategies with constant risk are investigated in some detail. It turns out that in dimension greater than two such a strategy can be Bayes for a non-uniform a priori distribution which, at the same time, is a least favourable prior.

Quantum Information Processing•Sep 23, 2025•0 citations

Minimax nonparametric estimation of pure quantum states

Samriddha Lahiry, Michael Nussbaum

In classical statistics, Pinsker’s theorem provides an exact asymptotic minimax bound in nonparametric estimation, improving upon optimal rates of convergence results. We obtain a quantum version of the theorem by establishing asymptotic minimax results for estimation of the displacement vector in a quantum Gaussian white noise model, given by a sequence of shifted vacuum states. Analogous results are then obtained for estimation of a general pure state from an ensemble of identically prepared, independent quantum systems, using the recently established local asymptotic equivalence to the quantum Gaussian white noise model. Optimality holds with respect to the most fundamental distance measure for quantum states, that is, trace norm distance, and in a true quantum sense, allowing for all possible measurements. Adaptive estimators are also obtained for the above cases. As an application, we obtain asymptotic minimax adaptive estimators for Wigner functions of pure states.

The Annals of Statistics•Feb 1, 2022•0 citations

Minimax quantum state estimation under Bregman divergence

Maria Quadeer, Marco Tomamichel, Christopher Ferrie

We investigate minimax estimators for quantum state tomography under general Bregman divergences. First, generalizing the work of Koyama et al. [Entropy 19, 618 (2017)] for relative entropy, we find that given any estimator for a quantum state, there always exists a sequence of Bayes estimators that asymptotically perform at least as well as the given estimator, on any state. Second, we show that there always exists a sequence of priors for which the corresponding sequence of Bayes estimators is asymptotically minimax (i.e. it minimizes the worst-case risk). Third, by re-formulating Holevo's theorem for the covariant state estimation problem in terms of estimators, we find that there exists a covariant measurement that is, in fact, minimax (i.e. it minimizes the worst-case risk). Moreover, we find that a measurement that is covariant only under a unitary 2-design is also minimax. Lastly, in an attempt to understand the problem of finding minimax measurements for general state estimation, we study the qubit case in detail and find that every spherical 2-design is a minimax measurement.

arXiv:1808.08984•Quantum•Mar 4, 2019•8 citations

Quantum Probability for Statisticians: Some New Ideas

Inge Svein Helland

It is argued from several points of view that quantum probabilities might play a role in statistical settings. New approaches toward quantum foundations have postulates that appear to be equally valid in macroscopic settings. One such approach is described here in detail, while two others are briefly sketched. In particular, arguments behind the Born rule, which gives the basis for quantum probabilities, are given. A list of ideas for possible statistical applications of quantum probabilities is provided and discussed. A particular area is machine learning, where there exists substantial literature on links to quantum probability. Here, an idea about model reduction is sketched and is motivated from a quantum probability model. Quantum models can play a role in model reduction, where the partial least squares regression model is a special case. It is shown that for certain experiments, a Bayesian prior given by a quantum probability can be motivated. Quantum decision theory is an emerging discipline that can be motivated by this author’s theory of quantum foundations.

Qeios•Feb 25, 2025•3 citations

Generalised quantum Stein's lemma more robust than ever

Filippo Girardi, Kuan-Yi Lee, Masahito Hayashi +1 more

The generalised quantum Stein's lemma is a key result in quantum hypothesis testing, and connects this fundamental primitive of quantum information processing with quantum resource manipulation, a task that is central for technological applications. Prior works have proved this statement in the idealised setting of independent and identically distributed (i.i.d.) sequences of quantum states, and recent extensions consider also sources that are 'close' to i.i.d., according to the strict notion put forth by Mazzola, Sutter, and Renner. For several applications, however, one would need to consider yet more general sources. We establish a version of the generalised quantum Stein's lemma that is conceptually much simpler and general, as it applies to any source that is asymptotically close to an i.i.d. state with respect to the normalised quantum Wasserstein distance of order 1. As an immediate consequence, we solve the Stein exponent of a scenario where the null hypothesis is arbitrarily varying, expressing it in terms of i.i.d. Stein exponents corresponding to arbitrary states in the convex hull of the null hypothesis base set.

quant-pharXiv:2609.17309•Sep 16, 2026•0 citations

Quantum probability for statisticians; some new ideas

Inge Svein Helland

It is argued from several points of view that quantum probabilities might play a role in statistical settings. New approaches toward quantum foundations have postulates that appear to be equally valid in macroscopic settings. One such approach is described here in detail, while one other is briefly sketched. In particular, arguments behind the Born rule, which gives the basis for quantum probabilities, are given. A list of ideas for possible statistical applications of quantum probabilities is provided and discussed. A particular area is machine learning, where there exists substantial literature on links to quantum probability. Here, an idea about model reduction is sketched and is motivated from a quantum probability model. Quantum models can play a role in model reduction, where the partial least squares regression model is a special case. It is shown that for certain experiments, a Bayesian prior given by a quantum probability can be motivated. Quantum decision theory is an emerging discipline that can be motivated by this author's theory of quantum foundations.

arXiv:2503.02658•Mar 4, 2025•0 citations
Recently, many fundamental and important results in statistical decision theory have been extended to the quantum system. Quantum Hunt-Stein theorem and quantum locally asymptotic normality are typical successful examples. In the present paper, we show quantum minimax theorem, which is also an extension of a well-known result, minimax theorem in statistical decision theory, first shown by Wald and generalized by LeCam. Our assertions hold for every closed convex set of measurements and for general parametric models of density operator. On the other hand, Bayesian analysis based on least favorable priors has been widely used in classical statistics and is expected to play a crucial role in quantum statistics. According to this trend, we also show the existence of least favorable priors, which seems to be new even in classical statistics.
We show a connection between the minimax and Bayes approaches in quantum decision theory in a general setting of normal states on a von Neumann algebra. In particular, the quantum minimax theorem is proven in a fairly general situation, and it is shown that every minimax strategy is Bayes for some a priori distribution on the set of states—a so-called least favourable prior . Minimax strategies with constant risk are investigated in some detail. It turns out that in dimension greater than two such a strategy can be Bayes for a non-uniform a priori distribution which, at the same time, is a least favourable prior.
In classical statistics, Pinsker’s theorem provides an exact asymptotic minimax bound in nonparametric estimation, improving upon optimal rates of convergence results. We obtain a quantum version of the theorem by establishing asymptotic minimax results for estimation of the displacement vector in a quantum Gaussian white noise model, given by a sequence of shifted vacuum states. Analogous results are then obtained for estimation of a general pure state from an ensemble of identically prepared, independent quantum systems, using the recently established local asymptotic equivalence to the quantum Gaussian white noise model. Optimality holds with respect to the most fundamental distance measure for quantum states, that is, trace norm distance, and in a true quantum sense, allowing for all possible measurements. Adaptive estimators are also obtained for the above cases. As an application, we obtain asymptotic minimax adaptive estimators for Wigner functions of pure states.
We investigate minimax estimators for quantum state tomography under general Bregman divergences. First, generalizing the work of Koyama et al. [Entropy 19, 618 (2017)] for relative entropy, we find that given any estimator for a quantum state, there always exists a sequence of Bayes estimators that asymptotically perform at least as well as the given estimator, on any state. Second, we show that there always exists a sequence of priors for which the corresponding sequence of Bayes estimators is asymptotically minimax (i.e. it minimizes the worst-case risk). Third, by re-formulating Holevo's theorem for the covariant state estimation problem in terms of estimators, we find that there exists a covariant measurement that is, in fact, minimax (i.e. it minimizes the worst-case risk). Moreover, we find that a measurement that is covariant only under a unitary 2-design is also minimax. Lastly, in an attempt to understand the problem of finding minimax measurements for general state estimation, we study the qubit case in detail and find that every spherical 2-design is a minimax measurement.
It is argued from several points of view that quantum probabilities might play a role in statistical settings. New approaches toward quantum foundations have postulates that appear to be equally valid in macroscopic settings. One such approach is described here in detail, while two others are briefly sketched. In particular, arguments behind the Born rule, which gives the basis for quantum probabilities, are given. A list of ideas for possible statistical applications of quantum probabilities is provided and discussed. A particular area is machine learning, where there exists substantial literature on links to quantum probability. Here, an idea about model reduction is sketched and is motivated from a quantum probability model. Quantum models can play a role in model reduction, where the partial least squares regression model is a special case. It is shown that for certain experiments, a Bayesian prior given by a quantum probability can be motivated. Quantum decision theory is an emerging discipline that can be motivated by this author’s theory of quantum foundations.
The generalised quantum Stein's lemma is a key result in quantum hypothesis testing, and connects this fundamental primitive of quantum information processing with quantum resource manipulation, a task that is central for technological applications. Prior works have proved this statement in the idealised setting of independent and identically distributed (i.i.d.) sequences of quantum states, and recent extensions consider also sources that are 'close' to i.i.d., according to the strict notion put forth by Mazzola, Sutter, and Renner. For several applications, however, one would need to consider yet more general sources. We establish a version of the generalised quantum Stein's lemma that is conceptually much simpler and general, as it applies to any source that is asymptotically close to an i.i.d. state with respect to the normalised quantum Wasserstein distance of order 1. As an immediate consequence, we solve the Stein exponent of a scenario where the null hypothesis is arbitrarily varying, expressing it in terms of i.i.d. Stein exponents corresponding to arbitrary states in the convex hull of the null hypothesis base set.
It is argued from several points of view that quantum probabilities might play a role in statistical settings. New approaches toward quantum foundations have postulates that appear to be equally valid in macroscopic settings. One such approach is described here in detail, while one other is briefly sketched. In particular, arguments behind the Born rule, which gives the basis for quantum probabilities, are given. A list of ideas for possible statistical applications of quantum probabilities is provided and discussed. A particular area is machine learning, where there exists substantial literature on links to quantum probability. Here, an idea about model reduction is sketched and is motivated from a quantum probability model. Quantum models can play a role in model reduction, where the partial least squares regression model is a special case. It is shown that for certain experiments, a Bayesian prior given by a quantum probability can be motivated. Quantum decision theory is an emerging discipline that can be motivated by this author's theory of quantum foundations.