We extend the definition of the conditional min-entropy from bipartite quantum states to
bipartite quantum channels. We show that many of the properties of the conditional min …

It is well known that for the discrimination of classical and quantum channels in the finite,
non-asymptotic regime, adaptive strategies can give an advantage over non-adaptive …

The chain rule for the classical relative entropy ensures that the relative entropy between
probability distributions on multipartite systems can be decomposed into a sum of relative …

Adaptiveness is a key principle in information processing including statistics and machine
learning. We investigate the usefulness adaptive methods in the framework of asymptotic …

Dephasing is a prominent noise mechanism that afflicts quantum information carriers, and it
is one of the main challenges toward realizing useful quantum computation, communication …

We address the problem of unambiguous discrimination of quantum channels (UDQC)
without entanglement. As our main result, we show that even in the absence of …

We investigate the usefulness of side entanglement in discriminating between two generic
qubit channels, up to unitary pre-and post-processing, and determine exact conditions under …

Quantum memories are a crucial precondition in many protocols for processing quantum
information. A fundamental problem that illustrates this statement is given by the task of …

Given an operator system SS, we define the parameters rk (S) r_k(S) (resp. dk (S) d_k(S))
defined as the maximal value of the completely bounded norm of a unital kk‐positive map …

We analyze a discrimination problem of a single-qubit unitary gate with two candidates,
where the candidates are not provided with their classical description, but their quantum …