Related papers: Communication complexity of entanglement assisted …
We present a general technique for hiding a classical bit in multipartite quantum states. The hidden bit, encoded in the choice of one of two possible density operators, cannot be recovered by local operations and classical communication…
A natural operational paradigm for distributed quantum and classical information processing involves local operations coordinated by multiple rounds of public communication. In this paper we consider the minimum number of communication…
I present a simple two-party quantum communication complexity protocol with higher success rate than the best possible classical protocol for the same task. The quantum protocol is shown to be equivalent to a quantum non-locality test,…
Communication complexity problems (CCPs) are tasks in which separated parties attempt to compute a function whose inputs are distributed among the parties. Their communication is limited so that not all inputs can be sent. We show that…
In this paper we show that, given $k\geq 3$, there exist $k$-player quantum XOR games for which the entangled bias can be arbitrarily larger than the bias of the game when the players are restricted to separable strategies. In particular,…
In this letter we show that communication when restricted to a single information carrier (i.e. single particle) and finite speed of propagation is fundamentally limited for classical systems. On the other hand, quantum systems can surpass…
Dense coding is the seminal example of how entanglement can boost qubit communication, from sending one bit to sending two bits. This is made possible by projecting separate particles onto a maximally entangled basis. We investigate more…
Recently developed quantum algorithms suggest that quantum computers can solve certain problems and perform certain tasks more efficiently than conventional computers. Among other reasons, this is due to the possibility of creating…
We give an example of a wide class of problems for which quantum information protocols based on multi-system entanglement can be mapped into much simpler ones involving one system. Secret sharing is a cryptographic primitive which plays a…
A process of preparation, transmission and subsequent projective measurement of a qubit can be simulated by a classical model with only two bits of communication and some amount of shared randomness. However no model for n qubits with a…
A promising platform for semi-device-independent quantum information is prepare-and-measure experiments restricted only by a bound on the energy of the communication. Here, we investigate the role of shared entanglement in such scenarios.…
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…
Classical computation relies heavily on information manipulation. Each component of a hardware needs to communicate with others, and this is done by encoding information into strings of bits and application of logical operations. When…
A common scenario in distributed computing involves a client who asks a server to perform a computation on a remote computer. An important problem is to determine the minimum amount of communication needed to specify the desired…
Quantum teleportation allows one to transmit an arbitrary qubit from point A to point B using a pair of (pre-shared) entangled qubits and classical bits of information. The conventional protocol for teleportation uses two bits of classical…
We study the fundamental, classical mechanism design problem of single-buyer multi-item Bayesian revenue-maximizing auctions under the lens of communication complexity between the buyer and the seller. Specifically, we ask whether using…
A basic goal in complexity theory is to understand the communication complexity of number-on-the-forehead problems $f\colon(\{0,1\}^n)^{k}\to\{0,1\}$ with $k\gg\log n$ parties. We study the problems of inner product and set disjointness and…
Two parties observing correlated random variables seek to run an interactive communication protocol. How many bits must they exchange to simulate the protocol, namely to produce a view with a joint distribution within a fixed statistical…
Bipartite operations underpin both classical communication and entanglement generation. Using a superposition of classical messages, we show that the capacity of a two-qubit operation for error-free entanglement-assisted bidirectional…
We investigate definitions of and protocols for multi-party quantum computing in the scenario where the secret data are quantum systems. We work in the quantum information-theoretic model, where no assumptions are made on the computational…