Related papers: Expected communication cost of distributed quantum…
A promising platform for semi-device-independent quantum information is prepare-and-measure experiments restricted only by a bound on the energy of the communication. Here, we investigate the role of shared entanglement in such scenarios.…
Capacity of a quantum channel characterizes the limits of reliable communication through a noisy quantum channel. This fundamental information theoretic question is very well studied specially in the setting of many independent uses of the…
We study prepare-and-measure experiments where the sender (Alice) receives trusted quantum inputs but has an untrusted state-preparation device and the receiver (Bob) has a fully-untrusted measurement device. A distributed-sampling task…
We pose a problem called ``broadcasting Holevo-information'': given an unknown state taken from an ensemble, the task is to generate a bipartite state transfering as much Holevo-information to each copy as possible. We argue that upper…
We consider the problem of communication over a channel with a causal jamming adversary subject to quadratic constraints. A sender Alice wishes to communicate a message to a receiver Bob by transmitting a real-valued length-$n$ codeword…
Ask how the quantum compression of ensembles of pure states is affected by the availability of entanglement, and in settings where the encoder has access to side information. We find the optimal asymptotic quantum rate and the optimal…
An important part of the information theory folklore had been about the output statistics of codes that achieve the capacity and how the empirical distributions compare to the output distributions induced by the optimal input in the channel…
The optimal quantum communication cost of computing a classical sum of distributed sources is studied over a quantum erasure multiple access channel (QEMAC). K classical messages comprised of finite-field symbols are distributed across $S$…
We show that every tripartite quantum correlation generated with a Schmidt state (in particular every correlation generated with the GHZ state) can be simulated with the sending of two bits of classical communication from Alice to Bob and…
Quantum teleportation uses prior entanglement and forward classical communication to transmit one instance of an unknown quantum state. Remote state preparation (RSP) has the same goal, but the sender knows classically what state is to be…
Security and privacy are major concerns in modern communication networks. In recent years, the information theory of covert communications, where the very presence of the communication is undetectable to a watchful and determined adversary,…
A fundamental objective in quantum information science is to determine the cost in classical resources of simulating a particular quantum system. The classical simulation cost is quantified by the signaling dimension which specifies the…
A notion of asymmetric quantum dialogue (AQD) is introduced. Conventional protocols of quantum dialogue are essentially symmetric as both the users (Alice and Bob) can encode the same amount of classical information. In contrast, the scheme…
We consider the communication of classical and quantum information between two arbitrary observers in asymptotically flat spacetimes (possibly containing black holes) and investigate what is the energy cost for such information…
Classical and quantum information theory are simply explained. To be more specific it is clarified why Shannon entropy is used as measure of classical information and after a brief review of quantum mechanics it is possible to demonstrate…
We characterize the communication complexity of the following distributed estimation problem. Alice and Bob observe infinitely many iid copies of $\rho$-correlated unit-variance (Gaussian or $\pm1$ binary) random variables, with unknown…
In conventional cryptography, information-theoretically secure message authentication can be achieved by means of universal hash functions, and requires that the two legitimate users share a random secret key, which is twice as long as the…
We consider the problem of teleporting an unknown information state within a quantum network by a sender, say, Alice to any given receiver out of several receivers, say, Bob(1), Bob(2), ...., Bob(n). For this task, we suggest two schemes…
We resume the investigation of the problem of independent local compression of correlated quantum sources, the classical case of which is covered by the celebrated Slepian-Wolf theorem. We focus specifically on classical-quantum (cq)…
We show a lower bound on expected communication cost of interactive entanglement assisted quantum state redistribution protocols and a slightly better lower bound for its special case, quantum state transfer. Our bound implies that the…