Related papers: Distributed inner product estimation with limited …
We initiate the study of quantifying nonlocalness of a bipartite measurement by the minimum amount of classical communication required to simulate the measurement. We derive general upper bounds, which are expressed in terms of certain…
The growing demands of remote detection and increasing amount of training data make distributed machine learning under communication constraints a critical issue. This work provides a communication-efficient quantum algorithm that tackles…
In this paper, we design the first computationally efficient codes for simultaneously reliable and covert communication over Binary Symmetric Channels (BSCs). Our setting is as follows: a transmitter Alice wishes to potentially reliably…
The no-broadcasting theorem, a fundamental limitation on the communication of quantum information, holds that a physical process cannot broadcast copies of an unknown quantum state to two or more receivers. Recent work has explored ways of…
We propose a new scheme in which perfect transmission of 1-qubit information is achieved with high success using purposefully delayed sharing of non-maximally entangled 2-qubit resource and repeated generalized Bell-state measurements…
We introduce a relativistic version of quantum encryption protocol by considering two inertial observers who wish to securely transmit quantum information encoded in a free scalar quantum field state forming Minkowski particles. In a…
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…
We propose a quantum teleportation scheme for transmitting a single qutrit state by adopting a 2-qudit entangled state as the quantum channel. The measurement basis for Alice has been carefully and systematically constructed, which is…
In the context of quantum communications between two parties (here Alice and Bob), Bob's lack of knowledge about the communications channel can affect the purity of the states that he receives. The operation of applying an unknown unitary…
We discuss sequential unambiguous state-discrimination measurements performed on the same qubit. Alice prepares a qubit in one of two possible states. The qubit is first sent to Bob, who measures it, and then on to Charlie, who also…
The communication complexity of a quantum channel is the minimal amount of classical communication required for classically simulating a process of state preparation, transmission through the channel and subsequent measurement. It…
Since it began \cite{CocconiMorrison}, the search for extraterrestrial intelligence (SETI) has focused on interstellar \emph{classical} communication. Recently, Berera \cite{Berera:2020rpl} pointed out that, at certain frequencies, photon…
Reliable distribution of quantum entanglement over long distances is a central challenge in quantum information science, fundamentally limited by decoherence in noisy communication channels. In this work, we investigate the asymptotic…
We consider the problem of the classical simulation of quantum measurements in the scenario of communication complexity. Regev and Toner (2007) have presented a 2-bit protocol which simulates one particular correlation function arising from…
Here, we study the problem of decoding information transmitted through unknown quantum states. We assume that Alice encodes an alphabet into a set of orthogonal quantum states, which are then transmitted to Bob. However, the quantum channel…
Since the seminal work of Paturi and Simon \cite[FOCS'84 & JCSS'86]{PS86}, the unbounded-error classical communication complexity of a Boolean function has been studied based on the arrangement of points and hyperplanes. Recently,…
In this work we study the problem of communication over the quantum wiretap channel. For this channel there are three parties Alice (sender), Bob (legitimate receiver) and Eve (eavesdropper). We obtain upper and lower bounds on the amount…
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…
Following initial work by Gregoratti and Werner [J. Mod. Optics 50, 913-933, 2003 and quant-ph/0403092] and Hayden and King [quant-ph/0409026], we study the problem of the capacity of a quantum channel assisted by a "friendly (channel)…
We generalize a quantum communication protocol introduced by Bartlett et al. [New. J. Phys. 11, 063013 (2009)] in which two parties communicating do not share a classical reference frame, to the case where changes of their reference frames…