We consider the apparatus in a quantum measurement process to be in a mixed state. We propose a simple upper bound on the probability of correctly distinguishing any number of mixed states. We use this to derive fundamental bounds on the efficiency of a measurement in terms of the temperature of the apparatus.
We analyze a quantum measurement where the apparatus is initially in a mixed state. We show that the amount of information gained in a measurement is not equal to the amount of entanglement between the system and the apparatus, but is instead equal to the degree of classical correlations between the two. As a consequence, we derive an uncertainty-like expression relating the information gain in the measurement and the initial mixedness of the apparatus. Final entanglement between the environment and the apparatus is also shown to be relevant for the efficiency of the measurement.
We show that the quantum measurement known as the pretty good measurement can be used to identify an unknown quantum state picked from any set of n mixed states that have pairwise fidelities upper-bounded by a constant below 1, given O(logn) copies of the unknown state, with high success probability in the worst case. If the unknown state is promised to be pure, there is an explicit measurement strategy which solves this worst-case quantum state discrimination problem with O(∥G∥) copies, where G is the Gram matrix of the states.
One of the fundamental tasks in quantum information processing is to measure the quantum channels. Similar to measurements of quantum states, measurements of quantum channels are inherently stochastic, that is, quantum theory provides a formula to calculate the probability of obtaining an outcome. The upper bound on each probability associated with the measurement outcome of the quantum channels is a fundamental and important quantity. In this study, we derived the upper bounds of the probability in a channel measurement for specific classes of quantum channels. We also present two applications for the upper bounds. The first is the notion of convertibility considered by Alberti and Uhlmann and the second is the detection problem of a quantum channel. These applications demonstrate the significance of the obtained upper bounds.
We consider the following simple scenario: Alice has one of many possible messages, drawn from a known distribution, and wants to maximize the probability that Bob guesses her message correctly. We prove that if Alice can send only a qudit to Bob, without preshared entanglement, there is never any advantage over sending him a classical dit. This result was previously known only for a uniform distribution.
We also prove a mixed-state generalization of this result in the form of an upper bound on the success probability of discriminating between mixed quantum states with a single measurement. This bound is based solely on the dimension, probability distribution, and eigenvalues of the states and is sharp among such bounds.