On the optimal error exponents for classical and quantum antidistinguishability

Abstract

The concept of antidistinguishability of quantum states has been studied to investigate foundational questions in quantum mechanics. It is also called quantum state elimination, because the goal of such a protocol is to guess which state, among finitely many chosen at random, the system is not prepared in (that is, it can be thought of as the first step in a process of elimination). Antidistinguishability has been used to investigate the reality of quantum states, ruling out $\psi$-epistemic ontological models of quantum mechanics [Pusey et al., Nat. Phys., 8(6):475-478, 2012]. Thus, due to the established importance of antidistinguishability in quantum mechanics, exploring it further is warranted. In this paper, we provide a comprehensive study of the optimal error exponent -- the rate at which the optimal error probability vanishes to zero asymptotically -- for classical and quantum antidistinguishability. We derive an exact expression for the optimal error exponent in the classical case and show that it is given by the multivariate classical Chernoff divergence. Our work thus provides this divergence with a meaningful operational interpretation as the optimal error exponent for antidistinguishing a set of probability measures. For the quantum case, we provide several bounds on the optimal error exponent: a lower bound given by the best pairwise Chernoff divergence of the states, a single-letter semi-definite programming upper bound, and lower and upper bounds in terms of minimal and maximal multivariate quantum Chernoff divergences. It remains an open problem to obtain an explicit expression for the optimal error exponent for quantum antidistinguishability.

48 pages, submission to the journal special issue honoring Mary Beth Ruskai

References in corpus (21)

• On the reality of the quantum state
• General Entanglement Breaking Channels
• From Classical to Quantum Shannon Theory
• Is the quantum state real? An extended review of $\psi$-ontology theorems
• The Chernoff lower bound for symmetric quantum hypothesis testing
• Quantum hypothesis testing and the operational interpretation of the quantum Renyi relative entropies
• Inequalities for Quantum Entropy: A Review with Conditions for Equality
• On the quantum Renyi relative entropies and related capacity formulas
• Realization of Quantum Digital Signatures without the requirement of quantum memory
• No $\psi$-epistemic model can fully explain the indistinguishability of quantum states
• Correlation Detection and an Operational Interpretation of the Renyi Mutual Information
• Conditions for compatibility of quantum state assignments
• Different quantum f-divergences and the reversibility of quantum operations
• Conclusive Exclusion of Quantum States
• A limit of the quantum Renyi divergence
• Geometric distinguishability measures limit quantum channel estimation and discrimination
• Antidistinguishability of Pure Quantum States
• Noncontextuality Inequalities from Antidistinguishability
• Simple Communication Complexity Separation from Quantum State Antidistinguishability
• Monotonic multi-state quantum $f$-divergences
• A note on the inner products of pure states and their antidistinguishability

Cited by in corpus (8)

• Tight bounds for antidistinguishability and circulant sets of pure quantum states
• Operational Interpretation of the Choi Rank Through k-State Exclusion
• An invitation to the sample complexity of quantum hypothesis testing
• Multivariate Fidelities
• Matrix Majorization in Large Samples with Varying Support Restrictions
• The pretty bad measurement
• Quantum state exclusion for group-generated ensembles of pure states
• How contextuality and antidistinguishability are related