Related papers: Quantum versus classical simultaneity in communica…

We define a new notion of information cost for quantum protocols, and a corresponding notion of quantum information complexity for bipartite quantum channels, and then investigate the properties of such quantities. These are the fully…

Quantum states can in a sense be thought of as generalizations of classical probability distributions, but are more powerful than probability distributions when used for computation or communication. Quantum speedup therefore requires some…

The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating the process of preparation, transmission through the channel, and subsequent measurement of a quantum…

Secure communication based on message encryption might be performed by combining the message with controlled noise (called pseudo-noise) as performed in Spread-Spectrum communication used presently in Wi-Fi and Smartphone Telecommunication…

This thesis establishes a number of connections between foundational issues in quantum theory, and some quantum information applications. It starts with a review of quantum contextuality and non-locality, multipartite entanglement…

Classical-quantum coexistence enables cost-effective transmission of data and quantum signals over the same fiber-optic channel. Nevertheless, weak quantum-key distribution (QKD) signals are susceptible to non-linear interference generated…

We study a model of communication complexity that encompasses many well-studied problems, including classical and quantum communication complexity, the complexity of simulating distributions arising from bipartite measurements of shared…

A quantum algorithm succeeds not because the superposition principle allows 'the computation of all values of a function at once' via 'quantum parallelism,' but rather because the structure of a quantum state space allows new sorts of…

We study the amount of classical communication needed for distributed quantum information processing. In particular, we introduce the concept of "remote preparation" of a quantum state. Given an ensemble of states, Alice's task is to help…

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…

Quantum resources may provide advantage over their classical counterparts. We say this as quantum advantage. Here we consider a single communication task to study different approaches of observing quantum advantage. We say this setting as a…

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…

Classical free-space optical (FSO) communication promises massive data throughput rates relative to traditional wireless technologies - an attractive outcome now being pursued in the context of satellite-ground, inter-satellite and…

We consider communication scenarios with multiple senders and a single receiver. Focusing on communication tasks where the distinguishability or anti-distinguishability of the sender's input is bounded, we show that quantum strategies…

Two dual questions in quantum information theory are to determine the communication cost of simulating a bipartite unitary gate, and to determine their communication capacities. We present a bipartite unitary gate with two surprising…

This work explores entanglement-assisted communication, where quantum entanglement resources enable the transmission of classical information at an enhanced rate. We consider a scenario where entanglement is distributed ahead of time based…

We consider quantum channels with two senders and one receiver. For an arbitrary such channel, we give multi-letter characterizations of two different two-dimensional capacity regions. The first region is comprised of the rates at which it…

Communication complexity, which quantifies the minimum communication required for distributed computation, offers a natural setting for investigating the capabilities and limitations of quantum mechanics in information processing. We…

With unprecedented increases in traffic load in today's wireless networks, design challenges shift from the wireless network itself to the computational support behind the wireless network. In this vein, there is new interest in…

The quantum version of communication complexity allows the two communicating parties to exchange qubits and/or to make use of prior entanglement (shared EPR-pairs). Some lower bound techniques are available for qubit communication…