The Quantum Chernoff Bound

Abstract

We consider the problem of discriminating two different quantum states in the setting of asymptotically many copies, and determine the optimal strategy that minimizes the total probability of error. This leads to the identification of the quantum Chernoff bound, thereby solving a long standing open problem. The bound reduces to the classical Chernoff bound when the quantum states under consideration commute. The quantum Chernoff bound is the natural symmetric distance measure between quantum states because of its clear operational meaning and because of the fact that it does not seem to share the undesirable features of other distance measures like the fidelity, the trace norm and the relative entropy.

References in corpus (1)

• Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms

Cited by in corpus (13)

• The large deviation approach to statistical mechanics
• Quantum Illumination with Gaussian States
• Quantum Process Tomography: Resource Analysis of Different Strategies
• Computable bounds for the discrimination of Gaussian states
• Correlation Matrices of Two-Mode Bosonic Systems
• Alternative fidelity measure for quantum states
• The Converse Part of The Theorem for Quantum Hoeffding Bound
• Generalized relative entropies and the capacity of classical-quantum channels
• Group theoretical study of LOCC-detection of maximally entangled state using hypothesis testing
• Quantum target detection using entangled photons
• Distinguishability measures between ensembles of quantum states
• Bound on trace distance based on superfidelity
• Quantum Illumination