Entropy

Uniqueness of Minimax Strategy in View of Minimum Error Discrimination of Two Quantum States

Ji‐Hwan Kim, Donghoon Ha, Younghun Kwon

Published Jul 9, 2019• 4 citations

Abstract

This study considers the minimum error discrimination of two quantum states in terms of a two-party zero-sum game, whose optimal strategy is a minimax strategy. A minimax strategy is one in which a sender chooses a strategy for a receiver so that the receiver may obtain the minimum information about quantum states, but the receiver performs an optimal measurement to obtain guessing probability for the quantum ensemble prepared by the sender. Therefore, knowing whether the optimal strategy of the game is unique is essential. This is because there is no alternative if the optimal strategy is unique. This paper proposes the necessary and sufficient condition for an optimal strategy of the sender to be unique. Also, we investigate the quantum states that exhibit the minimum guessing probability when a sender's minimax strategy is unique. Furthermore, we show that a sender's minimax strategy and a receiver's minimum error strategy cannot be unique if one can simultaneously diagonalize two quantum states, with the optimal measurement of the minimax strategy. This implies that a sender can confirm that the optimal strategy of only a single side (a sender or a receiver but not both of them) is unique by preparing specific quantum states.

DOI: 10.3390/e21070671

Related papers

Minimax quantum-state discrimination

Giacomo Mauro D’Ariano, Massimiliano Federico Sacchi, Jonas Kahn

We derive the optimal measurement for quantum-state discrimination without a priori probabilities, i.e., in a minimax strategy instead of the usually considered Bayesian one. We consider both minimal-error and unambiguous discrimination problems, and provide the relation between the optimal measurements according to the two schemes. We show that there are instances in which the minimum risk cannot be achieved by an orthogonal measurement, and this is a common feature of the minimax estimation strategy.

arXiv:quant-ph/0504048Physical Review ASep 8, 200550 citations

Quantum-state comparison and discrimination

A. Hayashi, T. Hashimoto, M. Horibe

We investigate the performance of discrimination strategy in the comparison task of known quantum states. In the discrimination strategy, one infers whether or not two quantum systems are in the same state on the basis of the outcomes of separate discrimination measurements on each system. In some cases with more than two possible states, the optimal strategy in minimum-error comparison is that one should infer the two systems are in different states without any measurement, implying that the discrimination strategy performs worse than the trivial ``no-measurement'' strategy. We present a sufficient condition for this phenomenon to happen. For two pure states with equal prior probabilities, we determine the optimal comparison success probability with an error margin, which interpolates the minimum-error and unambiguous comparison. We find that the discrimination strategy is not optimal except for the minimum-error case.

arXiv:1803.09030Physical Review AMay 21, 20183 citations

Structure of minimum-error quantum state discrimination

Joonwoo Bae

Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.

arXiv:1210.2845New Journal of PhysicsJul 18, 201381 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

Sequential measurements on qubits by multiple observers: Joint Best Guess strategy

Dov Fields, János A. Bergou, Árpád Varga

We study sequential state discrimination measurements performed on the same qubit by subsequent observers. Specifically, we focus on the case when the observers perform a kind of a minimum-error type state discriminating measurement where the goal of the observers is to maximize their joint probability of successfully guessing the state that the qubit was initially prepared in. We call this the Joint Best Guess strategy. In this scheme, Alice prepares a qubit in one of two possible states. The qubit is first sent to Bob, who measures it, and then on to Charlie, and so on to altogether N consecutive receivers who all perform measurements on it. The goal for all observers is to determine which state Alice sent. In the Joint Best Guess strategy, every time a system is received the observer is required to make a guess, aided by the measurement, about its state. The price to pay for this requirement is that errors must be permitted, the guess can be correct or in error. There is a nonzero probability for all the receivers to successfully identify the initially prepared state, and we maximize this joint probability of success. This work is a step toward developing a theory of nondestructive sequential quantum measurements and could be useful in multiparty quantum communication schemes based on communicating with single qubits, particularly in schemes employing continuous variable states. It also represents a case where subsequent observers can probabilistically and optimally get around both the collapse postulate and the no-broadcasting theorem.

arXiv:2005.11656IEEE International Conference on Quantum Computing and Engineering (QCE)Oct 1, 20205 citations

Nonclassical traits in multi-copy state discrimination

Tim Achenbach, Leevi Leppäjärvi, Hanwool Lee +1 more

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.

quant-pharXiv:2604.26647Apr 30, 20260 citations