Quantum measurements can sometimes extract more information from multiple copies of a state than from each copy separately. One of the simplest settings is the discrimination of three qubit states when two identical copies are available and one is allowed to perform an arbitrary joint measurement. Recent numerical work identified the double-trine ensemble as the apparent optimal benchmark in this setting, but an analytic proof of its optimality remained open. In this paper, we prove that the double-trine ensemble is indeed globally optimal. More precisely, among all triples of equally likely qubit states, no choice of states can give a larger optimal two-copy discrimination success probability. The result holds in full generality, whether the signal states are pure or mixed, real or complex. This exactly solved case serves as a foundation for a broader analytic understanding of optimal collective measurements.
Abstract We investigate the optimal measurement strategy for state discrimination of the trine ensemble of qubit states prepared with arbitrary prior probabilities. Our approach generates the minimum achievable probability of error and also the maximum confidence strategy. Although various cases with symmetry have been considered and solution techniques put forward in the literature, to our knowledge this is only the second such closed form, analytical, arbitrary prior, example available for the minimum-error figure of merit, after the simplest and well-known two-state example.
Abstract It is a central fact in quantum mechanics that non-orthogonal states cannot be distinguished perfectly. In general, the optimal measurement for distinguishing such states is a collective measurement. However, to the best our knowledge, collective measurements have not been used to enhance quantum state discrimination to date. One of the main reasons for this is the fact that, in the usual state discrimination setting with equal prior probabilities, at least three copies of a quantum state are required to be measured collectively to outperform separable measurements. This is very challenging experimentally. In this work, by considering unequal prior probabilities, we propose and experimentally demonstrate a protocol for distinguishing two copies of single qubit states using collective measurements which achieves a lower probability of error than can be achieved by any non-entangling measurement. Additionally, we implemented collective measurements on three and four copies of the unknown state and found they performed poorly.
In 1991, Peres and Wootters wrote a seminal paper on the nonlocal processing of quantum information [Phys. Rev. Lett. 66, 1119 (1991)]. We return to their classic problem and solve it in various contexts. Specifically, for discriminating the ``double trine'' ensemble with minimum error, we prove that global operations are more powerful than local operations with classical communication (LOCC). Even stronger, there exists a finite gap between the optimal LOCC probability and that obtainable by separable operations (SEP). Additionally we prove that a two-way, adaptive LOCC strategy can always beat a one-way protocol. Our results demonstrate ``nonlocality without entanglement'' in two-qubit pure states.
Quantum state discrimination is a fundamental task in the field of quantum communication and quantum information theory. Unless the states to be discriminated are mutually orthogonal, there will be some error in any attempt to determine which state was sent. Several strategies to optimally discriminate between quantum states exist, each maximising some figure of merit. In this thesis we mainly investigate the minimum-error strategy, in which the probability of correctly guessing the signal state is maximised. We introduce a method for constructing the optimal Positive-Operator Valued Measure (POVM) for this figure of merit, which is applicable for arbitrary states and arbitrary prior probabilities. We then use this method to solve minimum-error state discrimination for the so-called trine states with arbitrary prior probabilities - the first such general solution for a set of quantum states since the two-state case was solved when the problem of state discrimination was first introduced. We also investigate the difference between local and global measurements for a bipartite ensemble of states, and find that in certain circumstances the local measurement is superior. We conclude by finding a bipartite analogue to the Helstrom conditions, which indicate when a POVM satisfies the minimum-error criteria.
Quantum state discrimination is a fundamental information processing task that serves as a key component in many applications while also carrying foundational significance. In this work, we consider minimum error discrimination of multi-copy states, where instead of preparing a single system we assume that multiple instances of the same state are prepared. Now the discrimination allows for measurements from multiple parties with different measurement strategies varying from global measurement strategy to ones restricted to different forms of local operations and classical communication strategies. By comparing the average success probabilities in quantum and classical cases, we find a qubit strategy that outperforms all the bit strategies. On the other hand, we show that the classical measurement strategy does not give benefit in qubit over bit. However, we find that there are other (qu)bit-like operational theories which can outperform the best qubit strategies even with a classical measurement strategy and we are able to identify instances of different theories where different measurement strategies are optimal. In this way, we are able to find instances of nonlocality without entanglement as well as provide general bounds for bit-like operational theories.
This work investigates which sets of quantum states give rise to the highest achievable success probability in minimum-error state discrimination if multiple copies of the unknown state are given. Specifically, we consider uniformly distributed ensembles of the form
{N1,ρi⊗k}i=1N, where
N states in dimension
d are provided in
k identical copies, and derive universal limits in this scenario. For pure state ensembles, we prove that whenever
N is large enough to support a state
k-design, these designs will exactly give rise to the maximally discriminable sets. We further show that when
N exceeds the size required for a
k-design, mixed states can outperform all pure state ensembles. We then recognise that the problem of most discriminable classical states in the multi-copy regime is in one-to-one correspondence to the concept of the multiplicative Bayes capacity of independent uses of classical channels, a concept that emerges naturally in the context of classical information leakage. This connection allows us to completely solve the classical analogue of our problem when
N≥(kd+k−1), and to prove that quantum systems offer a quadratic advantage (in number of copies
k) over classical ones. Then, we prove that this quantum over classical advantage is strongly reduced when one is restricted to real quantum states, more precisely, when
N≥k+1, pure real qubits only offer a constant advantage over classical bits. Finally, we introduce computational techniques to find sets of most discriminable ensembles and to obtain rigorous universal upper bounds on the maximal success probability for multi-copy state discrimination in cases that are analytically intractable.