Related papers: A Quantum Multiparty Packing Lemma and the Relay C…
I introduce a framework in which a variety of probabilistic theories can be defined, including classical and quantum theories, and many others. From two simple assumptions, a tensor product rule for combining separate systems can be…
The multivariate covering lemma states that given a collection of $k$ codebooks, each of sufficiently large cardinality and independently generated according to one of the marginals of a joint distribution, one can always choose one…
Distributed computing, involving multiple servers collaborating on designated computations, faces a critical challenge in optimizing inter-server communication -- an issue central to the study of communication complexity. Quantum resources…
In 2018, Renes [IEEE Trans. Inf. Theory, vol. 64, no. 1, pp. 577-592 (2018)] (arXiv:1701.05583) developed a general theory of channel duality for classical-input quantum-output (CQ) channels. That result showed that a number of well-known…
Although a quantum state requires exponentially many classical bits to describe, the laws of quantum mechanics impose severe restrictions on how that state can be accessed. This paper shows in three settings that quantum messages have only…
Recently, a coding technique called position-based coding has been used to establish achievability statements for various kinds of classical communication protocols that use quantum channels. In the present paper, we apply this technique in…
Quantum secret sharing schemes encrypting a quantum state into a multipartite entangled state are treated. The lower bound on the dimension of each share given by Gottesman [Phys. Rev. A \textbf{61}, 042311 (2000)] is revisited based on a…
Classical communications are used in the post-processing procedure of quantum key distribution. Since the security of quantum key distribution is based on the principles of quantum mechanics, intuitively the secret key can only be derived…
We investigates a model of hybrid classical-quantum communication complexity, in which two parties first exchange classical messages and subsequently communicate using quantum messages. We study the trade-off between the classical and…
We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds, which are expressed in terms of certain…
Suppose that $m$ senders want to transmit classical information to $n$ receivers with zero probability of error using a noisy multipartite communication channel. The senders are allowed to exchange classical, but not quantum, messages among…
Given one or more uses of a classical channel, only a certain number of messages can be transmitted with zero probability of error. The study of this number and its asymptotic behaviour constitutes the field of classical zero-error…
The classical problem in network coding theory considers communication over multicast networks. Multiple transmitters send independent messages to multiple receivers which decode the same set of messages. In this work, computation over…
Distribution and distillation of entanglement over quantum networks is a basic task for Quantum Internet applications. A fundamental question is then to determine the ultimate performance of entanglement distribution over a given network.…
We study here the conditions to perform the distribution of a pure state on a quantum network using quantum operations which can succeed with a non-zero probability, the Stochastic Local Operation and Classical Communication (SLOCC)…
We prove that the correlations present in a multipartite quantum state have an \emph{operational} quantum character as soon as the state does not simply encode a multipartite classical probability distribution, i.e. does not describe the…
Completely depolarising channels are often regarded as the prototype of physical processes that are useless for communication: any message that passes through them along a well-defined trajectory is completely erased. When two such channels…
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…
A recent method to certify the classical capacity of quantum communication channels is applied for general damping channels in finite dimension. The method compares the mutual information obtained by coding on the computational and a…
We consider the distribution of secret keys, both in a bipartite and a multipartite (conference) setting, via a quantum network and establish a framework to obtain bounds on the achievable rates. We show that any multipartite private…