
Amortized Channel Divergence for Asymptotic Quantum Channel Discrimination
It is well known that for the discrimination of classical and quantum ch...
read it

𝒫𝒯Symmetric Quantum State Discrimination for Attack on BB84 Quantum Key Distribution
Quantum Key Distribution or QKD provides symmetric key distribution usin...
read it

When are Adaptive Strategies in Asymptotic Quantum Channel Discrimination Useful?
We present a broad investigation of asymptotic binary hypothesis testing...
read it

Ultimate limits for multiple quantum channel discrimination
Quantum hypothesis testing is a central task in the entire field of quan...
read it

Ultimate Limits of Thermal Imaging
Quantum Channel Discrimination (QCD) presents a fundamental task in quan...
read it

Geometric distinguishability measures limit quantum channel estimation and discrimination
Quantum channel estimation and discrimination are fundamentally related ...
read it

Bipartite discrimination of independently prepared quantum states: revival of distinguishability with entanglement
For distinguishing quantum states sampled from a fixed ensemble, the gap...
read it
Quantum Network Discrimination
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 pointtopoint 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.
READ FULL TEXT
Comments
There are no comments yet.