Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Discrimination power of a quantum detector (1610.07644v1)

Published 24 Oct 2016 in quant-ph, cs.IT, math-ph, math.IT, and math.MP

Abstract: We investigate the ability of a quantum measurement device to discriminate two states or, generically, two hypothesis. In full generality, the measurement can be performed a number $n$ of times, and arbitrary pre-processing of the states and post-processing of the obtained data is allowed. Even if the two hypothesis correspond to orthogonal states, perfect discrimination is not always possible. There is thus an intrinsic error associated to the measurement device, which we aim to quantify, that limits its discrimination power. We minimize various error probabilities (averaged or constrained) over all pairs of $n$-partite input states. These probabilities, or their exponential rates of decrease in the case of large $n$, give measures of the discrimination power of the device. For the asymptotic rate of the averaged error probability, we obtain a Chernoff-type bound, dual to the standard Chernoff bound for which the state pair is fixed and the optimization is over all measurements. The key point in the derivation is that i.i.d. states become optimal in asymptotic settings. Minimum asymptotic rates are also obtained for constrained error probabilities, dual to Stein's Lemma and Hoeffding's bound. We further show that adaptive protocols where the state preparer gets feedback from the measurer do not improve the asymptotic rates. These rates thus quantify the ultimate discrimination power of a measurement device.

Citations (4)

Summary

We haven't generated a summary for this paper yet.