Related papers: Optimal dense coding with arbitrary pure entangled…
We explicate an example of the so called Task oriented Maximally Entangled states (TMES) in the context of teleportation and superdense coding. In physical situation, this state can emerge from decoherence of more entangled state or may be…
Consider a distributed coding for computing problem with constant decoding locality, i.e., with a vanishing error probability, any single sample of the function can be approximately recovered by probing only constant number of compressed…
We study the problem of communication over a compound quantum channel in the presence of entanglement. Classically such channels are modeled as a collection of conditional probability distributions wherein neither the sender nor the…
Quantum teleportation of qudits is revisited. In particular, we analyze the case where the quantum channel corresponds to a non-maximally entangled state and show that the success of the protocol is directly related to the problem of…
We ask whether the optimal probe is entangled, and if so, what is its character and amount, for estimating the noise parameter of a large class of local quantum encoding processes that we refer to as vector encoding, examples of which…
We consider the problems of reaching average consensus and solving consensus-based optimization over unreliable communication networks wherein packets may be dropped accidentally during transmission. Existing work either assumes that the…
A rate-dependent upper bound of the best achievable block error probability of polar codes with successive-cancellation decoding is derived.
Superdense coding proved that entanglement-assisted quantum communications can improve the data transmission rates compared to classical systems. It allows sending 2 classical bits between the parties in exchange of 1 quantum bit and a…
Tensors are a fundamental operation in distributed computing, \emph{e.g.,} machine learning, that are commonly distributed into multiple parallel tasks for large datasets. Stragglers and other failures can severely impact the overall…
This paper studies the stability of communication protocols that deal with transmission errors. We consider a coordination game between an informed sender and an uninformed decision maker, the receiver, who communicate over a noisy channel.…
In this thesis, we are interested in the limits of quantum communication with and without entanglement, and with and without noise assumptions on the communication setup. When a sender and a receiver are connected by a communication line…
We compare remote information concentration by a maximally entangled GHZ state with by an unlockable bound entangled state. We find that the bound entangled state is as useful as the GHZ state, even do better than the GHZ state in the…
We consider entanglement swapping schemes with general (rather than maximally) entangled bipartite states of arbitary dimension shared pairwise between three or more parties in a chain. The intermediate parties perform generalised Bell…
We introduce the notion of entanglement of subspaces as a measure that quantify the entanglement of bipartite states in a randomly selected subspace. We discuss its properties and in particular we show that for maximally entangled subspaces…
We study the entanglement of entangled coherent states in vacuum environment by employing the entanglement of formation and propose a scheme to probabilistically teleport a coherent superposition state via entangled coherent states, in…
Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated.…
Entangled states shared among distant nodes are frequently used in quantum network applications. When quantum resources are abundant, entangled states can be continuously distributed across the network, allowing nodes to consume them…
This paper presents prefix codes which minimize various criteria constructed as a convex combination of maximum codeword length and average codeword length or maximum redundancy and average redundancy, including a convex combination of the…
We find a minimal set of necessary and sufficient conditions for the existence of a local procedure that converts a finite pure state into one of a set of possible final states. This result provides a powerful method for obtaining optimal…
Low probability of detection (or covert) communication refers to the scenario where information must be sent reliably to a receiver, but with low probability of detection by an adversary. Recent works on the fundamental limits of this…