Quantum Network Discrimination

Abstract

Discrimination between objects, in particular quantum states, is one of the most fundamental tasks in (quantum) information theory. Recent years have seen significant progress towards extending the framework to point-to-point quantum channels. However, with technological progress the focus of the field is shifting to more complex structures: Quantum networks. In contrast to channels, networks allow for intermediate access points where information can be received, processed and reintroduced into the network. In this work we study the discrimination of quantum networks and its fundamental limitations. In particular when multiple uses of the network are at hand, the rooster of available strategies becomes increasingly complex. The simplest quantum network that capturers the structure of the problem is given by a quantum superchannel. We discuss the available classes of strategies when considering $n$ copies of a superchannel and give fundamental bounds on the asymptotically achievable rates in an asymmetric discrimination setting. Furthermore, we discuss achievability, symmetric network discrimination, the strong converse exponent, generalization to arbitrary quantum networks and finally an application to an active version of the quantum illumination problem.

39 pages, 1 Table, 9 Figures incl. 1 Animation. v2: Several improvements and clarifications. Version accepted for publication

References in corpus (10)

• The Quantum Chernoff Bound
• Transforming quantum operations: quantum supermaps
• The Chernoff lower bound for symmetric quantum hypothesis testing
• Fundamental bound on the reliability of quantum information transmission
• On the strong converses for the quantum channel capacity theorems
• Strict hierarchy between parallel, sequential, and indefinite-causal-order strategies for channel discrimination
• Usefulness of adaptive strategies in asymptotic quantum channel discrimination
• Minimal computational-space implementation of multi-round quantum protocols
• Simple upper and lower bounds on the ultimate success probability for discriminating arbitrary finite-dimensional quantum processes
• From asymptotic hypothesis testing to entropy inequalities

Cited by in corpus (5)

• Universal bounds for quantum metrology in the presence of correlated noise
• Cone-Restricted Information Theory
• Fundamental limitations on the recoverability of quantum processes
• The Min-Entropy of Classical-Quantum Combs for Measurement-Based Applications
• Classical communication cost of a bipartite quantum channel assisted by non-signalling correlations