Related papers: Classical Interaction Cannot Replace a Quantum Mes…
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…
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 consider interactive coding in a setting where $n$ parties wish to compute a joint function of their inputs via an interactive protocol over imperfect channels. We assume that adversarial errors can comprise a $\mathcal{O}(\frac{1}{n})$…
This paper considers the problem of efficiently transmitting quantum states through a network. It has been known for some time that without additional assumptions it is impossible to achieve this task perfectly in general -- indeed, it is…
Non-classical features of quantum systems have the potential to strengthen the way we currently exchange information. In this paper, we explore this enhancement on the most basic level of single particles. To be more precise, we compare how…
We prove that any perfect quantum strategy for the two-prover game encoding a constraint satisfaction problem (CSP) can be simulated via a perfect classical strategy with an extra classical communication channel, whose size depends only on…
We prove a trade-off relation between the entanglement cost and classical communication complexity of causal order structure of a protocol in distributed quantum information processing. We consider an implementation of a class of two-qubit…
In 1999 Raz demonstrated a partial function that had an efficient quantum two-way communication protocol but no efficient classical two-way protocol and asked, whether there existed a function with an efficient quantum one-way protocol, but…
The k-pair problem in network coding theory asks to send k messages simultaneously between k source-target pairs over a directed acyclic graph. In a previous paper [ICALP 2009, Part I, pages 622--633] the present authors showed that if a…
We formulate a two-party communication complexity problem and present its quantum solution that exploits the entanglement between two qutrits. We prove that for a broad class of protocols the entangled state can enhance the efficiency of…
Quantum information resources quantified by non-zero discord are ubiquitous for the continuous-variables bipartite systems. Complementary to this, we formally construct a model characterized by zero two-way discord for arbitrarily long time…
The behavior of entangled quantum systems can generally not be explained as being determined by shared classical randomness. In the first part of this paper, we propose a simple game for n players demonstrating this non-local property of…
We consider memoryless quantum communication protocols, where the two parties do not possess any memory besides their classical input and they take turns performing unitary operations on a pure quantum state that they exchange between them.…
We suggest a method to perform a quantum logic gate between distant qubits by off-resonant field-atom dispersive interactions. The scheme we present is shown to work ideally even in the presence of errors in the photon channels used for…
We consider a realistic setting of quantum tasks that generate shared bipartite quantum states. Suppose \alice and \bob are located at different places and need to produce a target shared quantum state $\rho$. In order to save quantum…
We describe a general quantum receiver protocol that maps laser-light-modulated classical communications signals into quantum processors for decoding with quantum logic. The quantum logic enables joint quantum measurements over a codeword…
In most communication scenarios, sending a symbol encoded in a quantum state requires spending resources such as energy, which can be quantified by a cost of communication. A standard approach in this context is to quantify the performance…
Environmental effects on the transmission of a state result, in general, in a change in the information carried by it. To mitigate this, many techniques such as quantum error--correcting codes, decoherence--free--subspaces [Rev Mod Phys,…
Although quantum algorithms realizing an exponential time speed-up over the best known classical algorithms exist, no quantum algorithm is known performing computation using less space resources than classical algorithms. In this paper, we…
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…