When is the Chernoff Exponent for Quantum Operations Finite?

DOI10.1109/TIT.2021.3067924MaRDI QIDQ5001807zbMATH OpenOpenAlexFDO

Authors Nengkun Yu, Li Zhou

Publication date 23 July 2021

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1705.01642

zbMATH Keywords

Chernoff exponentquantum operationsupper bounds

Mathematics Subject Classification ID

Quantum information, communication, networks (quantum-theoretic aspects) (81P45) Channel models (including quantum) in information and communication theory (94A40)

Abstract: We consider the problem of testing two hypotheses of quantum operations in a setting of many uses where an arbitrary prior probability distribution is given. The Chernoff exponent for quantum operations is investigated to track the minimal average error probability of discriminating two quantum operations asymptotically. We answer the question, "When is the Chernoff exponent for quantum operations finite?" We show that either two quantum operations can be perfectly distinguished with finite uses, or the minimal discrimination error decays exponentially with respect to the number of uses asymptotically. That is, the Chernoff exponent is finite if and only if the quantum operations can not be perfectly distinguished with finite uses. This rules out the possibility of super-exponential decay of error probability. Upper bounds of the Chernoff exponent for quantum operations are provided.

Cited in

(2)

• Discrimination of quantum states under locality constraints in the many-copy setting
• When are quantum systems operationally independent?

This page was built for publication: When is the Chernoff Exponent for Quantum Operations Finite?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5001807)