Related papers: Simulating Quantum Correlations with Finite Commun…

We examine constraints on quantum operations imposed by relativistic causality. A bipartite superoperator is said to be localizable if it can be implemented by two parties (Alice and Bob) who share entanglement but do not communicate; it is…

While all bipartite pure entangled states violate some Bell inequality, the relationship between entanglement and non-locality for mixed quantum states is not well understood. We introduce a simple and efficient algorithmic approach for the…

We consider one of the quantum key distribution protocols recently introduced in Ref. [Pirandola et al., Nature Physics 4, 726 (2008)]. This protocol consists in a two-way quantum communication between Alice and Bob, where Alice encodes…

Completely determining the relationship between quantum correlation sets is a long-standing open problem, known as Tsirelson's problem. Following recent progress by Slofstra [arXiv:1606.03140 (2016), arXiv:1703.08618 (2017)] only two…

Consider many instances of an arbitrary quadripartite pure state of four quantum systems ABCD. Alice holds the AC part of each state, Bob holds B, while D represents all other parties correlated with ABC. Alice is required to redistribute…

Alice wants to send an arbitrary binary word to Bob. We show here that there is no problem for her to do that with only two bits. Of course, we consider here information like a signal in 4D.

How correlated are two quantum systems from the perspective of a third? We answer this by providing an optimal quantum state redistribution protocol for multipartite product sources. Specifically, given an arbitrary quantum state of three…

We obtain strict upper bounds on the bit transmission rate for communication of Classical bit codewords over Quantum channels. Albeit previous arguments in arXiv: 1804.01797 which have demonstrated that lower bounds can be shown to hold for…

We present a bidirectional quantum communication system based on optical phase conjugation for achieving fully autocompensating high-dimensional quantum cryptography. We prove that random phase shifts and couplings among 2N spatial and…

Bell-CHSH-like inequalities have been very successful in benchmarking {\it spatial} quantum correlations. However, as this paper illustrates, they are in general not sufficient for benchmarking {\it temporal} quantum correlations. To show…

We consider the problem of how to manipulate the entanglement properties of a general two-particle pure state, shared between Alice and Bob, by using only local operations at each end and classical communication between Alice and Bob. A…

Assume that Alice can do only classical probabilistic polynomial-time computing while Bob can do quantum polynomial-time computing. Alice and Bob communicate over only classical channels, and finally Bob gets a state…

Imagine two parties, Alice and Bob who share an entangled quantum state. A well-established result that if Alice performs two-outcome measurement on the portion of the state in her possession and Bob does likewise, they are able to produce…

We consider an arbitrary continuous-variable three-party Gaussian quantum state which is used to perform quantum teleportation of a pure Gaussian state between two of the parties (Alice and Bob). In turn, the third party (Charlie) can…

We derive lower bounds for tradeoffs between the communication C and space S for communicating circuits. The first such bound applies to quantum circuits. If for any function f with image Z the multicolor discrepancy of the communication…

We investigate sharing of bipartite entanglement in a scenario where half of an entangled pair is possessed and projectively measured by one observer, called Alice, while the other half is subjected to measurements performed sequentially,…

We present a protocol to simulate the correlations implied by nonmaximally entangled two qubit states. We extend this protocol to simulate the non-local part of these correlations. These protocols use single cbit communication and a single…

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…

A central question in classical information theory is that of source compression, which is the task where Alice receives a sample from a known probability distribution and needs to transmit it to the receiver Bob with small error. This…

Recently, Boyer et al. presented a novel semiquantum key distribution protocol [M. Boyer, D. Kenigsberg, and T. Mor, Phys. Rev. Lett. 99, 140501 (2007)], in which quantum Alice shares a secret key with classical Bob. Li et al. proposed two…