Related papers: Clean quantum and classical communication protocol…
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…
We address the question of efficient implementation of quantum protocols, with small communication and entanglement, and short depth circuit for encoding or decoding. We introduce two new methods to achieve this, the first method involving…
A novel communication protocol based on an entangled pair of qubits is presented, allowing secure direct communication from one party to another without the need for a shared secret key. Since the information is transferred in a…
We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of particles in an entangled quantum state. We prove linear lower bounds for…
The scheduling problem consists of finding a common 1 in two remotely located N bit strings. Denote the number of 1s in the string with the fewer 1s by epsilon*N. Classically, it needs at least O(epsilon*N) bits of communication to find the…
We present a protocol for encoding $N$ real numbers stored in $N$ memory registers into the amplitudes of the quantum superposition that describes the state of $\log_2N$ qubits. This task is one of the main steps in quantum machine learning…
In this article, we introduce a generalization of one-way superdense coding to two-way communication protocols for transmitting classical bits by using entangled quantum pairs. The proposed protocol jointly addresses the provision of…
We study the simultaneous message passing (SMP) model of communication complexity, for the case where one party is quantum and the other is classical. We show that in an SMP protocol that computes some function with the first party sending…
Quantum mechanics allows operations to be in indefinite causal order. Recently there have been active discussions on enhanced communication strategies through exotic causal structures. In light of this, through the process matrix formalism,…
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing settings. For every k, we demonstrate a relational communication…
We consider general prepare-and-measure scenarios in which Alice can transmit qubit states to Bob, who can perform general measurements in the form of positive operator-valued measures (POVMs). We show that the statistics obtained in any…
We prove that there is a trade-off relation between the entanglement cost and the number of rounds of communication, for two distant parties to accomplish a bidirectional quantum information task by local operations and classical…
The quantum cost is a key ingredient to evaluate the quality of quantum protocols from a practical viewpoint. We show that the quantum cost of d-dimensional dense coding protocol is equal to d+3 when transmitting the classical message…
This paper considers a problem of quantum communication between parties that are connected through a network of quantum channels. The model in this paper assumes that there is no prior entanglement shared among any of the parties, but that…
We analyze utility of communication channels in absence of any short of quantum or classical correlation shared between the sender and the receiver. To this aim, we propose a class of two-party communication games, and show that the games…
We consider the problem of transmitting classical and quantum information reliably over an entanglement-assisted quantum channel. Our main result is a capacity theorem that gives a three-dimensional achievable rate region. Points in the…
Superdense coding proved that entanglement-assisted quantum communications can improve the data transmission rates compared to classical systems. It allows sending 2 classical bits between the parties in exchange of 1 quantum bit and a…
We give trade-offs between classical communication, quantum communication, and entanglement for processing information in the Shannon-theoretic setting. We first prove a unit-resource capacity theorem that applies to the scenario where only…
Entanglement bits or ``ebits'' have been proposed as a quantitative measure of a fundamental resource in quantum information processing. For such an interpretation to be valid, it is important to show that the same number of ebits in…
The process of state preparation, its transmission and subsequent measurement can be classically simulated through the communication of some amount of classical information. Recently, we proved that the minimal communication cost is the…