Plausibility measures are structures for reasoning in the face of uncertainty that generalize probabilities, unifying them with weaker structures like possibility measures and comparative probability relations. So far, the theory of plausibility measures has only been developed for classical sample spaces. In this paper, we generalize the theory to test spaces, so that they can be applied to general operational theories, and to quantum theory in particular. Our main results are two theorems on when a plausibility measure agrees with a probability measure, i.e. when its comparative relations coincide with those of a probability measure. For strictly finite test spaces we obtain a precise analogue of the classical result that the Archimedean condition is necessary and sufficient for agreement between a plausibility and a probability measure. In the locally finite case, we prove a slightly weaker result that the Archimedean condition implies almost agreement.
On the quantum side, Foulis, Randall and Piron investigated the notion of on test spaces @cite_28 , which in our terminology are just possibility measures on test spaces. A plausibility measure on a test space is a generalization of this, and can be viewed as a way of unifying it with the usual notion of a probability measure, or state, on a test space.
@cite_28
2029587304 2083026109 1988174048 2091240287
There are fundamental limits to the accuracy with which one can determine the state of a quantum system. I give an overview of the main approaches to quantum state discrimination. Several strategies exist. In quantum hypothesis testing, a quantum system is prepared in a member of a known, finite set of states, and the aim is to guess which one with the minimum probability of error. Error free discrimination is also sometimes possible, if we allow for the possibility of obtaining inconclusive results. If no prior information about the state is provided, then it is impractical to try to determine it exactly, and it must be estimated instead. In addition to reviewing these various strategies, I describe connections between state discrimination, the manipulation of quantum entanglement and quantum cloning. Recent experimental work is also discussed. Abstract It is a central point in the quantum theory of measurement that it is impossible to discriminate perfectly between two non-orthogonal quantum states if only one physical system is considered. Standard arguments give | p | q > | 2 as the essential quantity that limits the effectiveness of discrimination between | p > and | q >. It is here shown, however, that not | p | q > | 2 but rather | p | q > | plays the role of determining the measure of distinguishability of | p > and | q > if a classification with certainty is required. The most efficient way of obtaining information about the state of a quantum system is not always a direct measurement. It is sometimes preferable to extend the original Hilbert space of states into a larger space, and then to perform a quantum measurement in the enlarged space. Such an extension is always possible, by virtue of Neumark's theorem. The physical interpretation usually given to that theorem is the introduction of an auxiliary quantum system, prepared in a standard state, and the execution of a quantum measurement on both systems together. However, this widespread interpretation is unacceptable, because the statistical properties of the supposedly standard auxiliary system are inseparably entangled with those of the original, unknown system. A different method of preparing the auxiliary system is proposed, and shown to be physically acceptable. In the asymptotic theory of quantum hypothesis testing, the minimal error probability of the first kind jumps sharply from zero to one when the error exponent of the second kind passes by the point of the relative entropy of the two states in an increasing way. This is well known as the direct part and strong converse of quantum Stein's lemma. Here we look into the behavior of this sudden change and have make it clear how the error of first kind grows smoothly according to a lower order of the error exponent of the second kind, and hence we obtain the second-order asymptotics for quantum hypothesis testing. This actually implies quantum Stein's lemma as a special case. Meanwhile, our analysis also yields tight bounds for the case of finite sample size. These results have potential applications in quantum information theory. Our method is elementary, based on basic linear algebra and probability theory. It deals with the achievability part and the optimality part in a unified fashion.