Related papers: Optimal dense coding with arbitrary pure entangled…
We study rates asymptotic of transformations between entangled states by local operations and classical communication and a sublinear amount of quantum communication. It is known that additive asymptotically continuous entanglement measures…
For the four-state protocol of quantum key distribution, optimum sets of probe parameters are calculated for the most general unitary probe in which each individual transmitted photon is made to interact with the probe so that the signal…
High-dimensional quantum systems offer a number of advantages in larger information capacity, stronger noise resiliency, higher improved efficiency and accuracy over the qubit systems. In quantum communication the maximally entangled states…
Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is…
We develop a low-complexity polar coding scheme for the discrete memoryless broadcast channel with confidential messages under strong secrecy and randomness constraints. Our scheme extends previous work by using an optimal rate of uniform…
Reliable and low latency multicast communication is important for future vehicular communication. Sparse random linear network coding approach used to ensure the reliability of multicast communication has been widely investigated. A…
We study random linear network coding for broadcasting in time division duplexing channels. We assume a packet erasure channel with nodes that cannot transmit and receive information simultaneously. The sender transmits coded data packets…
Considering pure quantum states, entanglement concentration is the procedure where from $N$ copies of a partially entangled state, a single state with higher entanglement can be obtained. Getting a maximally entangled state is possible for…
A covering code is a set of codewords with the property that the union of balls, suitably defined, around these codewords covers an entire space. Generally, the goal is to find the covering code with the minimum size codebook. While most…
We find the minimum and the maximum value for the local energy of an arbitrary finite bipartite system for any given amount of entanglement, also identifying families of states reaching these bounds and sharing formal analogies with thermal…
We study superdense coding with uniformly accelerated particle in single mode approximation and beyond single mode approximation. We use four different functions, the capacity of superdense coding, negativity, discord and the probability of…
We consider one copy of a quantum system prepared with equal prior probability in one of two non-orthogonal entangled states of multipartite distributed among separated parties. We demonstrate that these two states can be optimally…
Irreversible random sequential deposition of interacting particles is widely used to model aggregation phenomena in physical, chemical, and biophysical systems. We show that in one dimension the exact time dependent solution of such…
If only limited control over a multiparticle quantum system is available, a viable method to characterize correlations is to perform random measurements and consider the moments of the resulting probability distribution. We present…
Decoding sits between a language model and everything we do with it, yet it is still treated as a heuristic knob-tuning exercise. We argue decoding should be understood as a principled optimisation layer: at each token, we solve a…
Empirical coordination offers a way to understand how agents can coordinate actions under communication constraints. This paper investigates the finite blocklength regime of this problem, where the encoder and decoder aim to produce a…
The coordination of autonomous agents is a critical issue for decentralized communication networks. Instead of transmitting information, the agents interact in a coordinated manner in order to optimize a general objective function. A target…
In this paper, we aim to identify the strategies that can maximize and monotonically increase the density of the coding opportunities in instantly decodable network coding (IDNC).Using the well-known graph representation of IDNC, first…
Under two-party deterministic dense-coding, Alice communicates (perfectly distinguishable) messages to Bob via a qudit from a pair of entangled qudits in pure state |Psi>. If |Psi> represents a maximally entangled state (i.e., each of its…
In this paper we provide new compact integral expressions and associated simple asymptotic approximations for converse and achievability bounds in the finite blocklength regime. The chosen converse and random coding union bounds were taken…