Related papers: Clean quantum and classical communication protocol…
The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over…
We show that quantum entanglement can be used as a substitute for communication when the goal is to compute a function whose input data is distributed among remote parties. Specifically, we show that, for a particular function among three…
We revisit the task of visible compression of an ensemble of quantum states with entanglement assistance in the one-shot setting. The protocols achieving the best compression use many more qubits of shared entanglement than the number of…
The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender and receiver) is needed in order to simulate many copies of a quantum channel in the presence of free classical communication. In this…
Quantum resources can be more powerful than classical resources - a quantum computer can solve certain problems exponentially faster than a classical computer, and computing a function of two people's inputs can be done with exponentially…
Classical communication through quantum channels may be enhanced by sharing entanglement. Superdense coding allows the encoding, and transmission, of up to two classical bits of information in a single qubit. In this paper, the maximum…
I present a simple two-party quantum communication complexity protocol with higher success rate than the best possible classical protocol for the same task. The quantum protocol is shown to be equivalent to a quantum non-locality test,…
We propose a class of quantum no-key protocols for private communication of classical message based on quantum computing of random Boolean permutations, and demonstrate that they are information-theoretic secure. These protocols are…
Quantum resources, such as entanglement or quantum communication, offer significant communication advantages in information processing. We develop an operational framework for realizing these communication advantages in resource-constrained…
We formulate a two-party communication complexity problem and present its quantum solution that exploits the entanglement between two qutrits. We prove that for a broad class of protocols the entangled state can enhance the efficiency of…
We study the fundamental, classical mechanism design problem of single-buyer multi-item Bayesian revenue-maximizing auctions under the lens of communication complexity between the buyer and the seller. Specifically, we ask whether using…
Encoding schemes and error-correcting codes are widely used in information technology to improve the reliability of data transmission over real-world communication channels. Quantum information protocols can further enhance the performance…
After carrying out a protocol for quantum key agreement over a noisy quantum channel, the parties Alice and Bob must process the raw key in order to end up with identical keys about which the adversary has virtually no information. In…
In this paper, we study the number of rounds of communication needed to implement certain tasks by local quantum operations and classical communication (LOCC). We find that the class of LOCC operations becomes strictly more powerful as more…
Shared entanglement is a resource available to parties communicating over a quantum channel, much akin to public coins in classical communication protocols. Whereas shared randomness does not help in the transmission of information, or…
We analyse the use of entangled states to perform quantum computations non locally among distant nodes in a quantum network. The complexity associated with the generation of multiparticle entangled states is quantified in terms of the…
We study the activation of entanglement in teleportation protocols. To this end, we a present derivation of the average fidelity of teleportation process with noisy classical channel for qudits. In our work we do not make any assumptions…
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…
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is…
In most communication scenarios, sending a symbol encoded in a quantum state requires spending resources such as energy, which can be quantified by a cost of communication. A standard approach in this context is to quantify the performance…