Super-activation of quantum non-locality

In this paper we show that quantum non-locality can be super-activated. That is, one can obtain violations of Bell inequalities by tensorizing a local state with itself. Moreover, previous results suggest that such Bell violations can be very large.Comment: v2: Refs added. Same results, v3: Minor corrections. Close to the published versio

Causality and Cirel'son bounds

An EPR-Bell type experiment carried out on an entangled quantum system can produce correlations stronger than allowed by local realistic theories. However there are correlations that are no-signaling and are more non local than the quantum correlations. Here we show that any correlations more non local than those achievable in an EPR-Bell type experiment necessarily allow -in the context of the quantum formalism- both for signaling and for generation of entanglement. We use our approach to rederive Cirel'son bound for the CHSH expression, and we derive a new Cirel'son type bound for qutrits. We discuss in detail the interpretation of our approach.Comment: 5 page

A limit on nonlocality in any world in which communication complexity is not trivial

Bell proved that quantum entanglement enables two space-like separated parties to exhibit classically impossible correlations. Even though these correlations are stronger than anything classically achievable, they cannot be harnessed to make instantaneous (faster than light) communication possible. Yet, Popescu and Rohrlich have shown that even stronger correlations can be defined, under which instantaneous communication remains impossible. This raises the question: Why are the correlations achievable by quantum mechanics not maximal among those that preserve causality? We give a partial answer to this question by showing that slightly stronger correlations would result in a world in which communication complexity becomes trivial.Comment: 13 pages, no figure

Quantum Entanglement and Communication Complexity

We consider a variation of the multi-party communication complexity scenario where the parties are supplied with an extra resource: particles in an entangled quantum state. We show that, although a prior quantum entanglement cannot be used to simulate a communication channel, it can reduce the communication complexity of functions in some cases. Specifically, we show that, for a particular function among three parties (each of which possesses part of the function's input), a prior quantum entanglement enables them to learn the value of the function with only three bits of communication occurring among the parties, whereas, without quantum entanglement, four bits of communication are necessary. We also show that, for a particular two-party probabilistic communication complexity problem, quantum entanglement results in less communication than is required with only classical random correlations (instead of quantum entanglement). These results are a noteworthy contrast to the well-known fact that quantum entanglement cannot be used to actually simulate communication among remote parties.Comment: 10 pages, latex, no figure

All quantum states useful for teleportation are nonlocal resources

Understanding the relation between the different forms of inseparability in quantum mechanics is a longstanding problem in the foundations of quantum theory and has implications for quantum information processing. Here we make progress in this direction by establishing a direct link between quantum teleportation and Bell nonlocality. In particular, we show that all entangled states which are useful for teleportation are nonlocal resources, i.e. lead to deterministic violation of Bell's inequality. Our result exploits the phenomenon of super-activation of quantum nonlocality, recently proved by Palazuelos, and suggests that the latter might in fact be generic.Comment: 4 pages. v2: Title and abstract changed, presentation improved, references updated, same result

Multipartite Nonlocal Quantum Correlations Resistant to Imperfections

We use techniques for lower bounds on communication to derive necessary conditions in terms of detector efficiency or amount of super-luminal communication for being able to reproduce with classical local hidden-variable theories the quantum correlations occurring in EPR-type experiments in the presence of noise. We apply our method to an example involving n parties sharing a GHZ-type state on which they carry out measurements and show that for local-hidden variable theories, the amount of super-luminal classical communication c and the detector efficiency eta are constrained by eta 2^(-c/n) = O(n^(-1/6)) even for constant general error probability epsilon = O(1)

Classical and quantum partition bound and detector inefficiency

We study randomized and quantum efficiency lower bounds in communication complexity. These arise from the study of zero-communication protocols in which players are allowed to abort. Our scenario is inspired by the physics setup of Bell experiments, where two players share a predefined entangled state but are not allowed to communicate. Each is given a measurement as input, which they perform on their share of the system. The outcomes of the measurements should follow a distribution predicted by quantum mechanics; however, in practice, the detectors may fail to produce an output in some of the runs. The efficiency of the experiment is the probability that the experiment succeeds (neither of the detectors fails). When the players share a quantum state, this gives rise to a new bound on quantum communication complexity (eff*) that subsumes the factorization norm. When players share randomness instead of a quantum state, the efficiency bound (eff), coincides with the partition bound of Jain and Klauck. This is one of the strongest lower bounds known for randomized communication complexity, which subsumes all the known combinatorial and algebraic methods including the rectangle (corruption) bound, the factorization norm, and discrepancy. The lower bound is formulated as a convex optimization problem. In practice, the dual form is more feasible to use, and we show that it amounts to constructing an explicit Bell inequality (for eff) or Tsirelson inequality (for eff*). We give an example of a quantum distribution where the violation can be exponentially bigger than the previously studied class of normalized Bell inequalities. For one-way communication, we show that the quantum one-way partition bound is tight for classical communication with shared entanglement up to arbitrarily small error.Comment: 21 pages, extended versio

Is Communication Complexity Physical?

Recently, Brassard et. al. conjectured that the fact that the maximal possible correlations between two non-local parties are the quantum-mechanical ones is linked to a reasonable restriction on communication complexity. We provide further support for the conjecture in the multipartite case. We show that any multipartite communication complexity problem could be reduced to triviality, had Nature been more non-local than quantum-mechanics by a quite small gap for any number of parties. Intriguingly, the multipartite nonlocal-box that we use to show the result corresponds to the generalized Bell inequality that manifests maximal violation in respect to a local hidden-variable theory

Substituting Quantum Entanglement for Communication

We show that quantum entanglement can be used as a substitute for communication when the goal is to compute a function whose input data is distributed among remote parties. Specifically, we show that, for a particular function among three parties (each of which possesses part of the function's input), a prior quantum entanglement enables one of them to learn the value of the function with only two bits of communication occurring among the parties, whereas, without quantum entanglement, three bits of communication are necessary. This result contrasts the well-known fact that quantum entanglement cannot be used to simulate communication among remote parties.Comment: 4 pages REVTeX, no figures. Minor correction

Bias and angular dependence of spin-transfer torque in magnetic tunnel junctions

We use spin-transfer-driven ferromagnetic resonance (ST-FMR) to measure the spin-transfer torque vector T in MgO-based magnetic tunnel junctions as a function of the offset angle between the magnetic moments of the electrodes and as a function of bias, V. We explain the conflicting conclusions of two previous experiments by accounting for additional terms that contribute to the ST-FMR signal at large |V|. Including the additional terms gives us improved precision in the determination of T(V), allowing us to distinguish among competing predictions. We determine that the in-plane component of has a weak but non-zero dependence on bias, varying by 30-35% over the bias range where the measurements are accurate, and that the perpendicular component can be large enough to be technologically significant. We also make comparisons to other experimental techniques that have been used to try to measure T(V).Comment: 30 pages, 8 figures. Expanded with additional data and discussion. In press at PR