We present two quantum union bounds for sequential projective measurements. These bounds estimate the disturbance accumulation and probability of outcomes when the measurements are performed sequentially. These results are based on a trigonometric representation of quantum states and should have wide application in quantum information theory for information-processing tasks such as communication and state discrimination, and perhaps even in the analysis of quantum algorithms.
We present two quantum union bounds for sequential projective measurements. These bounds estimate the disturbance accumulation and probability of outcomes when the measurements are performed sequentially. These results are based on a trigonometric representation of quantum states and should have wide application in quantum information theory for information-processing tasks such as communication and state discrimination, and perhaps even in the analysis of quantum algorithms.
In this paper, we prove a quantum union bound that is relevant when performing a sequence of binary-outcome quantum measurements on a quantum state. The quantum union bound proved here involves a tunable parameter that can be optimized, and this tunable parameter plays a similar role to a parameter involved in the Hayashi–Nagaoka inequality (Hayashi & Nagaoka 2003 IEEE Trans. Inf. Theory 49 , 1753–1768. ( doi:10.1109/TIT.2003.813556 )), used often in quantum information theory when analysing the error probability of a square-root measurement. An advantage of the proof delivered here is that it is elementary, relying only on basic properties of projectors, Pythagoras' theorem, and the Cauchy–Schwarz inequality. As a non-trivial application of our quantum union bound, we prove that a sequential decoding strategy for classical communication over a quantum channel achieves a lower bound on the channel's second-order coding rate. This demonstrates the advantage of our quantum union bound in the non-asymptotic regime, in which a communication channel is called a finite number of times. We expect that the bound will find a range of applications in quantum communication theory, quantum algorithms and quantum complexity theory.
Sequential quantum information processing may lie in the peaceful coexistence of no-go theorems on quantum operations, such as the no-cloning theorem, the monogamy of correlations, and the no-signalling principle. In this work, we investigate a sequential scenario of quantum state discrimination with maximum confidence, called maximum-confidence discrimination, which generalizes other strategies such as minimum-error and unambiguous discrimination. We show that sequential discrimination with equally high confidence can be realized if and only if positive-operator-valued measure elements for a maximum-confidence measurement can be unambiguously discriminated, i.e., linearly independent; otherwise, a party will have strictly less confidence in measurement outcomes than the previous one. We investigate the tradeoff between state disturbance and information gain in sequential state discrimination and show that the less guessing probability there is from conclusive outcomes for each party, the more parties can participate in the sequential scenario.
Because a quantum measurement generally disturbs the state of a quantum system, one might think that it should not be possible for a sender and receiver to communicate reliably when the receiver performs a large number of sequential measurements to determine the message of the sender. We show here that this intuition is not true, by demonstrating that a sequential decoding strategy works well even in the most general ‘one-shot’ regime, where we are given a single instance of a channel and wish to determine the maximal number of bits that can be communicated up to a small failure probability. This result follows by generalizing a non-commutative union bound to apply for a sequence of general measurements. We also demonstrate two ways in which a receiver can recover a state close to the original state after it has been decoded by a sequence of measurements that each succeed with high probability. The second of these methods will be useful in realizing an efficient decoder for fully quantum polar codes, should a method ever be found to realize an efficient decoder for classical-quantum polar codes.
Sequential quantum information processing may lie in the peaceful coexistence of no-go theorems on quantum operations, such as the no-cloning theorem, the monogamy of correlations, and the no-signalling principle. In this work, we investigate a sequential scenario of quantum state discrimination with maximum confidence, called maximum-confidence discrimination, which generalizes other strategies including minimum-error and unambiguous state discrimination. We show that sequential state discrimination with equally high confidence can be realized only when positive-operator-valued measure elements for a maximum-confidence measurement are linearly independent; otherwise, a party will have strictly less confidence in measurement outcomes than the previous one. We establish a tradeoff between the disturbance of states and information gain in sequential state discrimination, namely, that the less a party learn in state discrimination in terms of a guessing probability, the more parties can participate in the sequential scenario.
We discuss sequential unambiguous state-discrimination measurements performed on the same qubit. 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, who also measures it. The object in both cases is to determine which state Alice sent. In an unambiguous state discrimination measurement, we never make a mistake, i.e., misidentify the state, but the measurement may fail, in which case we gain no information about which state was sent. We find that there is a nonzero probability for both Bob and Charlie to identify the state, and we maximize this probability. The probability that Charlie's measurement succeeds depends on how much information about the state Alice sent is left in the qubit after Bob's measurement, and this information can be quantified by the overlap between the two possible states in which Bob's measurement leaves the qubit. This Letter is a first step toward developing a theory of nondestructive sequential quantum measurements, which could be useful in quantum communication schemes.
Measurement incompatibility enables quantum advantages in communication and state discrimination. It is also necessary for Bell nonlocality, which is used in device-independent protocols for quantum key distribution and private randomness generation. Classical communication can influence the receiver's outcome and must therefore be accounted for when certifying measurement incompatibility. We introduce union maximal leakage, which quantifies the information needed for a common classical explanation of all observed probabilities and is computed from them by a linear program. If a message of at most k bits precedes the receiver's independent measurement choice, compatible measurements for each message give union maximal leakage at most k. This bound holds with any input-independent nonsignalling shared resource. In quantum theory, a violation also implies that the initially shared state is entangled. Conversely, union maximal leakage determines the minimum classical communication needed to reproduce the observations with compatible measurements and arbitrary nonsignalling assistance. For a fixed shared quantum state and receiver measurements, a violation is possible exactly when, for some message value, the receiver's measurements are Bell-nonlocal against two-outcome sender measurements on that state. For binary receiver outcomes, we show that a violation also certifies randomness private from the sender, even when the receiver's measurement depends on the sender's message and the sender retains quantum side information. We quantify this privacy through an explicit conditional entropy bound and establish composably secure randomness extraction in sequential protocols with device memory.