Related papers: Exponential quantum communication reductions from …

A central question in classical information theory is that of source compression, which is the task where Alice receives a sample from a known probability distribution and needs to transmit it to the receiver Bob with small error. This…

We prove that the fidelity of two exemplary communication complexity protocols, allowing for an N-1 bit communication, can be exponentially improved by N-1 (unentangled) qubit communication. Taking into account, for a fair comparison, all…

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…

We investigate the power of interaction in two player quantum communication protocols. Our main result is a rounds-communication hierarchy for the pointer jumping function $f_k$. We show that $f_k$ needs quantum communication $\Omega(n)$ if…

The polynomial method from circuit complexity has been applied to several fundamental problems and obtains the state-of-the-art running times. As observed in [Alman and Williams, STOC 2017], almost all applications of the polynomial method…

Oblivious transfer is a fundamental cryptographic primitive in which Bob transfers one of two bits to Alice in such a way that Bob cannot know which of the two bits Alice has learned. We present an optimal security bound for quantum…

We consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical…

We present an experiment demonstrating entanglement-enhanced classical communication capacity of a quantum channel with correlated noise. The channel is modelled by a fiber optic link exhibiting random birefringence that fluctuates on a…

We investigate the randomized and quantum communication complexities of the well-studied Equality function with small error probability $\epsilon$, getting optimal constant factors in the leading terms in a number of different models. In…

Hiding the wireless communication by transmitter Alice to intended receiver Bob from a capable and attentive adversary Willie has been widely studied under the moniker "covert communications". However, when such covert communication is done…

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 uncover an apparent instance of classical information transfer via only the Einstein-Podolsky-Rosen channel in a quantum optical protocol between Alice and Bob, involving two-photon maximal path entanglement and based on a recent…

A new conceptual key generation scheme is presented by using intrinsic quantum correlations of single photons between Alice and Bob. The intrinsic bi-partite correlation functions allow key bit to be generated through high level…

Quantum teleportation is a quantum communication primitive that allows a long-distance quantum channel to be built using pre-shared entanglement and one-way classical communication. However, the quality of the established channel crucially…

We consider entanglement-assisted (EA) private communication over a quantum broadcast channel, in which there is a single sender and multiple receivers. We divide the receivers into two sets: the decoding set and the malicious set. The…

We study nondeterministic multiparty quantum communication with a quantum generalization of broadcasts. We show that, with number-in-hand classical inputs, the communication complexity of a Boolean function in this communication model…

A fundamental limitation of quantum communication is that a single qubit can carry at most 1 bit of classical information. For an important class of quantum communication channels, known as entanglement-breaking, this limitation holds even…

An open problem in communication complexity proposed by several authors is to prove that for every Boolean function f, the task of computing f(x AND y) has polynomially related classical and quantum bounded-error complexities. We solve a…

Bell's theorem implies that the outcomes of local measurements on two maximally entangled systems cannot be simulated without classical communication between the parties. The communication cost is finite for n Bell states, but it grows…

We present a quantum communication protocol which keeps all the properties of the ping-pong protocol [Phys. Rev. Lett. 89, 187902 (2002)] but improves the capacity doubly as the ping-pong protocol. Alice and Bob can use the variable…