One of the differences between classical and quantum world is that in the former we can always perform a measurement that gives certain outcomes for all pure states, while such a situation is not possible in the latter one. The degree of randomness of the distribution of the measurement outcomes can be quantified by the Shannon entropy. While it is well known that this entropy, as a function of quantum states, needs to be minimized by some pure states, we would like to address the question how ‘badly’ can we end by choosing initially any pure state, i.e., which pure states produce the maximal amount of uncertainty under given measurement. We find these maximizers for all highly symmetric POVMs in dimension 2, and for all SIC-POVMs in any dimension.
We discuss the dependence of the Shannon entropy of normalized finite rank-1 POVMs on the choice of the input state, looking for the states that minimize this quantity. To distinguish the class of measurements where the problem can be solved analytically, we introduce the notion of highly symmetric POVMs and classify them in dimension 2 (for qubits). In this case, we prove that the entropy is minimal, and hence, the relative entropy (informational power) is maximal, if and only if the input state is orthogonal to one of the states constituting a POVM. The method used in the proof, employing the Michel theory of critical points for group action, the Hermite interpolation, and the structure of invariant polynomials for unitary–antiunitary groups, can also be applied in higher dimensions and for other entropy-like functions. The links between entropy minimization and entropic uncertainty relations, the Wehrl entropy, and the quantum dynamical entropy are described.
This paper is an announcement of our result and the detailed version will be submitted to somewhere.(See [2].)POVMs (positive operator valued measure) on quantum systems are considered as a measurement in quantum physics.If POVMs have a good condition, then we can determine a state by results of a measurement.In this case, the POVM is called informationally complete and the process is called quantum state tomography.First, we introduce SIC-POVMs (symmetric informationally complete POVM).SIC-POVMs is generated by vectors in
Cn whose the absolute values of inner products of each vectors are same.Zauner conjectured that there exist such
n2 vectors in
Cn for any
n .But the existence is only proved when
n≤15 and
n=19 , 24, 35,48[5, 8].Next, we introduce conditional SIC-POVMs.A state of a quantum system is a density matrix which has several parameters.When a few parameters are known, then SIC-POVM is not the best measurement to determine the state.Hence we need another POVM and it is a conditional SIC-POVM.Conditional SIC-POVMs are also generated by vectors in
Cn .But the existence of conditional SIC-POVMs depends on the system.We will discuss the details in Sect. 4. 2 Preliminaries Definition 2.1
ρ∈Mn(C) is called a density matrix (or state) if
ρ≥0 and
′b(ρ)=1.For any density matrix
ρ , we can define a state
ρ^ by
ρ^(X)=h(ρX) .Conversely, any state is written by the above form.Therefore, there exists a one-t
(≻ one correspondence between density matrices and states.Definition 2.2 A set of positive operators
{Pi}i=1k⊂Mn(C) is called a positive operator valued measure (POVM) if
Pi≥0(1≤i≤k) and
∑i=1kP=I.If
P1 is a projection, then
{Pi}i=1k is called a projection valued measure
(PVM) .
The unpredictability of quantum physics gives rise to intrinsic randomness. In an adversarial scenario, any additional degrees of freedom must be attributed to an eavesdropper with correlations to the measurement set-up. The true randomness is then quantified by the probability that she correctly guesses the measurement outcomes, optimised over all possible strategies. Extremal measurements are appealing here, since they do not allow information to leak to such an eavesdropper. Beyond projective measurements, however, a simple question remains open: how much intrinsic randomness can be generated by a given extremal measurement? In a step towards solving it, we characterise the randomness generated by any unbiased extremal rank-one measurement acting on any state, solving the problem explicitly in dimension two. Four-outcome qubit measurements of this type are tomographic, so these results hold for fully source-device-dependent randomness too. The tetrahedral symmetric informationally complete (SIC) measurement, we find, has the least intrinsic randomness within this class. We also present the skewed SIC family of measurements, and use them to partially solve an open problem: we prove that
2logd bits of randomness, the maximal amount, can be generated device-dependently (or source-device-independently) in any dimension in which there exists a SIC measurement.
Similarly to quantum states, also quantum measurements can be 'mixed', corresponding to a random choice within an ensemble of measuring apparatuses. Such mixing is equivalent to a sort of hidden variable, which produces a noise of purely classical nature. It is then natural to ask which apparatuses are indecomposable , i.e. do not correspond to any random choice of apparatuses. This problem is interesting not only for foundations, but also for applications, since most optimization strategies give optimal apparatuses that are indecomposable. Mathematically the problem is posed describing each measuring apparatus by a positive operator-valued measure (POVM), which gives the statistics of the outcomes for any input state. The POVMs form a convex set, and in this language the indecomposable apparatuses are represented by extremal points—the analogous of 'pure states' in the convex set of states. Differently from the case of states, however, indecomposable POVMs are not necessarily rank-one, e.g. von Neumann measurements. In this paper we give a complete classification of indecomposable apparatuses (for discrete spectrum), by providing different necessary and sufficient conditions for extremality of POVMs, along with a simple general algorithm for the decomposition of a POVM into extremals. As an interesting application, 'informationally complete' measurements are analysed in this respect. The convex set of POVMs is fully characterized by determining its border in terms of simple algebraic properties of the corresponding POVMs.
Quantum physics exhibits an intrinsic and private form of randomness with no classical counterpart. Any setup for quantum randomness generation involves measurements acting on quantum states. In this work, we consider the following question: Given a quantum measurement, how much randomness can be generated from it? In real life, measurements are noisy and thus contain an additional, extrinsic form of randomness due to ignorance. This extrinsic randomness is not private since, in an adversarial model, it takes the form of quantum side information held by an eavesdropper who can use it to predict the measurement outcomes. Randomness of measurements is then quantified by the guessing probability of this eavesdropper, when minimized over all possible input states. This optimization is in general hard to compute, but we solve it here for any two-outcome qubit measurement and for projective measurements in arbitrary dimension mixed with white noise. We also construct, for a given measured probability distribution, different realizations with (i) a noisy state and noiseless measurement (ii) a noiseless state and noisy measurement and (iii) a noisy state and measurement, and we show that the latter gives an eavesdropper significantly higher guessing power.