arXiv:1501.05744 · Physical Review A

Generalized quantum state discrimination problems

Kenji Nakahira, Kentaro Kato, Tsuyoshi Sasaki Usuda

Published May 6, 2015• 31 citations

Abstract

We address a broad class of optimization problems of finding quantum measurements, which includes the problems of finding an optimal measurement in the Bayes criterion and a measurement maximizing the average correct probability with a fixed rate of inconclusive results. Our approach can deal with any problem in which each of the objective and constraint functions is formulated by the sum of the traces of the multiplication of a Hermitian operator and a detection operator. We first derive dual problems and necessary and sufficient conditions for an optimal measurement. We also consider the minimax version of these problems and provide necessary and sufficient conditions for a minimax solution. Finally, for optimization problem having a certain symmetry, there exists an optimal solution with the same symmetry. Examples are shown to illustrate how our results can be used.

DOI: 10.1103/physreva.91.052304

Related papers

Finding optimal measurements with inconclusive results using the problem of minimum error discrimination

Kenji Nakahira, Tsuyoshi Sasaki Usuda, Kentaro Kato

We propose an approach for finding an optimal measurement for quantum state discrimination that maximizes the probability of correct detection with a fixed rate of inconclusive results. In our approach, we obtain the optimal measurement by solving the problem of finding a measurement that maximizes the weighted sum of the probability of correct detection and that of inconclusive results. We show that this problem can be reduced to the widely studied problem of finding a minimum error measurement for a certain state set, which maximizes the probability of correct detection without inconclusive results. As an application of our approach, we show how to solve the problem of finding an optimal measurement for qubit states with a fixed rate of inconclusive results.

Physical Review AFeb 24, 201521 citations

Finding Optimal Solutions for Generalized Quantum State Discrimination Problems

Kenji Nakahira, Tsuyoshi Sasaki Usuda, Kentaro Kato

We study an optimal quantum measurement for generalized quantum state discrimination problems, which include the problem of finding an optimal measurement maximizing the average success probability with and without a fixed rate of inconclusive results and the problem of finding an optimal measurement in the Neyman-Pearson strategy. We show that for any generalized quantum state discrimination problem, there is a corresponding minimum error discrimination problem sharing the same optimal measurement. We propose an approach in which the optimal measurement is obtained by solving the corresponding minimum error discrimination problem, and clarify the relationship between optimal solutions to the original and the corresponding problems, with which one can obtain an optimal solution to the original problem in some cases. Moreover, as an example of application of our approach, we present an algorithm for numerically obtaining optimal solutions to generalized quantum state discrimination problems.

arXiv:1510.05202IEEE Transactions on Information TheoryDec 24, 20168 citations

Minimax strategy in quantum signal detection with inconclusive results

Kenji Nakahira, Kentaro Kato, Tsuyoshi Sasaki Usuda

We consider the application of the minimax strategy to discrimination between quantum states with a certain fraction of inconclusive results. An inconclusive minimax solution is defined as the pair of a collection of prior probabilities and a quantum measurement that achieves the minimax probability of a detection error subject to the constraint that the highest probability of an inconclusive result does not exceed a given value. We first show a necessary and sufficient condition for an inconclusive minimax solution, and derive that the problem of obtaining an inconclusive minimax measurement can be expressed as a semidefinite programming problem. We then present a condition under which there exists a solution such that at least one of the prior probabilities is a zero. We finally show that for any state set with a certain symmetry, an inconclusive minimax solution exists having the same symmetry.

Physical Review ASep 13, 201313 citations

Generalized bipartite quantum state discrimination problems with sequential measurements

Kenji Nakahira, Kentaro Kato, Tsuyoshi Sasaki Usuda

We investigate an optimization problem of finding quantum sequential measurements, which forms a wide class of state discrimination problems with the restriction that only local operations and one-way classical communication are allowed. Sequential measurements from Alice to Bob on a bipartite system are considered. Using the fact that the optimization problem can be formulated as a problem with only Alice's measurement and is convex programming, we derive its dual problem and necessary and sufficient conditions for an optimal solution. Our results are applicable to various practical optimization criteria, including the Bayes criterion, the Neyman-Pearson criterion, and the minimax criterion. In the setting of the problem of finding an optimal global measurement, its dual problem and necessary and sufficient conditions for an optimal solution have been widely used to obtain analytical and numerical expressions for optimal solutions. Similarly, our results are useful to obtain analytical and numerical expressions for optimal sequential measurements. Examples in which our results can be used to obtain an analytical expression for an optimal sequential measurement are provided.

arXiv:1707.04736Physical Review AFeb 27, 20185 citations

Generalized quantum process discrimination problems

Kenji Nakahira, Kentaro Kato

We study a broad class of quantum process discrimination problems that can handle many optimization strategies such as the Bayes, Neyman-Pearson, and unambiguous strategies, where each process can consist of multiple time steps and can have an internal memory. Given a collection of candidate processes, our task is to find a discrimination strategy, which may be adaptive and/or entanglement assisted, that maximizes a given objective function subject to given constraints. Our problem can be formulated as a convex problem. Its Lagrange dual problem with no duality gap and necessary and sufficient conditions for an optimal solution are derived. We also show that if a problem has a certain symmetry and at least one optimal solution exists, then there also exists an optimal solution with the same type of symmetry. A minimax strategy for a process discrimination problem is also discussed. As applications of our results, we provide some problems in which an adaptive strategy is not necessary for optimal discrimination. We also present an example of single-shot channel discrimination for which an analytical solution can be obtained.

arXiv:2104.09759Physical Review AJun 14, 20219 citations

Minimum-Bayes-cost discrimination for symmetric quantum states

Kenji Nakahira, Tsuyoshi Sasaki Usuda

We derive the measurement strategy that optimizes the Bayes criterion, not necessarily the strategy minimizing the error probability, for distinguishing between collections of quantum states. We present a sufficient condition concerning the rank of each detection operator of an optimal measurement for the Bayes criterion. We also derive an analytical expression for an optimal measurement for the Bayes criterion for an Abelian geometrically uniform state set or for a cyclic state set under a certain constraint.

Physical Review ADec 6, 20125 citations