Related papers: Multiparty Quantum Communication Complexity
The optimal rate of reliable communication over a quantum channel can be enhanced by pre-shared entanglement. Whereas the enhancement may be unbounded in infinite-dimensional settings even when the input power is constrained, a…
Granting information privacy is of crucial importance in our society, notably in fiber communication networks. Quantum cryptography provides a unique means to establish, at remote locations, identical strings of genuine random bits, with a…
It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability…
This paper addresses the problem of generating a common random string with min-entropy k using an unlimited supply of noisy EPR pairs or quantum isotropic states, with minimal communication between Alice and Bob. The paper considers two…
We study the use of entanglement purification for quantum communication over long distances. For distances much longer than the coherence length of a corresponding noisy quantum channel, the fidelity of transmission is usually so low that…
We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its experimental realization. In this protocol, a secret message is split among several parties in a way that its…
Quantum mechanics allows for situations where the relative order between two processes is entangled with a quantum degree of freedom. Here we show that such entanglement can enhance the ability to transmit quantum information over noisy…
Since the seminal work of Paturi and Simon \cite[FOCS'84 & JCSS'86]{PS86}, the unbounded-error classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently,…
We discuss and generalize multi-particle entanglement based on statistical correlations using Ursell-Mayer type of cluster coefficients. Cluster coefficients are used to distinguish different, independent entangled systems as well as those…
For quantum states of two subsystems, entanglement measures are related to capacities of communication tasks -- highly entangled states give higher capacity of transmitting classical as well as quantum information. However, we show that…
Quantum protocols for secret sharing usually rely on multi-party entanglement which with present technology is very difficult to achieve. Recently it has been shown that sequential manipulation and communication of a single $d-$ level state…
This article summarises the current status of classical communication networks and identifies some critical open research challenges that can only be solved by leveraging quantum technologies. By now, the main goal of quantum communication…
We study universal quantum codes for entanglement-assisted quantum communication over compound quantum channels. In this setting, sender and receiver do not know the specific channel that will be used for communication, but only know the…
Entanglement shared between the two ends of a quantum communication channel has been shown to be a useful resource in increasing both the quantum and classical capacities for these channels. The entanglement-assisted capacities were derived…
Despite the conceptual importance of contextuality in quantum mechanics, there is a hitherto limited number of applications requiring contextuality but not entanglement. Here, we show that for any quantum state and observables of…
We study space-bounded communication complexity for unitary implementation in distributed quantum processors, where we restrict the number of qubits per processor to ensure practical relevance and technical non-triviality. We model…
A quantum network is constructed via maximum entangled coherent states. The possibility of using this network to achieve communication between multi-participants is investigated. We showed that the probability of teleported unknown state…
We introduce new models and new information theoretic measures for the study of communication complexity in the natural peer-to-peer, multi-party, number-in-hand setting. We prove a number of properties of our new models and measures, and…
We study the weakest model of quantum nondeterminism in which a classical proof has to be checked with probability one by a quantum protocol. We show the first separation between classical nondeterministic communication complexity and this…
Like a silver thread, quantum entanglement [1] runs through the foundations and breakthrough applications of quantum information theory. It cannot arise from local operations and classical communication (LOCC) and therefore represents a…