Related papers: Error exponents for entanglement transformations f…
The problem of channel coding with the erasure option is revisited for discrete memoryless channels. The interplay between the code rate, the undetected and total error probabilities is characterized. Using the information spectrum method,…
We provide rigorous, efficiently computable and tight bounds on the average error probability of multiple-copy discrimination between qubit mixed states by Local Operations assisted with Classical Communication (LOCC). In contrast to the…
This paper considers the problem of channel coding with a given (possibly suboptimal) maximum-metric decoding rule. A cost-constrained random-coding ensemble with multiple auxiliary costs is introduced, and is shown to achieve error…
Some new results are derived concerning random coding error exponents and expurgated exponents for list decoding with a deterministic list size $L$. Two asymptotic regimes are considered, the fixed list-size regime, where $L$ is fixed…
We studied pure state transformations using local operations assisted by finitely many rounds of classical communication ($LOCC_{\mathbb{N}}$) in C. Spee, J.I. de Vicente, D. Sauerwein, B. Kraus, arXiv:1606.04418 (2016). Here, we first of…
For the information transmission over a binary symmetric channel the random coding is used. The transmission of exponential number of messages is considered. The exact decoding error probability exponent is derived. The proof is based on…
Entanglement is among the most fundamental-and at the same time puzzling-properties of quantum physics. Its modern description relies on a resource-theoretical approach, which treats entangled systems as a means to enable or accelerate…
We show that two ways of manipulation of quantum entanglement, namely, entanglement-assisted local transformation [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. {\bf 83}, 3566 (1999)] and multiple-copy transformation [S. Bandyopadhyay, V.…
We consider the one helper source coding problem posed and investigated by Ahlswede, K\"orner and Wyner. In this system, the error probability of decoding goes to one as the source block length $n$ goes to infinity. This implies that we…
This paper studies majorization of high tensor powers of finitely supported probability distributions. Viewing probability distributions as a resource with majorization as a means of transformation corresponds to the resource theory of pure…
We develop an asymptotic theory of estimation of a shift parameter in a pure quantum state to study the relation between entangled and unentangled covariant estimates in the analytically most transparent way. After recollecting basics of…
In this paper, we treat an asymptotic hypothesis testing (or state discrimination with asymmetric treatment of errors) between an arbitrary fixed bipartite pure state and the completely mixed state by one-way LOCC, two-way LOCC, and…
An optimal local conversion strategy between any two pure states of a bipartite system is presented. It is optimal in that the probability of success is the largest achievable if the parties which share the system, and which can communicate…
The problem of variable-rate lossless data compression is considered, for codes with and without prefix constraints. Sharp bounds are derived for the best achievable compression rate of memoryless sources, when the excess-rate probability…
In an effort to simplify the classification of pure entangled states of multi (m) -partite quantum systems, we study exactly and asymptotically (in n) reversible transformations among n'th tensor powers of such states (ie n copies of the…
Discrete random probability measures are a key ingredient of Bayesian nonparametric inferential procedures. A sample generates ties with positive probability and a fundamental object of both theoretical and applied interest is the…
This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…
Entanglement is a resource to overcome the natural restriction of operations used for state manipulation to Local Operations assisted by Classical Communication (LOCC). Hence, a bipartite maximally entangled state is a state which can be…
Let (\{| \psi> ,| \phi>}) be an incomparable pair of states ((| \psi \nleftrightarrow | \phi>)), \emph, i.e., (| \psi>) and (| \phi>) cannot be transformed to each other with probability one by local transformations and classical…
The quantum dichotomies problem asks at what rate one pair of quantum states can be approximately mapped into another pair of quantum states. In the many copy limit and for vanishing error, the optimal rate is known to be given by the ratio…