Implementation of POVMs by Projective Measurements and Postselection: Optimal Strategies and Applications to Unambiguous State Discrimination

: We present new results concerning simulation of general quantum measurements (POVMs) by projective measurements (PMs) for the task of Unambiguous State Discrimination (USD). We formulate a problem of ﬁnding optimal strategy of simulation for given quantum measurement. The problem can be solved for qubit and qutrits measurements by Semi-Deﬁnite Programming (SDP) methods.


Introduction and preliminaries
In the recent work [1] it was proved that arbitrary quantum measurement (POVM) can be simulated by projective measurements if one allows for standard classical operations (randomization and post-processing), followed by postselection. The concrete algorithm of simulation was presented, with probability of success equal to the 1 d for d-dimensional quantum system. It has been studied what advantage POVMs offer over PMs for the task of Unambiguous State Discrimination (USD).
In this work we present new result concerning the applications of general scheme of simulation for the task of USD. First, we show what is the best possible projective-simulable measurement for USD without postselection. Then we present the strategy of simulation which in the task of USD performs better than 1 d bound from [1]. Finally, we formulate a problem of finding optimal strategy of simulation with postselection for a given quantum measurement. The problem can be numerically solved for qubit and qutrit measurements via SDP techniques. We provide exemplary solutions for two extremal qubit POVMs.
We will now introduce necessary mathematical concepts. Every quantum measurement can be associated with a vector M of positive-semidefinite operators that sum up to identity. Such a vector is called POVM (Positive-Operator Valued Measure), and the constituting operators, denoted by M i , are called effects. To avoid confusion, we stress that we use boldface font to denote the whole POVM M (P for projective) and standard italic font for particular effects of M, i.e., M i . In the discussion in Section 2 we use upper indices P (α) to denote different measurements, not effects. If a measurement is performed on the quantum system in state ρ, the probability of obtaining outcome labeled by i is given by Born's rule-p (i|M, ρ) = tr (M i ρ).
In [2] the notion of simulability of POVMs by PMs was introduced-the POVM M is said to be PM-simulable if sampling from statistics that it would generate for arbitrary quantum state can be achieved by classical randomization of some projective measurements P (α) (not necessarily on the same space as M), followed by classical post-processing. We will denote set of n-outcome PM-simulable measurements on space of dimension d as SP (n, d). In recent work [1] the notion of PM-simulability was extended by the simulation of the POVM using projective measurements and postselection. To simulate n-outcome POVM M = (M 1 , M 2 , . . . , M n ) with postselection, one needs to find q ∈ (0, 1], such that for (n + 1)-outcome POVM defined asM(q) = (qM 1 , qM 2 , . . . , qM n , I (1 − q)), we haveM(q) ∈ SP (n + 1, d). Furthermore, q can be interpreted as a success probability of simulation. In [1] a simulation scheme attaining q = 1 d was proposed and proved to be optimal. We note that a related protocol appeared in [3].
In the task of USD, one is asked to unambiguously distinguish between quantum states ρ i generated from the ensemble If quantum states are measured by POVM M, probability of success in this task is given by The requirement of unambiguity means that tr M i ρ j = 0 if i = j. Furthermore, we identify additional, M n+1 effect with "inconclusive answer". In what follows, we will consider the general case of ensemble consisting of non-commuting, pure states, i.e., ρ i = |ψ i ψ i | and ψ i |ψ j = 0.

The Best PM-Simulable POVM for USD
It may be interesting to pose a question which particular projective-simulable measurement gives the highest probability of success in the task of USD. According to the definition, the PM-simulable POVM can be written as a convex combination of projective measurements M SP USD = ∑ α λ α P (α) with λ ∈ [0, 1] and ∑ α λ α = 1. For projective measurement P (α) = P (α) n+1 , the effects fulfill the idempotency and orthogonality conditions P First, let us note that the unambiguity condition tr P (α) i ρ j = 0 for i = j forces a very special structure on every P (α) . Namely, at least one effect of each of the P (α) must be the projection on the orthogonal complement of the subspace spanned by all except one of the states from the ensemble, i.e., P The excluded one labeled by k is identified unambiguously if the result of the measurement P α is k. In this case only single quantum state can be discriminated unambiguously by a particular projective measurement, while all the other states will yield the "inconclusive" result. Such a measurement has a structure , where without loss of generality (indeed, the number of projective measurements for optimal simulation of the POVM for USD task, due to their structure, is at most n-every additional effect would correspond only to the "inconclusive" result.) we have identified k = α (see [1] for detailed proofs of the above statements).
The success probability in this case is equal to p succ E , M SP α ρ α . Since this is a strictly convex function on a set of P (α) it follows that it attains maximum at one of the extremal points, i.e., particular P (α) . Finally, the optimal probability of success for PM-simulable POVM in the USD task is given by

Better Strategy of Simulation for USD
In [1] the application of simulation with postselection for the task of USD was analysed. The authors focused on deriving bounds for probability of success, while simulating a POVM optimal for this problem. The simulation scheme requires performing randomized projective measurements proportional to effects of POVM. However, including in simulation protocol application of a projective measurement corresponding to "inconclusive" answer seems to be not particularly practical idea-at the end it is anyway glued with the last, additional effect M n+1 . Therefore, from experimental point of view, it may be more reasonable to simulate another measurement, consisting only of rescaled effects corresponding to "conclusive" answers. Here we derive such a strategy.
Let us denote by M ? = M n+1 an effect corresponding to inconclusive answer and define tr (M ? ) = χ ? . Since any POVM for the USD task, due to the very unambiguity condition, consists of n rescaled projectors on some subspaces, each of the first n effects can be written in the form M i = α i |φ i φ i | (see [1] for details). Furthermore, we have ∑ n , form a probability distribution.

Optimal Strategy for Simulation with Postselection for a Given Measurement
The procedure of simulation with postselection requires construction from n-outcome POVM M, an (n + 1)-outcome POVMM (q) ∈ SP (n + 1, d). If we formally add the (n + 1)th 'null' effect to the M, meaning that M = (M 1 , M 2 , . . . , M n , 0), we can interpret a simulation protocol as introducing a noise channel parameterized by q. Namely, Φ SP q (M) =M (q) = (qM 1 , qM 2 , . . . , qM n , I (1 − q)). Such a frame makes the problem similar to the one introduced in [2], where the noise affecting measurement was depolarizing Φ dep t (M) = tM + (1 − t) tr(M) d I with t being a so called "visibility". The authors were interested in finding maximum t, for which given measurement M affected by depolarizing noise channel is projective-simulable without postselection. We will denote such a "critical visiblity" by t * (M) = max t|Φ dep t (M) ∈ SP (n, d) . Inspired by this, we can formulate a new problem of finding maximal q, such thatM (q) = Φ q (M) is projective-simulable with postselection. Namely, we introduce Since q is a success probability of simulation, the q * is associated with POVMM (q * ) for which this probability is greatest-therefore with the optimal simulation strategy for a given measurement M. In [2], the criteria of PM-simulability for qubit and qutrit measurements were formulated as semi-definite programming (SDP) problems. Therefore (3) can be solved by standard convex programming solvers and with this work we provide a proper code in Python for qubit measurements [4].
We will now give some exemplary solutions of (3). From the existence of critical visibility t * , it follows that if a POVM is not PM-simulable, its depolarized version with t ∈ [1, t * [ is also not PM-simulable. Therefore, by changing parameter t through that interval, we can generate a family of non-PM-simulable measurements with varying non-projective "character". In order to get some intuition, we calculate values of such a function q * (M, t) = q * Φ dep t (M) for some particularly interesting qubit POVMs, namely 3-outcome 'trine' and 4-outcome 'tetrahedral' measurements (names come from the fact that Bloch vertices associated with their effects form an equilateral triangle and a tetrahedron, respectively). Both measurements are extremal and symmetric, while tetrahedral is also informationally complete. Figure 1 presents of such plots for 100 different t ∈ [1, t * ]. For clarity, 1 − t is plotted. Note that for t = 1 (non-depolarized extremal qubit POVM), the optimal success probability is equal to q = 1 2 = 1 d . Figure 1. Plot of optimal "SP-noise" parameter q * (M, t) vs (1 − t) for depolarized versions of two extremal qubit measurements: trine (left) and tetrahedral (right).

Discussion
We have presented new results concerning strategies for optimal simulation of POVMs by projective measurements for their applications to the task of USD. We have also formulated a task of finding the best strategy of simulation with postselection for a given measurement. Such strategies can be found numerically for qubit and qutrit measurements via SDP methods. Finally, we have provided examples of such strategies for two chosen qubit measurements.