Related papers: Strong converse bounds in quantum network informat…
We consider the transmission of classical information through a degraded broadcast channel, whose outputs are two quantum systems, with the state of one being a degraded version of the other. Yard et al. proved that the capacity region of…
We use the smooth entropy approach to treat the problems of binary quantum hypothesis testing and the transmission of classical information through a quantum channel. We provide lower and upper bounds on the optimal type II error of quantum…
We present a controlled quantum teleportation protocol. In the protocol, quantum information of an unknown state of a 2-level particle is faithfully transmitted from a sender (Alice) to a remote receiver (Bob) via an initially shared…
We consider the problem of bi-directional controlled quantum teleportation of information encoded in phase opposite coherent state among two distant partners Alice and Bob, with the consent of controller, Charlie. We use five-mode…
Information about an unknown quantum state can be encoded in weak values of projectors belonging to a complete eigenbasis. We present a protocol that enables one party -- Bob -- to remotely determine the weak values corresponding to weak…
Strong converse theorems refer to the study of impossibility results in information theory. In particular, Mosonyi and Ogawa established a one-shot strong converse bound for quantum hypothesis testing [Comm. Math. Phys, 334(3), 2014], which…
Quantum entanglement can be used in a communication scheme to establish a correlation between successive channel inputs that is impossible by classical means. It is known that the classical capacity of quantum channels can be enhanced by…
Assume Alice and Bob share some bipartite $d$-dimensional quantum state. A well-known result in quantum mechanics says that by performing two-outcome measurements, Alice and Bob can produce correlations that cannot be obtained locally,…
We investigate dense coding by imposing various locality restrictions to our decoder by employing the resource theory of asymmetry framework. In this task, the sender Alice and the receiver Bob share an entangled state. She encodes the…
We consider the problem of quantum measurement compression with side information in the one-shot setting with shared randomness. In this problem, Alice shares a pure state with Reference and Bob and she performs a measurement on her…
A fundamental problem in statistics and learning theory is to test properties of distributions. We show that quantum computers can solve such problems with significant speed-ups. In particular, we give fast quantum algorithms for testing…
In their seminal work, Bennett et al. [IEEE Trans. Inf. Theory (2002)] showed that, with sufficient shared randomness, one noisy channel can simulate another at a rate equal to the ratio of their capacities. We establish that when coding…
In this paper, we propose a method of enciphering quantum states of two-state systems (qubits) for sending them in secrecy without entangled qubits shared by two legitimate users (Alice and Bob). This method has the following two…
The max-relative entropy and the conditional min-entropy it induces have become central to one-shot information theory. Both may be expressed in terms of a conic program over the positive semidefinite cone. Recently, it was shown that the…
In this paper, we consider the standard quantum information decoupling, in which Alice aims to decouple her system from the environment by local operations and discarding some of her systems. To achieve an $\varepsilon$-decoupling with…
We introduce the concept of mutual independence -- correlations shared between distant parties which are independent of the environment. This notion is more general than the standard idea of a secret key -- it is a fully quantum and more…
In this work we consider a quantum generalization of the task considered by Slepian and Wolf [1973] regarding distributed source compression. In our task Alice, Bob, Charlie and Reference share a joint pure state. Alice and Bob wish to send…
Alice can distribute a quantum state $|\phi>$ to $N$ spatially separated parties(say Bobs) by telecloning. It is possible for Charlie to reconstruct the quantum state to him if he shares same kind of telecloning quantum channel with Bobs…
Alice communicates with words drawn uniformly amongst $\{\ket{j}\}_{j=1..n}$, the canonical orthonormal basis. Sometimes however Alice interleaves quantum decoys $\{\frac{\ket{j}+i\ket{k}}{\sqrt{2}}\}$ between her messages. Such pairwise…
Consider many instances of an arbitrary quadripartite pure state of four quantum systems ABCD. Alice holds the AC part of each state, Bob holds B, while D represents all other parties correlated with ABC. Alice is required to redistribute…