Related papers: A Sufficient Criterion for Divisibility of Quantum…
We present a criterion of separability for arbitrary s partitions of N-particle fermionic pure states. We show that, despite the superficial non-factorizability due to the antisymmetry required by the indistinguishability of the particles,…
We study binary discrimination of idempotent quantum channels. When the two channels share a common full-rank invariant state, we show that a simple image inclusion condition completely determines the asymptotic behavior: when it holds, a…
In this paper, we obtain results for factorizability of quantum channels. Firstly, we prove that if a tensor $T\otimes S_k$ of a quantum channel $T$ on $M_n(\mathbb{C})$ with the completely depolarizing channel $S_k$ is written as a convex…
A discrimination problem consists of $N$ linearly independent pure quantum states $\Phi=\{\ket{\phi_i}\}$ and the corresponding occurrence probabilities $\eta=\{\eta_i\}$. To any such problem we associate, up to a permutation over the…
In the problem of quantum channel discrimination, one distinguishes between a given number of quantum channels, which is done by sending an input state through a channel and measuring the output state. This work studies applications of…
Quantum channels, a subset of quantum maps, describe the unitary and non-unitary evolution of quantum systems. We study a generalization of the concept of Pauli maps to the case of multipartite high dimensional quantum systems through the…
We present separability criteria for both bipartite and multipartite quantum states. These criteria include the criteria based on the correlation matrix and its generalized form as special cases. We show by detailed examples that our…
We consider bistochastic quantum channels generated by unitary representations of the discret group. The proof of the additivity conjecture for the quantum depolarizing channel $\Phi$ based on the decreasing property of the relative entropy…
Quantum channel discrimination has been studied from an information-theoretic perspective, wherein one is interested in the optimal decay rate of error probabilities as a function of the number of unknown channel accesses. In this paper, we…
We develop a device-independent framework for testing quantum channels. That is, we falsify a hypothesis about a quantum channel based only on an observed set of input-output correlations. Formally, the problem consists of characterizing…
We consider the problem of quantum channel certification to unitary, where one is given access to an unknown $d$-dimensional channel $\mathcal{E}$, and wants to test whether $\mathcal{E}$ is equal to a target unitary channel or is…
We propose a general method to operationally quantify the resourcefulness of quantum channels via channel discrimination, an important information processing task. A main result is that the maximum success probability of distinguishing a…
We study the limitations of deterministic programmability of quantum circuits, e.g., quantum computer. More precisely, we analyse the programming of quantum observables and channels via quantum multimeters. We show that the programming…
Given any pair of quantum channels $\Phi_1,\Phi_2$ such that at least one of them has Kraus rank one, as well as any respective Stinespring isometries $V_1,V_2$, we prove that there exists a unitary $U$ on the environment such that…
We establish the necessary and sufficient conditions for unbiased estimation in multi-parameter estimation tasks. More specifically, we first consider quantum state estimation, where multiple parameters are encoded in a quantum state, and…
Quantum channels depending on a number of classical control parameters are considered. Assuming the stochastic fluctuations of the control parameters in the small errors limit it is shown that the channel fidelity is equal to the average…
We introduce a new quantum noise deconvolution technique that does not rely on the complete knowledge of noise and does not require partial noise tomography. In this new method, we construct a set of observables with completely correctable…
Let $\Phi$ be a trace-preserving, positivity-preserving (but not necessarily completely positive) linear map on the algebra of complex $2 \times 2$ matrices, and let $\Omega$ be any finite-dimensional completely positive map. For $p=2$ and…
In our previous work, we presented the \emph{Hypothesis Testing Lemma}, a key tool that establishes sufficient conditions for the existence of good deterministic identification (DI) codes for memoryless channels with finite output, but…
Very simple sufficient conditions for the irreducibility of $f(X^n)$ over an arbitrary unique factorization domain $Z$ are established via a generalization of a well known theorem of A. Capelli.