Violating the Modified Helstrom Bound with Nonprojective Measurements
نویسندگان
چکیده
We consider the discrimination of two pure quantum states with three allowed outcomes: a correct guess, an incorrect guess, and a nonguess. To find an optimum measurement procedure, we define a tunable cost that penalizes the incorrect guess and nonguess outcomes. Minimizing this cost over all projective measurements produces a rigorous cost bound that includes the usual Helstrom discrimination bound as a special case. We then show that nonprojective measurements can outperform this modified Helstrom bound for certain choices of cost function. The Ivanovic-Dieks-Peres unambiguous state discrimination protocol is recovered as a special case of this improvement. Notably, while the cost advantage of the latter protocol is destroyed with the introduction of any amount of experimental noise, other choices of cost function have optima for which nonprojective measurements robustly show an appreciable, and thus experimentally measurable, cost advantage. Such an experiment would be an unambiguous demonstration of a benefit from nonprojective measurements.
منابع مشابه
A modified branch and bound algorithm for a vague flow-shop scheduling problem
Uncertainty plays a significant role in modeling and optimization of real world systems. Among uncertain approaches, fuzziness describes impreciseness while for ambiguity another definition is required. Vagueness is a probabilistic model of uncertainty being helpful to include ambiguity into modeling different processes especially in industrial systems. In this paper, a vague set based on dista...
متن کاملGeneralized Uncertainty Relations and Efficient Measurements in Quantum Systems
We consider two variants of a quantum-statistical generalization of the Cramér-Rao inequality that establishes an invariant lower bound on the mean square error of a generalized quantum measurement. The proposed complex variant of this inequality leads to a precise formulation of a generalized uncertainty principle for arbitrary states, in contrast to Helstroms variant [1] in which these relat...
متن کاملMinimum-error discrimination between mixed quantum states
We derive a general lower bound on the minimum-error probability for ambiguous discrimination between arbitrary m’s mixed quantum states with given prior probabilities. When m = 2, this bound is precisely the well-known Helstrom limit. Also, we give a general lower bound on the minimum-error probability for discriminating quantum operations. In particular, we show necessary and sufficient condi...
متن کاملNeural Network Modelling of Optimal Robot Movement Using Branch and Bound Tree
In this paper a discrete competitive neural network is introduced to calculate the optimal robot arm movements for processing a considered commitment of tasks, using the branch and bound methodology. A special method based on the branch and bound methodology, modified with a travelling path for adapting in the neural network, is introduced. The main neural network of the system consists of diff...
متن کاملProbabilistic Models of Nonprojective Dependency Trees
A notable gap in research on statistical dependency parsing is a proper conditional probability distribution over nonprojective dependency trees for a given sentence. We exploit the Matrix Tree Theorem (Tutte, 1984) to derive an algorithm that efficiently sums the scores of all nonprojective trees in a sentence, permitting the definition of a conditional log-linear model over trees. While discr...
متن کامل