In the simple quantum hypothesis testing problem, upper bounds on the error probabilities are shown based on a key operator inequality between a density operator and its pinching. Concerning the error exponents, the upper bounds lead to a noncommutative analogue of the Hoeffding bound, which is identical with the classical counter part if the hypotheses, composed of two density operators, are mutually commutative. The upper bounds also provide a simple proof of the direct part of the quantum Stein's lemma.
Recently, it is well recognized that hypothesis testing has deep relations with other topics in quantum information theory as well as in classical information theory. These relations enable us to derive precise evaluation in the finite-length setting. However, such usefulness of hypothesis testing is not limited to information theoretical topics. For example, it can be used for verification of entangled state and quantum computer as well as guaranteeing the security of keys generated via quantum key distribution. In this talk, we overview these kinds of applications of hypothesis testing.
This paper has been withdrawn by the author. Lemma 8 is used in the proof of Lemma 6, but it is not correct. Lemma 6 is essential for the main results.
A new proof of the direct part of the quantum channel coding theorem is shown based on a standpoint of quantum hypothesis testing. A packing procedure of mutually noncommutative operators is carried out to derive an upper bound on the error probability, which is similar to Feinstein's lemma in classical channel coding. The upper bound is used to show the proof of the direct part along with a variant of Hiai-Petz's theorem in quantum hypothesis testing.
The hypothesis testing problem of two quantum states is treated. We show a new inequality between the error of the first kind and the second kind, which complements the result of Hiai and Petz to establish the quantum version of Stein's lemma. The inequality is also used to show a bound on the first kind error when the power exponent for the second kind error exceeds the quantum relative entropy, and the bound yields the strong converse in the quantum hypothesis testing. Finally, we discuss the relation between the bound and the power exponent derived by Han and Kobayashi in the classical hypo…
The information-spectrum analysis made by Han for classical hypothesis testing for simple hypotheses is extended to a unifying framework including both classical and quantum hypothesis testing as well as fixed-length source coding, whereby general formulas for several quantities concerning the asymptotic optimality of tests/codes are established in terms of classical and quantum information spectrum. Generality of theorems and simplicity of proofs are fully pursued, and as byproducts some improvements on the original classical results are also obtained.
We study various error exponents in a binary hypothesis testing problem and extend recent results on the quantum Chernoff and Hoeffding bounds for product states to a setting when both the null-hypothesis and the counter-hypothesis can be correlated states on a spin chain. Our results apply to states satisfying a certain factorization property; typical examples are the global Gibbs states of translation-invariant finite-range interactions as well as certain finitely correlated states.
We discuss the implications of quantum-classical Yule-Simpson effect for quantum hypothesis testing in the presence of noise, and provide an experimental demonstration of its occurrence in the problem of discriminating which polarization quantum measurement has been actually performed by a detector box designed to measure linear polarization of single-photon states along a fixed but unknown direction.
Alternative exact expressions are derived for the minimum error probability of a hypothesis test discriminating among $M$ quantum states. The first expression corresponds to the error probability of a binary hypothesis test with certain parameters; the second involves the optimization of a given information-spectrum measure. Particularized in the classical-quantum channel coding setting, this characterization implies the tightness of two existing converse bounds; one derived by Matthews and Wehner using hypothesis-testing, and one obtained by Hayashi and Nagaoka via an information-spectrum app…
In the asymptotic setting, the optimal test for hypotheses testing of the maximally entangled state is derived under several locality conditions for measurements. The optimal test is obtained in several cases with the asymptotic framework as well as the finite-sample framework. In addition, the experimental scheme for the optimal test is presented.
The direct part of Stein's lemma in quantum hypothesis testing is revisited based on a key operator inequality between a density operator and its pinching. The operator inequality is used to show a simple proof of the direct part of Stein's lemma without using Hiai-Petz's theorem, along with an operator monotone function, and in addition it is also used to show a new proof of Hiai-Petz's theorem.
This expository article gives an overview of the theory of hypothesis testing of quantum states in finite dimensional Hilbert spaces. Optimal measurement strategy for testing binary quantum hypotheses, which result in minimum error probability, is discussed. Collective and individual adaptive measurement strategies in testing hypotheses in the multiple copy scenario, with various upper and lower bounds on error probability, are outlined. A brief account on quantum channel discrimination and the role of entangled states in achieving enhanced precision in the task of channel discrimination is gi…
We investigate the weak measurement experiment demonstrated by Ritchie et al. [N. W. M. Ritchie, J. G. Story, and R. G. Hulet, Phys. Rev. Lett. 66, 1107 (1991)] from the viewpoint of the statistical hypothesis testing for the weak-value amplification proposed by Susa and Tanaka [Y. Susa and S. Tanaka, Phys. Rev. A 92, 012112 (2015)]. We conclude that the weak-value amplification is a better method to determine whether the crystal used in the experiment is birefringent than the measurement without postselection, when the angles of two polarizers are almost orthogonal. This result gives a physic…
Using a quantum circuit model we derive the maximal ability to distinguish which of several candidate Hamiltonians describe an open quantum system. This theory, in particular, provides the maximum information retrievable from continuous quantum measurement records, available when a quantum system is perturbatively coupled to a broadband quantized environment.
We study the detection capability of the weak-value amplification on the basis of the statistical hypothesis testing. We propose a reasonable testing method in the physical and statistical senses to find that the weak measurement with the large weak value has the advantage to increase the detection power and to reduce the possibility of missing the presence of interaction. We enhance the physical understanding of the weak value and mathematically establish the significance of the weak-value amplification. Our present work overcomes the critical dilemma of the weak-value amplification that the …
The problem of discriminating between many quantum channels with certainty is analyzed under the assumption of prior knowledge of algebraic relations among possible channels. It is shown, by explicit construction of a novel family of quantum algorithms, that when the set of possible channels faithfully represents a finite subgroup of SU(2) (e.g., $C_n, D_{2n}, A_4, S_4, A_5$) the recently-developed techniques of quantum signal processing can be modified to constitute subroutines for quantum hypothesis testing. These algorithms, for group quantum hypothesis testing (G-QHT), intuitively encode d…
We study how well answer to the question ``Is the given quantum state equal to a certain maximally entangled state?'' using LOCC, in the context of hypothesis testing. Under several locality and invariance conditions, optimal tests will be derived for several special cases by using basic theory of group representations. Some optimal tests are realized by performing quantum teleportation and checking whether the state is teleported. We will also give a finite process for realizing some optimal tests. The performance of the tests will be numerically compared.
In this paper, we treat a local discrimination problem in the framework of asymmetric hypothesis testing. We choose a known bipartite pure state $\ketΨ$ as an alternative hypothesis, and the completely mixed state as a null hypothesis. As a result, we analytically derive an optimal type 2 error and an optimal POVM for one-way LOCC POVM and Separable POVM. For two-way LOCC POVM, we study a family of simple three-step LOCC protocols, and show that the best protocol in this family has strictly better performance than any one-way LOCC protocol in all the cases where there may exist difference betw…
Quantum Hypothesis Testing has shown the advantages that quantum resources can offer in the discrimination of competing hypothesis. Here, we apply this framework to optomechanical systems and fundamental physics questions. In particular, we focus on an optomechanical system composed of two cavities employed to perform quantum channel discrimination. We show that input squeezed optical noise, and feasible measurement schemes on the output cavity modes, allow to obtain an advantage with respect to any comparable classical schemes. We apply these results to the discrimination of models of spontan…
The one-shot classical capacity of a quantum channel quantifies the amount of classical information that can be transmitted through a single use of the channel such that the error probability is below a certain threshold. In this work, we show that this capacity is well approximated by a relative-entropy-type measure defined via hypothesis testing. Combined with a quantum version of Stein's lemma, our results give a conceptually simple proof of the well-known Holevo-Schumacher-Westmoreland theorem for the capacity of memoryless channels. More generally, we obtain tight capacity formulas for ar…
In the simple quantum hypothesis testing problem, upper bound with asymmetric setting is shown by using a quite useful inequality by Audenaert et al, quant-ph/0610027, which was originally invented for symmetric setting. Using this upper bound, we obtain the Hoeffding bound, which are identical with the classical counter part if the hypotheses, composed of two density operators, are mutually commutative. Our upper bound improves the bound by Ogawa-Hayashi, and also provides a simpler proof of the direct part of the quantum Stein's lemma. Further, using this bound, we obtain a better exponentia…
We treat quantum counterparts of testing problems whose optimal tests are given by chi-square, t and F tests. These quantum counterparts are formulated as quantum hypothesis testing problems concerning quantum Gaussian states families, and contain disturbance parameters, which have group symmetry. Quantum Hunt-Stein Theorem removes a part of these disturbance parameters, but other types of difficulty still remain. In order to remove them, combining quantum Hunt-Stein theorem and other reduction methods, we establish a general reduction theorem that reduces a complicated quantum hypothesis test…
We extend the mathematical theory of quantum hypothesis testing to the general $W^*$-algebraic setting and explore its relation with recent developments in non-equilibrium quantum statistical mechanics. In particular, we relate the large deviation principle for the full counting statistics of entropy flow to quantum hypothesis testing of the arrow of time.
Receiver operating characteristics (ROCs) are a well-established representation of the tradeoff between detection and false alarm probabilities in classical binary hypothesis testing. We use classical ROCs as motivation for two types of operating characteristics for binary hypothesis testing in quantum systems -- decision operating characteristics (QDOCs) and measurement operating characteristics (QMOCs). Both are described in the context of a framework we propose that encompasses the typical formulations of binary hypothesis testing in both the classical and quantum scenarios. We interpret He…
We consider the asymmetric formulation of quantum hypothesis testing, where two quantum hypotheses have different associated costs. In this problem, the aim is to minimize the probability of false negatives and the optimal performance is provided by the quantum Hoeffding bound. After a brief review of these notions, we show how this bound can be simplified for pure states. We then provide a general recipe for its computation in the case of multimode Gaussian states, also showing its connection with other easier-to-compute lower bounds. In particular, we provide analytical formulas and numerica…
The task of binary quantum hypothesis testing is to determine the state of a quantum system via measurements on it, given the side information that it is in one of two possible states, say $ρ$ and $σ$. This task is generally studied in either the symmetric setting, in which the two possible errors incurred in the task (the so-called type I and type II errors) are treated on an equal footing, or the asymmetric setting in which one minimizes the type II error probability under the constraint that the corresponding type I error probability is below a given threshold. Here we define a one-paramete…
Due to the difficulties of implementing joint measurements, quantum illumination schemes that are based on signal-idler entanglement are difficult to implement in practice. For this reason, one may consider quantum-inspired designs of quantum lidar/radar where the input sources are semiclassical (coherent states) while retaining the quantum aspects of the detection. The performance of these designs could be studied in the context of asymmetric hypothesis testing by resorting to the quantum Stein's lemma. However, here we discuss that, for typical finite-size regimes, the second- and third-orde…
The asymptotic state discrimination problem with simple hypotheses is considered for a cubic lattice of bosons. A complete solution is provided for the problems of the Chernoff and the Hoeffding bounds and Stein's lemma in the case when both hypotheses are gauge-invariant Gaussian states with translation-invariant quasi-free parts.
A novel definition for data privacy in quantum computing based on quantum hypothesis testing is presented in this paper. The parameters in this privacy notion possess an operational interpretation based on the success/failure of an omnipotent adversary being able to distinguish the private categories to which the data belongs using arbitrary measurements on quantum states. Important properties of post processing and composition are then proved for the new notion of privacy. The relationship between privacy against hypothesis-testing adversaries, defined in this paper, and quantum differential …
The paper estimates the Chernoff rate for the efficiency of quantum hypothesis testing. For both joint and separable measurements, approximate bounds for the rate are given if both states are mixed and exact expressions are derived if at least one of the states is pure. The efficiency of tests with separable measurements is found to be close to the efficiency of tests with joint measurements. The results are illustrated by a test of quantum entanglement.
The eigenstate decoherence hypothesis (EDH) asserts that each individual eigenstate of a large closed system is locally classical-like. We test this hypothesis for a heavy particle interacting with a gas of light particles. This system is paradigmatic for studies of the quantum-to-classical transition: The reduced state of the heavy particle is widely believed to rapidly loose any nonclassical features due to the interaction with the gas. Yet, we find numerical evidence that the EDH is violated: certain eigenstates of this model are manifestly non-classical. Only the weak version of EDH referr…
We revisit the problem of asymmetric binary hypothesis testing against a composite alternative hypothesis. We introduce a general framework to treat such problems when the alternative hypothesis adheres to certain axioms. In this case we find the threshold rate, the optimal error and strong converse exponents (at large deviations from the threshold) and the second order asymptotics (at small deviations from the threshold). We apply our results to find operational interpretations of various Renyi information measures. In case the alternative hypothesis is comprised of bipartite product distribu…
