Related papers: Error exponents for entanglement transformations f…
We study quantum hypothesis testing between orthogonal states under restricted local measurements in the many-copy scenario. For testing arbitrary multipartite entangled pure state against its orthogonal complement state via the local…
We prove that sufficiently many copies of a bipartite entangled pure state can always be transformed into some copies of another one with certainty by local quantum operations and classical communication. The efficiency of such a…
This paper establishes the exact strong converse exponent of the soft covering problem in the classical setting. This exponent characterizes the slowest achievable convergence speed of the total variation to one when a code of rate below…
Suppose that two distant parties Alice and Bob share an entangled state $\rho_{AB}$, and they want to exchange the subsystems of $\rho_{AB}$ by local operations and classical communication (LOCC). In general, this LOCC task (i.e. the LOCC…
Understanding multipartite entanglement is a key goal in quantum information. Entanglement in pure states can be characterised by considering transformations under Local Operations assisted by Classical Communication (LOCC). However, it has…
Exponential error bounds achievable by universal coding and decoding are derived for frame-asynchronous discrete memoryless %asynchronous multiple access channels with two senders, via the method of subtypes, a refinement of the method of…
We analyze entanglement swapping (ES) of partially entangled pure states with arbitrary Schmidt rank from the perspective of quantum state discrimination. It is shown that the standard deterministic ES protocol is related with an optimal…
Incomparability of pure bipartite entangled states under deterministic LOCC is a very strange phenomena. We find two possible ways of getting our desired pure entangled state which is incomparable with the given input state, by collective…
In the problem of asymptotic binary i.i.d. state discrimination, the optimal asymptotics of the type I and the type II error probabilities is in general an exponential decrease to zero as a function of the number of samples; the set of…
The error exponent in lossy source coding characterizes the asymptotic decay rate of error probability with respect to blocklength. The Marton's error exponent provides the theoretically optimal bound on this rate. However, computation…
Understanding multipartite entanglement is vital, as it underpins a wide range of phenomena across physics. The study of transformations of states via Local Operations assisted by Classical Communication (LOCC) allows one to quantitatively…
Given two two-qubit pure states characterized by their Schmidt numbers we investigate an optimal strategy to convert the states between themselves with respect to their local unitary invariance. We discuss the efficiency of this…
We consider a broadcast channel with a degraded message set, in which a single transmitter sends a common message to two receivers and a private message to one of the receivers only. The main goal of this work is to find new lower bounds to…
The theory of the asymptotic manipulation of pure bipartite quantum systems can be considered completely understood: The rates at which bipartite entangled states can be asymptotically transformed into each other are fully determined by a…
We discuss the asymptotic behavior of conversions between two independent and identical distributions up to the second-order conversion rate when the conversion is produced by a deterministic function from the input probability space to the…
In this paper, we study the problem of relaying a single bit over a tandem of binary-input channels, with the goal of attaining the highest possible error exponent in the exponentially decaying error probability. Our previous work gave an…
We consider sequential detection based on quantized data in the presence of eavesdropper. Stochastic encryption is employed as a counter measure that flips the quantization bits at each sensor according to certain probabilities, and the…
We study the problem of transforming a set of pure bipartite states into another using deterministic LOCC (local operations and classical communication). Necessary conditions for the existence of such a transformation are obtained using…
Error and erasure exponents for the broadcast channel with degraded message sets are analyzed. The focus of our error probability analysis is on the main receiver where, nominally, both messages are to be decoded. A two-step decoding…
Any deterministic bipartite entanglement transformation involving finite copies of pure states and carried out using local operations and classical communication (LOCC) results in a net loss of entanglement. We show that for almost all such…