Related papers: Exponential quantum communication reductions from …
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…
In this paper we consider an application of the recently proposed quantum hashing technique for computing Boolean functions in the quantum communication model. The combination of binary functions on non-binary quantum hash function is done…
We present a scheme for quantum communication, where a set of EPR pairs, initially shared by the sender Alice and the receiver Bob, functions as a quantum channel. After insuring the safety of the quantum channel, Alice applies local…
A new paradigm for secure communication, based on quantum illumination, is proposed. Alice uses spontaneous parametric down-conversion to send Bob a set of signal modes over a pure-loss channel while retaining the set of idler modes with…
We present and experimentally demonstrate a communication protocol that employs shared entanglement to reduce errors when sending a bit over a particular noisy classical channel. Specifically, it is shown that, given a single use of this…
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…
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 study nondeterministic quantum algorithms for Boolean functions f. Such algorithms have positive acceptance probability on input x iff f(x)=1. In the setting of query complexity, we show that the nondeterministic quantum complexity of a…
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…
We present a quantum secure direct communication scheme achieved by swapping quantum entanglement. In this scheme a set of ordered Einstein-Podolsky-Rosen (EPR) pairs is used as a quantum information channel for sending secret messages…
We prove an optimal $\Omega(n)$ lower bound on the randomized communication complexity of the much-studied Gap-Hamming-Distance problem. As a consequence, we obtain essentially optimal multi-pass space lower bounds in the data stream model…
In this paper we consider the following question: how many bits of classical communication and shared random bits are necessary to simulate a quantum protocol involving Alice and Bob where they share k entangled quantum bits and do not…
The classical theories of communication rely on the assumption that there has to be a flow of particles from Bob to Alice in order for him to send a message to her. We develop a quantum protocol that allows Alice to perceive Bob's message…
Entanglement is the cornerstone of quantum communication, yet conventional detection relies solely on local measurements. In this work, we present a unified theoretical and experimental framework demonstrating that one-way local operations…
We define a new model of quantum learning that we call Predictive Quantum (PQ). This is a quantum analogue of PAC, where during the testing phase the student is only required to answer a polynomial number of testing queries. We demonstrate…
The hidden shift problem is a natural place to look for new separations between classical and quantum models of computation. One advantage of this problem is its flexibility, since it can be defined for a whole range of functions and a…
Equality and disjointness are two of the most studied problems in communication complexity. They have been studied for both classical and also quantum communication and for various models and modes of communication. Buhrman et al. [Buh98]…
We presen a secure direct communication protocol by using step-split Einstein-Podolsky-Rosen (EPR) pair. In this communication protocol, Alice first sends one qubit of an EPR pair to Bob. Bob sends a receipt signal to Alice through public…
In this paper we present the following quantum compression protocol: P : Let $\rho,\sigma$ be quantum states such that $S(\rho || \sigma) = \text{Tr} (\rho \log \rho - \rho \log \sigma)$, the relative entropy between $\rho$ and $\sigma$, is…
We define a quantum model for multiparty communication complexity and prove a simulation theorem between the classical and quantum models. As a result of our simulation, we show that if the quantum k-party communication complexity of a…