Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Interaction in quantum communication and the complexity of set disjointness
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
A new protocol and lower bounds for quantum coin flipping
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Spectrally Bounded Sequences, Codes, and States: Graph Constructions and Entanglement
Proceedings of the 8th IMA International Conference on Cryptography and Coding
A new protocol and lower bounds for quantum coin flipping
Journal of Computer and System Sciences - STOC 2001
Cryptography In the Bounded Quantum-Storage Model
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
General paradigm for distilling classical key from quantum states
IEEE Transactions on Information Theory
Quantum entropic security and approximate quantum encryption
IEEE Transactions on Information Theory
Bounds on Shannon distinguishability in terms of partitioned measures
Quantum Information Processing
Quantum Information & Computation
Assisted entanglement distillation
Quantum Information & Computation
Quantum and classical message protect identification via quantum channels
Quantum Information & Computation
Information vs. disturbance in dimension D
Quantum Information & Computation
Quantum Information & Computation
Some properties of partial fidelities
Quantum Information & Computation
Sub- and super-fidelity as bounds for quantum fidelity
Quantum Information & Computation
Quantum commitments from complexity assumptions
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Quantum interactive proofs with competing provers
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Optimal state merging without decoupling
TQC'09 Proceedings of the 4th international conference on Theory of Quantum Computation, Communication, and Cryptography
An intuitive proof of the data processing inequality
Quantum Information & Computation
Matrices of fidelities for ensembles of quantum states and the holevo quantity
Quantum Information & Computation
Fano type quantum inequalities in terms of q-entropies
Quantum Information Processing
Comparisons between quantum state distinguishability measures
Quantum Information & Computation
Hi-index | 754.96 |
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 (1948) 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