Cryptographic distinguishability measures for quantum-mechanical states

Abstract

This paper, mostly expository in nature, surveys four measures of distinguishability for quantum-mechanical states. This is done from the point of view of the cryptographer with a particular eye on applications in quantum cryptography. Each of the measures considered is rooted in an analogous classical measure of distinguishability for probability distributions: namely, the probability of an identification error, the Kolmogorov distance, the Bhattacharyya coefficient, and the Shannon distinguishability (as defined through mutual information). These measures have a long history of use in statistical pattern recognition and classical cryptography. We obtain several inequalities that relate the quantum distinguishability measures to each other, one of which may be crucial for proving the security of quantum cryptographic key distribution. In another vein, these measures and their connecting inequalities are used to define a single notion of cryptographic exponential indistinguishability for two families of quantum states. This is a tool that may prove useful in the analysis of various quantum cryptographic protocols.

Bounds of the Pinsker and Fannes Types on the Tsallis Relative Entropy

“…The formula (4.5) was proved by Fuchs and van der Graaf [15]. Using (4.4), we obtain the following statement.…”

Entanglement and the foundations of statistical mechanics

“…where d eff E is a measure of the effective size of the environment, given by (12). Inserting equation (26) in (24) we obtain Theorem 1.…”

Robustness of Quantum Markov Chains

“…Invoking another inequality between distance measures for states, namely Pinsker's inequality, see [12],…”