Optimal sequential measurements for bi-partite state discrimination
Sarah Croke, Stephen M. Barnett, Graeme Weir

TL;DR
This paper investigates when sequential measurements on bipartite quantum systems can match the performance of optimal joint measurements in state discrimination, providing conditions and comparisons to understand their effectiveness.
Contribution
It derives conditions for optimal sequential measurements in bipartite state discrimination, analogous to Helstrom conditions, and compares their performance to joint measurements.
Findings
Sequential measurements can sometimes match joint measurement performance.
Derived conditions for optimal sequential measurements.
Compared success probabilities of global vs. sequential strategies.
Abstract
State discrimination is a useful test problem with which to clarify the power and limitations of different classes of measurement. We consider the problem of discriminating between given states of a bi-partite quantum system via sequential measurement of the subsystems, with classical feed-forward of measurement results. Our aim is to understand when sequential measurements, which are relatively easy to implement experimentally, perform as well, or almost as well as optimal joint measurements, which are in general more technologically challenging. We construct conditions that the optimal sequential measurement must satisfy, analogous to the well-known Helstrom conditions for minimum error discrimination in the unrestricted case. We give several examples and compare the optimal probability of correctly identifying the state via global versus sequential measurement strategies.
Click any figure to enlarge with its caption.
Figure 1
Figure 1
Figure 2Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Optimal sequential measurements for bi-partite state discrimination
Sarah Croke
Stephen M. Barnett
Graeme Weir
School of Physics and Astronomy, University of Glasgow, Glasgow G12 8QQ, UK
Abstract
State discrimination is a useful test problem with which to clarify the power and limitations of different classes of measurement. We consider the problem of discriminating between given states of a bi-partite quantum system via sequential measurement of the subsystems, with classical feed-forward of measurement results. Our aim is to understand when sequential measurements, which are relatively easy to implement experimentally, perform as well, or almost as well as optimal joint measurements, which are in general more technologically challenging. We construct conditions that the optimal sequential measurement must satisfy, analogous to the well-known Helstrom conditions for minimum error discrimination in the unrestricted case. We give several examples and compare the optimal probability of correctly identifying the state via global versus sequential measurement strategies.
I Introduction
The problem of quantum state discrimination is most naturally thought of as a task in quantum communications, although it also has applications elsewhere in quantum information theory and quantum metrology Barnett09review ; Bae15review ; Chefles00review ; Bergou10review ; SteveBook . The communications scenario is as follows: a sender, traditionally called Alice, chooses a quantum state drawn from a given set with associated a priori probabilities , and sends a system prepared in this state to a receiver, Bob. Bob knows the allowed set of states and their associated probabilities, and his task is to determine which state was sent, thereby recovering the message sent by Alice. The task was first considered in the pioneering work of Helstrom, Holevo, and others in the late 60s and 70s Helstrom67 ; Helstrom68 ; Holevo73 ; Yuen75 ; Davies78 ; Helstrom76 ; Holevo82 . Various strategies exist, each optimising a different figure of merit (see e.g. Davies78 ; Levitin95 ; Sasaki99 ; Ivanovic87 ; Dieks88 ; Peres88 ; Jaeger95 ; Chefles98 ; MaxConf ), and for arguably the simplest such figure, minimising the probability of error in identifying the state, necessary and sufficient conditions for a quantum measurement strategy to be optimal are known Holevo73 ; Yuen75 .
More recently, state discrimination has proved a useful test problem with which to clarify the power and limitations of different classes of measurement. For information encoded across multiple quantum systems, the ability to measure jointly is strictly more powerful (but in general technologically more challenging) than the ability to measure each subsystem independently, even if many rounds of classical communication between systems are allowed. Intuitively, one might expect the difference in performance to be more pronounced when information is encoded in entangled states. That this is not necessarily the case was first revealed through two state discrimination problems. The first, so-called “non-locality without entanglement”, gave a set of multi-partite orthogonal product states between which perfect discrimination is not possible using only local measurements and classical communication Bennett99 . The second, complementary and no less surprising, showed that any two orthogonal pure states, regardless of entanglement or multi-partite structure, may be perfectly discriminated using only sequential measurement, i.e. local measurement on each system, with classical feed-forward Walgate00 . This was later extended to show that any two in general non-orthogonal pure states may be discriminated optimally by sequential measurement of the subsystems, according to the commonly used minimum error Virmani01 and unambiguous discrimination strategies Chen01 ; Chen02 ; Ji05 .
Beyond the two state examples, the situation becomes much less clear: for the next simplest example of discriminating three possible qubit states given two copies, it was postulated by Peres and Wootters in 1991 that local measurement was strictly weaker than joint measurement on both copies Peres91 , and only twenty years later was it finally proved that such a gap exists for this problem, for the minimum error strategy Chitambar13 .
In this paper we consider sequential measurements on a bi-partite system; i.e. subsystem A and B are measured in turn, and the choice of measurement performed on subsystem B is allowed to depend in general on the result of measurement of A. This is often a physically relevant class of measurement; for example if A and B are in different labs it is easy to imagine that feedforward of measurement results from lab A to lab B would be practical but many rounds of classical communication could become unfeasible. Alternatively if A and B interact only weakly or not at all (e.g. photons), joint measurements are difficult to perform, while classical feed-forward from one detector to another apparatus is relatively easily achieved with current technology (see e.g. Lu10 for such an experiment in the state discrimination context). It is natural then to ask how well information can be retrieved with this restriction on the measurement strategy that may be employed. Further, implementations of joint measurement strategies for extracting information may provide applications for small quantum processors BlumeKohout13 , and it is useful to understand when the additional experimental challenge of joint measurement may provide a significant advantage over local measurement strategies. For simplicity, we restrict to bipartite instead of the more general multipartite state discrimination.
We begin with the case where the bipartite state is simply a two-copy state. We construct necessary conditions that a given sequential measurement must satisfy to be optimal in the sense of minimising the error in determining the state, analogous to the well-known Helstrom conditions Holevo73 ; Yuen75 . We further find a condition which is both necessary and sufficient, but which requires optimisation over an arbitrary measurement on one subsystem. We illustrate the two-copy case through the example of the trine states considered in Peres91 ; Chitambar13 , and give the probabilities of correctly identifying the state for sequential and global strategies, as well as discussing features of the optimal measurements in each case.
We extend the discussion to arbitrary bi-partite states, and as an example give the optimal sequential strategies for discriminating three Bell states, and for discriminating the so-called domino states introduced by Bennett et al. in Bennett99 . Finally we discuss an interpretation for our necessary and sufficient condition in terms of a related discrimination problem.
II Review: Helstrom conditions
We first recall the minimum error problem, where there are no restrictions on the allowed measurement: a quantum system is prepared in one of a known set of states with associated probabilities . Any physically allowed measurement may be represented by a POVM (positive operator-valued measure) Peres95 , also referred to as a POM (probability operator measure) Helstrom76 , that is, a set of Hermitian operators satisfying:
[TABLE]
For a measurement described by operators , if outcome is taken to indicate state , the probability of correctly identifying the state is given by:
[TABLE]
The operators describing the optimal measurement satisfy the following conditions SteveBook ; Holevo73 ; Yuen75 ; Barnett09 :
[TABLE]
It is worth noting that the conditions are not independent, as the second follows from the first. Condition (3) may be thought of as analogous to the condition in an optimisation problem that the first derivative vanish at a stationary point, while condition (2) is analogous to the second derivative condition: it is the sign of the second derivative which determines whether the corresponding point is a local maximum or local minumum. Condition (3) is therefore necessary but not sufficient for to be an optimal measurement, however (2) is both necessary and sufficient. We give here a sketch of the proof, following the treatment of Barnett09 , which is extended to the sequential case in the rest of the paper.
If is optimal then for all other physically allowed measurements we require
[TABLE]
From this we obtain
[TABLE]
Note that for positive operators , it is always true that , which may be seen by evaluating the trace in the eigenbasis of :
[TABLE]
where are the eigenvalues of , are the eigenkets of , and the inequality follows from the positivity of . As is a positive operator it is therefore clear that condition (2) is sufficient in order for the inequality (4) to be satisfied. That this condition is also necessary may be shown by introducing the Hermitian operators
[TABLE]
Now if such that , the variation
[TABLE]
results in a measurement with higher probability of success than , which therefore cannot be an optimal measurement. Finally it is possible to show Barnett09 that
[TABLE]
and thus
[TABLE]
Thus the requirement reduces to condition (2), which is therefore both necessary and sufficient.
It is useful to denote . We finish by noting that for an optimal measurement , we require
[TABLE]
and therefore
[TABLE]
As discussed above, for positive operators , , , and it is clear from eqn (5) that equality holds if and only if . Thus we require that each term in the sum be identically zero, which further requires
[TABLE]
for any optimal measurement . This is an alternative necessary (but not sufficient) condition, and is sometimes useful for finding optimal measurements. It also implies, on summing over , that is unique, for any optimal (see also Bae13 ).
III Two copy state discrimination with sequential measurement
III.1 Necessary conditions
Now let us consider the two copy case, with sequential measurement. Suppose therefore we are provided with two copies of a state drawn from a known set with associated probabilities . The allowed measurement procedures are as follows: make a measurement described by some POVM on system ; given outcome make a measurement on system , as shown in the tree in Figure 1.
As the choice of measurement on system can in general depend on the outcome of measurement on , we denote the associated POVM , where for all and , and for each
[TABLE]
The measurement on the joint system is thus of the form , with the probability of correctly identifying the state given by:
[TABLE]
In the following we drop the superscripts , , whenever it is not confusing to do so. We begin by pointing out that each of , may be interpreted as an optimal measurement for an appropriately defined discrimination problem, as follows. We first note that, given measurement result on system , we can update the probabilities as follows, using Bayes’ rule:
[TABLE]
Thus given result on system , the possible states of system occur with probabilities . Clearly should thus be optimal for discriminating the states with the updated priors , and thus a necessary condition is
[TABLE]
or equivalently, using eqn. (9):
[TABLE]
which must hold for each . This set of conditions is necessary, but not sufficient (we haven’t done any optimisation over ). Finally, summing over gives:
[TABLE]
which is rather similar to the Helstrom condition (2), but with a partial trace over system .
Conversely, we can re-write eqn (8) as follows:
[TABLE]
where we have defined:
[TABLE]
We can interpret the trace one operators as density operators, and if we further define probabilities , it follows that must be optimal for discriminating the states with probabilities . The Helstrom condition (2) then gives:
[TABLE]
which may be re-written as:
[TABLE]
Finally we obtain
[TABLE]
Again, this is necessary, but not sufficient (this time we haven’t done any optimisation over ). One might hope that the conditions (10,15) when taken together are also sufficient, and could then imagine that it may be possible to construct an iterative procedure for numerical solution of the optimization problem. However, this turns out not to be the case; we will return to this point later. Each of conditions (10,15) however have a clear interpretation; note that it might have been expected that should be optimal for the updated priors given measurement of ; that plays a complementary role for a different discrimination problem is less obvious a priori. We return to give an interpretation of this discrimination problem later.
III.2 A necessary and sufficient condition
We now turn to the problem of simultaneously optimising both the measurement on and that on system . We find that the condition
[TABLE]
where is any physically allowed measurement on system is both necessary and sufficient for optimality of . Unfortunately this still contains an arbitrary measurement on system , and thus is not as readily applicable as the original Helstrom conditions to verify optimality of a candidate measurement. Nevertheless we will give examples in which it can be used to prove optimality analytically. We also note that the inclusion of an arbitrary measurement on one subsystem means that analysis beyond the bipartite case becomes complicated and our method is not readily extended to multipartite discrimination.
We begin by proving sufficiency of condition (16). If is optimal among sequential measurements, we require
[TABLE]
for all . Inserting the identity and re-arranging gives
[TABLE]
Condition (16) is therefore sufficient, if is any allowed measurement on .
That condition (16) is also necessary may be seen as follows: as in the unrestricted case, we introduce the manifestly Hermitian operator:
[TABLE]
Suppose now that there exists some and some such that
[TABLE]
We can construct a variation of as follows:
[TABLE]
where . Note that if has outcomes, the primed measurement on system has outcomes. Now note that
[TABLE]
Finally we note that, by virtue of the fact that is an optimal measurement for discriminating the states , it follows that , where is defined as:
[TABLE]
Thus we require
[TABLE]
which completes our proof.
IV Example: The double trine ensemble
As an example we consider the so-called double trine ensemble: two copies of the trine states, for which , and
[TABLE]
These each occur with prior probabilities , and have the symmetry property
[TABLE]
where is a rotation of around the -axis in the Bloch sphere.
IV.1 Optimal sequential measurement
For the two-copy case, Chitambar and Hsieh Chitambar13 showed that the optimal sequential measurement rules out one state of the three in the first step, and corresponds to the Helstrom measurement to distinguish between the remaining two states in the second step. We first briefly present this optimal measurement, and then use it to demonstrate our conditions.
The optimal sequential measurement thus makes the measurement on the first copy, where the states form the so-called anti-trine ensemble:
[TABLE]
Following this measurement, the updated priors become , and is then the optimal measurement to distinguish the two remaining equiprobable pure states . This is a case of the well-known Helstrom measurement, and is a projective measurement in a basis located symmetrically around the signal states (see e.g. Barnett09review ). Thus for , , and for we denote , where
[TABLE]
These states, along with the trine and anti-trine states are shown in the Bloch sphere picture in Figure 2.
IV.2 Necessary and sufficient conditions
We now use this strategy to illustrate the conditions presented in the previous section. From the symmetry we find that , for all , where is the probability of success of the Helstrom measurement distinguishing between two equiprobable states with overlap , i.e. from Helstrom76 :
[TABLE]
By construction, this measurement strategy satisfies condition (10). To evaluate (15) and the necessary and sufficient condition (16), we first calculate :
[TABLE]
where in the last line we have used . We first show that the strategy satisfies condition (15). We obtain
[TABLE]
from which it is clear that condition (15) is satisfied for each . Finally, to prove that this is indeed the optimal strategy, we must show that it satisfies the necessary and sufficient condition (16). As we have shown that is proportional to the identity, this amounts to showing that for any allowed measurement on system , the largest eigenvalue of the operator
[TABLE]
is bounded by . The proof that this holds is straight-forward but needs a few steps, and the details are given in appendix A.
The probability of correctly identifying the state using the optimal sequential measurement is given by
[TABLE]
IV.3 Comparison of global and sequential schemes
For comparison we recall the globally optimal measurement strategy, also discussed in Chitambar13 . Recall the double trine ensemble satisfies , where is a rotation of around the -axis in the Bloch sphere. For sets with such symmetry the optimal measurement was shown by Ban et al to be given by the so-called square-root measurement Ban97 (also known as the “pretty-good measurement” Hausladen94 ). In this case, the optimal measurement corresponds to a projective measurement, with operators , where
[TABLE]
The probability of correctly identifying the state is
[TABLE]
Note that the probability of identifying the state correctly achieved by the optimal sequential measurement is greater than of that achieved by the optimal global measurement. In systems where joint measurement is technologically challenging it is thus perhaps difficult to argue that the additional experimental effort is merited by the improvement in performance in this case.
We comment finally on the optimal sequential measurement as an approximation to the optimal global measurement. For the optimal sequential measurement, given above, we obtain
[TABLE]
Considering , after a little algebra we find
[TABLE]
where
[TABLE]
Thus we can write
[TABLE]
Note that , and hence this is the eigendecomposition of the operator. We further note that is orthogonal to the signal state and thus does not contribute to the probability of identifying the state. The remaining eigenvector is an approximation to , the state onto which the optimal global measurement projects; an amazingly good one in fact: it turns out . Due to the weighting factor, the overlap between and is given by .
The state is thus very close to a superposition of and , with appropriate normalisation:
[TABLE]
The optimal sequential measurement, on the other hand, is formed from a mixture of projectors onto these same states. It gives additional information – one state is ruled out with certainty – at the expense of a slightly lower probability of success.
IV.4 A non-optimal sequential measurement
The example of the trine states is further illuminating, as there exists another measurement strategy which satisfies both necessary conditions (10) and (15), but which is not an optimal strategy, thus demonstrating that these two conditions, when taken together, are not sufficient to define the optimal measurement. This strategy is to perform the optimal minimum error measurement at each step, with Bayesian update of the probabilities in between measurements. Note that such a strategy is known to be optimal (in fact performs as well as the best joint measurement) for a different set of states - the case of just two pure states Brody96 ; Acin05 . For the trine states, the measurement is as follows: is the optimal one-copy minimum error measurement, which consists of weighted projectors onto the trine states themselves Helstrom76 ; Ban97 , . Note that for the trine states , and thus the updated priors upon obtaining outcome are, using equation (9):
[TABLE]
For each , the states with these probabilities have so-called mirror symmetry – the set is invariant under reflection about . For such a set, the minimum error problem was considered by Andersson et al Andersson02 : using their results we find for the optimal measurement is of the form:
[TABLE]
where depends on the geometry of the set and the prior probabilities Andersson02 : for our case we find . The optimal measurements for are obtained by symmetry . Note that condition (10) is satisfied by construction. Turning to condition (15), we find
[TABLE]
with analogous results for . Concisely, . Finally, we can calculate :
[TABLE]
For we obtain:
[TABLE]
from which it is clear that condition (15) is satisfied for each .
An analogous situation arises in state discrimination maximising the mutual information between sender and receiver - a necessary but not sufficient condition is known, and for the example of the trine states, is satisfied by both the trine measurement, which is not optimal Ban97 , and the anti-trine measurement, which is optimal Sasaki99 . We finally note that the probability of correctly identifying the state using this scheme, , is considerably worse than that given by the optimal sequential measurement from above.
V General bi-partite case
V.1 Necessary and sufficient conditions
Above, for simplicity, we confined our discussion of optimal sequential measurement strategies to the case of two-copy state discrimination. The conditions obtained however are easily extended to the general bi-partite case. Suppose therefore we are provided with a bi-partite state drawn from a known set , with known a priori probabilitites . If our measurement strategy is restricted to sequential measurements on each subsystem, with feed-forward, what is the best measurement to make? The allowed measurements on the joint system are again described by POVMs of the form , and the probability of correctly identifying the state is expressed:
[TABLE]
Following the same reasoning as in Section III, the necessary conditions eqns (10), (15) become:
[TABLE]
with the following interpretation: given a measurement on system , must be optimal for discriminating the updated states , occuring with probabilities :
[TABLE]
Similarly, given measurements on system , must be optimal for discriminating the states , occuring with probabilities :
[TABLE]
Finally, following the same argument as in Section III, the necessary and sufficient condition for optimality of for discriminating the general bipartite states becomes:
[TABLE]
where is any physically allowed measurement on system B.
V.2 Example: Three Bell states
As an example of the general case, we consider the simple case of discriminating between three Bell states :
[TABLE]
occurring with equal probabilities . Although perfect discrimination between any two Bell states is possible by only local measurements and feed-forward (for example, to distinguish between and one need only measure both systems in the basis and look at the correlations between outcomes) it is known that for more than two states this is no longer possible Ghosh01 ; Walgate02 . To distinguish between all three states, one strategy is to simply perform the measurement that perfectly distinguishes any two states, and never identify the third. We show that this strategy is optimal in terms of minimising the probability of error.
Consider therefore the measurement:
[TABLE]
that is, both Alice and Bob measure in the basis. Bob takes outcome ‘[math]’ to indicate state , and outcome ‘’ to indicate state . State is never identified.
It is useful to rewrite equation (19) as follows:
[TABLE]
where
[TABLE]
Note that is a density operator. Further, it is straight-forward to show that
[TABLE]
while
[TABLE]
where the second line follows as the reduced density operator for system B in all cases is proportional to the identity , and the last line follows from the POVM condition . Thus the condition (19) becomes
[TABLE]
which is true for any arbitrary density operator . Thus is an optimal measurement among sequential strategies for discrimination of the three Bell states. A similar approach could be taken to the problem of discriminating all four Bell states, but this complicates the analysis without changing the basic conclusions.
V.3 Example: Domino states
The domino states are an orthonormal basis of a two qutrit system, composed entirely of product states, which nevertheless are not perfectly distinguishable by local measurement and classical communication (LOCC) Bennett99 . These were the first set of states for which it was shown explicitly that information encoded in product states is not all available through local measurements. The set of states is given by:
[TABLE]
where . A useful graphical representation of the states is given in Fig. 3. As the states are orthonormal, they are perfectly distinguishable by a joint measurement. While it is known that any local measurement strategy, possibly consisting of many rounds of measurement and classical communication, cannot achieve perfect discrimination, in practice known lower bounds are really very small – the information deficit of any local protocol is at least (compared to an achievable value of bits) Bennett99 , while the probability of error is at least Childs13 . Although this is of theoretical interest, if these bounds are achievable it is fair to say that for all practical purposes the states are distinguishable by a local strategy, albeit one with many rounds of communication.
V.3.1 A candidate sequential measurement
We recently gave the achievable probability of correct discrimination using sequential measurements for these states Domino17 . Here we give an alternative proof, which uses the conditions introduced earlier. Motivated by the double-copy trine example, in which the best strategy rules out one state in the first step and discriminates optimally between the remaining two in the second step, we consider strategies that partition the allowed states into subsets in the first step and discriminate between the states within a subset in the second step. Note that amongst the domino states there are a total of 8 subsets that are perfectly distinguishable on the second system alone. These are:
[TABLE]
We therefore begin with the conjecture that the best measurement for discriminating the domino states optimally assigns the state to one of these subsets at the first step, and discriminates perfectly between the remaining 3 states in the second step. Thus the only error is introduced in the first step. Denoting now , the probability of identifying the correct state is
[TABLE]
where in the second line we have used the fact that if is in the subset , and is zero otherwise, and we have defined the index set such that if . Thus is the optimal measurement for discriminating the states
[TABLE]
formed by taking an equal mixture of states in the subsets , and occuring with equal probabilities .
V.3.2 Optimal subset discrimination
The optimal measurement and probability of success may be derived analytically, and are given in Appendix B. Here we discuss some of the symmetries of the states which allow us to simplify the problem, before proving that this measurement scheme results in an optimal sequential strategy.
The states have a lot of symmetry, in particular the set is invariant under the unitaries:
[TABLE]
which simply permute the states within the set. To make this point clear, it is useful to list the states explicitly:
[TABLE]
Clearly, applying either or to any of the states in the set simply results in another state from the same set. for some permutation . We may therefore expect the optimal measurement to have the same symmetries – indeed for any measurement , we can construct another measurement which has the same probability of success. As the figure of merit is linear, a probabilistic mixture of such strategies achieves the same probability of success, and further has the symmetry property . Thus we can restrict attention to measurements which have the same symmetry properties as the states.
Turning now to the operator
[TABLE]
we further note that
[TABLE]
Thus is invariant under both , and , and it follows that it must have the form:
[TABLE]
In Appendix B we show that , , giving a probability of correctly identifying the state of
[TABLE]
V.3.3 An optimal sequential strategy
We can now use condition (19) to prove that this is the best possible sequential measurement. Again, we outline here some of the symmetry arguments that allow us to simplify the problem, and give the remaining details in Appendix B. Eqn. 19 becomes
[TABLE]
It is useful to define the non-normalized state
[TABLE]
and we wish to show that , for all resulting from an allowed measurement .
We can again use symmetry properties of the states to considerably restrict the set of measurements we need to consider. Consider this time the unitaries
[TABLE]
Note that the operator is unchanged if we make the substitution
[TABLE]
or indeed under a strategy which is formed from a mixture of such strategies. We can make similar arguments for , with the result that we only need consider strategies such that the following combinations of operators are invariant under both and , and therefore must be diagonal in the basis: . Further, amongst such strategies it is clear that in order to maximise the coefficients we only need consider those such that
[TABLE]
where and for constants satisfying
[TABLE]
First note that for all such measurements are convex combinations of the eight fiducial measurements
[TABLE]
where , . Each such measurement leads to for some . Since for defined in eqn 20, by construction, any convex combination of such measurements satisfies , as required.
The remaining cases, in which must be considered separately. It is straight-forward to show that for these cases also – details of all possible measurements and the corresponding calculations are given in Appendix B.
Thus we find that the optimal sequential strategy for discriminating between the domino states with equal priors identifies the state correctly with probability . As the optimal joint measurement discriminates the states perfectly, there is a significant gap in performance, which could in principle be demonstrated experimentally.
VI A related discrimination problem
We conclude by discussing an interpretation of the states , defined in equation (12), and thus a second discrimination problem for which provides an optimal measurement. For simplicity we refer to the two copy case throughout, but the discussion applies equally to the general bi-partite case. Recall that, in a measurement on system B described by POVM , the probability of identifying a given state correctly from the set with prior probabilities is given by the joint probability:
[TABLE]
while the overall probability of correctly identifying the prepared state is obtained by summing over each possible : , where we have chosen the notation to make explicit the dependence on the choice of measurement . We can thus interpret the ratio of these as the conditional probability that state was prepared given that measurement was performed and the state was identified correctly as a result. Explicitly:
[TABLE]
We thus arrive at an interpretation for the state – it is the state we should assign to system , given knowledge that a measurement performed on system identified the state correctly (but importantly, without knowledge of the particular outcome of measurement on ):
[TABLE]
Similarly, consider the probabilities : if a measurement is chosen from the set with equal probabilities , then represents the conditional probability that the measurement used was , given the knowledge that the state was correctly identified:
[TABLE]
is thus the optimal measurement for discriminating the residual states on system , given that a measurement chosen from the set was performed on system , and the state of system was correctly identified as a result. is the measurement that allows us to optimally guess which measurement was performed on .
Suppose further that another measurement is added to the set of possible measurements , on . If we now define
[TABLE]
we can rewrite condition (16) as follows:
[TABLE]
where are defined as before. This tells us that the measurement which discriminates optimally between the states , but which never identifies remains optimal for the new set. That is, the optimal measurement is unchanged by the addition of a new measurement to the set used to measure system .
We thus arrive at a new discrimination problem, seemingly unrelated to our original problem of interest, but for which the measurement also provides an optimal strategy, and for which the conditions (15) and (16) have a natural interpretation. Consider the following game involving three parties, Alice, Bob, and Claire. Claire prepares two copies of a state , drawn from a given set with priors , and sends one copy to Alice and one to Bob. Claire also sends an index to Bob (this is classical information and may be sent over a classical channel), chosen with equal probabilities from the set , where is an integer chosen by Alice and Bob, and is the payout they will receive if they win the game. Alice and Bob each perform a measurement on their system, following which Bob must make a guess as to the state , while Alice must guess the index . Alice and Bob can pre-agree on a strategy, but cannot communicate with one another once the game begins. They win only if both guesses are correct. Their strategy is as follows: Alice always makes the measurement , while Bob’s chosen measurement depends on the index received from Claire – given , Bob makes measurement . The probability that Alice and Bob win the game is simply
[TABLE]
and the expected payout is thus
[TABLE]
This is the same figure of merit as that given in eqn (8). Thus the optimal measurement strategy maximising the expected payout for Alice and Bob is the same as the optimal sequential measurement discriminating the bi-partite states .
VII Discussion
We have discussed the problem of extracting classical information from a set of bi-partite states, when the measurement strategy is restricted to sequential measurements of each subsystem, with feed-forward of classical information in between measurements. As this is a physically well-motivated class, it is useful to understand how well it performs compared to the ability to perform arbitrary joint measurements, which in many physical systems is still technologically challenging. We have constructed an analogue of the Helstrom conditions for sequential measurement strategies. Like the Helstrom conditions, it is not obvious how to use this condition to construct an optimal measurement, but we show how for certain examples it is possible to use the condition to prove optimality of a candidate measurement procedure.
Our necessary and sufficient condition for optimality of a given sequential measurement still contains an arbitrary measurement on one subsystem. We have been unable to find a condition which is both necessary and sufficient and requires only the set of states and a candidate measurement. It would certainly be useful to find one, but in the absence of such, given a candidate optimal measurement our condition reduces the complexity of checking optimality from optimising over both systems to just optimising over one. It would also be interesting in the future to extend this analysis to other figures of merit such as those which interpolate between minimum-error and unambiguous discrimination Chefles98 , or which maximise the success rate of discrimination while allowing for inconclusive results Herzog2015 ; Fiurasek2003 .
For the two-copy trine case, the probability of success of the optimal sequential measurement is 96 % of the value achieved by the optimal global measurement Chitambar13 . The optimal sequential measurement sometimes rules out one of the states with certainty, thus providing information not given by the optimal global strategy, at the expense of a slightly higher probability of failure. Nonetheless, the difference in performance is arguably too small to motivate experimental implementation of the joint measurement. In fact, although we do not give the details here, we have found that for two copies of any set of symmetric qubit states, the optimal sequential measurement performs almost as well as the optimal joint measurement.
We have given the optimal sequential measurement for discriminating the domino states. This set of orthogonal product states has played an important role in quantifying the difference between local measurements and separable measurements Bennett99 , but the more practical question of how well a sequential measurement performs seems not to have been considered in the literature until recently Domino17 . We gave here an alternative proof for the optimal sequential measurement, which reveals a significant gap between the probability of success of discrimination of the optimal sequential measurement (83.6%) and the optimal global measurement, which discriminates the states perfectly.
We further introduced a complementary discrimination problem, in the form of a three-party game, which requires optimisation of the same figure of merit as our original problem of minimising the error over sequential measurement strategies. This game arises naturally in providing an interpretation for the conditions an optimal measurement must satisfy, and provides a new perspective on the sequential measurement problem.
Acknowledgements.
This work was supported by the University of Glasgow College of Science and Engineering (S.C. & G.W.) and by the Royal Society Research Professorships (S.M.B., Grant No RP150122).
Appendix A Proof of optimality for the double trine ensemble
To prove optimality of the sequential measurement scheme given in the text, we wish to show that the largest eigenvalue of
[TABLE]
is less than or equal to for any physically allowed measurement . We begin by writing the trine states in the Bloch sphere representation:
[TABLE]
Writing we thus obtain
[TABLE]
with eigenvalues
[TABLE]
Thus it follows that there exists some such that the largest eigenvalue, may be written:
[TABLE]
where in the second equality we use the fact that is real, and in the last line we have substituted for , and defined . Each strategy thus defines a such that the above equalities hold. For each such , we can find an upper bound for by considering the optimisation problem of discriminating the states occuring with priors :
[TABLE]
We thus wish to find the optimal strategy for discriminating the trine states with a priori probabilities , ultimately maximising the probability of correctness also over . Finally, if this maximum is achievable then we have succeeded in finding the optimal .
We first choose, without loss of generality, to consider . This corresponds to . We use the strategy in Chitambar13 of bounding the probability of correctly identifying the state by considering the problem of discriminating from . As any strategy which discriminates all three states also discriminates these two states, the optimal probability of correctly identifying the state for this problem is greater than or equal to that for discriminating all three states
[TABLE]
Substituting for , , after a little algebra we obtain:
[TABLE]
For in the range , this is a monotonically decreasing function of , thus the maxmimum occurs at the boundary of the allowed domain, at , corresponding to
[TABLE]
Thus we obtain , as desired. Further this bound is achievable, by the strategy given by Chitambar13 and outlined in the main text.
Appendix B Domino states
We begin with the optimal measurement to discriminate the states given by eqn (22), occuring with equal probabilities . Our strategy is to search for satisfying , and then use eqn (7) to find . In fact, as defined in eqn (23) is simply proportional to , , and eqn (7) still holds when multiplied by a constant, we work directly with and search for , satisfying
[TABLE]
for all .
Recall, as argued in the main text, that is invariant under the unitaries , from eqn (21), and thus has the form . We further note that it suffices to check the inequality for and , as all other states can be obtained from these by application of some combination of and , by symmetry it then holds for all . For , this condition – expressed in matrix form in the basis – becomes:
[TABLE]
Thus we require , and
[TABLE]
For , the condition is more conveniently expressed in the basis, in which it has matrix form:
[TABLE]
leading to the additional conditions , and
[TABLE]
Equality in (27) and (28) means that each of the operators has a zero eigenvalue: is then a weighted projector onto the corresponding eigenvector in each case. Setting each equal to zero therefore and solving for and gives
[TABLE]
are then fixed up to multiplying factors, which may be chosen such that .
We now turn to the proof that the sequential measurement strategy given in the main text is indeed the optimal strategy. We wish to show that for all , of the form given in eqn (LABEL:sigmatilde), where according to symmetry arguments we only need consider measurements of the form (26). Note that all measurements of this form may be considered to be probabilistic mixtures of a smaller set of fiducial measurements. An exhaustive list of those that cannot be decomposed as a mixture of other measurements are those in which the following elements are the only non-zero ones:
[TABLE]
The first three correspond to the case for some , and the operator inequality holds by construction. The last three are obtained from others by applying , and so by symmetry we only need check the inequality for the remaining four. We consider the remaining possibilities in turn.
Case 1: :
All measurements in which , are the only non-zero elements may be parametrised in the following way, where , :
[TABLE]
For , this leads to
[TABLE]
where we have used the inequality . Note that the case is obtained by applying to and thus by symmetry we only need check the case. For this case, in matrix notation, in the basis, we obtain
[TABLE]
Note that with the values of and calculated in eqn (29), the diagonal elements are all strictly positive, and we further require . Re-writing the first term in brackets as we obtain
[TABLE]
The combination of the first two terms is positive according to eqn (28), and the last term is also positive, as is readily seen by noting and by explicit substitution for and (or as a quick check, note that , while ). Thus the inequality holds.
Case 2: :
All measurements in which , , are the only non-zero elements may be parametrised in the following way, where , :
[TABLE]
Note that by symmetry, we only need explicitly consider one value of and . For , , we obtain
[TABLE]
where in the second line we have used the inequality , and in the third line we have added the positive operator . Thus in matrix notation, in the basis, we obtain
[TABLE]
The diagonal elements are strictly positive, while according to the discussion in Case 1 above. Thus the operator inequality holds.
Case 3: :
All measurements in which are the only non-zero elements may be parametrised in the following way, where , , , :
[TABLE]
From eqn (LABEL:sigmatilde) we obtain
[TABLE]
where we have used again the inequality . This is diagonal in the basis, and it is easy to see that holds.
Case 4: :
All measurements in which , , are the only non-zero elements may be parametrised in the following way, where , , , :
[TABLE]
From eqn (LABEL:sigmatilde) we obtain
[TABLE]
where we have used again the inequality , and in the last line use . Recall that is diagonal in the basis, so it suffices to check
[TABLE]
which clearly holds as , and
[TABLE]
which we recognise as , and therefore holds by construction.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1(1) S.M. Barnett and S. Croke, Adv. Opt. Phot. 1 , 238 (2009).
- 2(2) J. Bae, and L.-C. Kwek, J. Phys. A: Math. Theor. 48 , 083001 (2015).
- 3(3) A. Chefles, Contemporary Physics 41 , 401 (2000)
- 4(4) J. Bergou, J. Mod. Opt. 57 , 160 (2010).
- 5(5) S.M. Barnett, “Quantum Information” (Oxford University Press, Oxford, 2009).
- 6(6) C.W. Helstrom, Inf. Control 10 , 254 (1967).
- 7(7) C.W. Helstrom, Inf. Control 13 , 156 (1968).
- 8(8) A.S. Holevo, J. Multivariate Analysis 3 , 337 (1973).
