13 research outputs found

    Classical and quantum partition bound and detector inefficiency

    Full text link
    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

    PR-box correlations have no classical limit

    Full text link
    One of Yakir Aharonov's endlessly captivating physics ideas is the conjecture that two axioms, namely relativistic causality ("no superluminal signalling") and nonlocality, so nearly contradict each other that a unique theory - quantum mechanics - reconciles them. But superquantum (or "PR-box") correlations imply that quantum mechanics is not the most nonlocal theory (in the sense of nonlocal correlations) consistent with relativistic causality. Let us consider supplementing these two axioms with a minimal third axiom: there exists a classical limit in which macroscopic observables commute. That is, just as quantum mechanics has a classical limit, so must any generalization of quantum mechanics. In this classical limit, PR-box correlations violate relativistic causality. Generalized to all stronger-than-quantum bipartite correlations, this result is a derivation of Tsirelson's bound without assuming quantum mechanics.Comment: for a video of this talk at the Aharonov-80 Conference in 2012 at Chapman University, see quantum.chapman.edu/talk-10, published in Quantum Theory: A Two-Time Success Story (Yakir Aharonov Festschrift), eds. D. C. Struppa and J. M. Tollaksen (New York: Springer), 2013, pp. 205-21

    Violation of local realism vs detection efficiency

    Full text link
    We put bounds on the minimum detection efficiency necessary to violate local realism in Bell experiments. These bounds depends of simple parameters like the number of measurement settings or the dimensionality of the entangled quantum state. We derive them by constructing explicit local-hidden variable models which reproduce the quantum correlations for sufficiently small detectors efficiency.Comment: 6 pages, revtex. Modifications in the discussion for many parties in section 3, small erros and typos corrected, conclusions unchange

    Unbounded violation of tripartite Bell inequalities

    Get PDF
    We prove that there are tripartite quantum states (constructed from random unitaries) that can lead to arbitrarily large violations of Bell inequalities for dichotomic observables. As a consequence these states can withstand an arbitrary amount of white noise before they admit a description within a local hidden variable model. This is in sharp contrast with the bipartite case, where all violations are bounded by Grothendieck's constant. We will discuss the possibility of determining the Hilbert space dimension from the obtained violation and comment on implications for communication complexity theory. Moreover, we show that the violation obtained from generalized GHZ states is always bounded so that, in contrast to many other contexts, GHZ states do in this case not lead to extremal quantum correlations. The results are based on tools from the theories of operator spaces and tensor norms which we exploit to prove the existence of bounded but not completely bounded trilinear forms from commutative C*-algebras.Comment: Substantial changes in the presentation to make the paper more accessible for a non-specialized reade

    Large violation of Bell inequalities with low entanglement

    Get PDF
    In this paper we obtain violations of general bipartite Bell inequalities of order nlogn\frac{\sqrt{n}}{\log n} with nn inputs, nn outputs and nn-dimensional Hilbert spaces. Moreover, we construct explicitly, up to a random choice of signs, all the elements involved in such violations: the coefficients of the Bell inequalities, POVMs measurements and quantum states. Analyzing this construction we find that, even though entanglement is necessary to obtain violation of Bell inequalities, the Entropy of entanglement of the underlying state is essentially irrelevant in obtaining large violation. We also indicate why the maximally entangled state is a rather poor candidate in producing large violations with arbitrary coefficients. However, we also show that for Bell inequalities with positive coefficients (in particular, games) the maximally entangled state achieves the largest violation up to a logarithmic factor.Comment: Reference [16] added. Some typos correcte

    Generalizations of entanglement based on coherent states and convex sets

    Full text link
    Unentangled pure states on a bipartite system are exactly the coherent states with respect to the group of local transformations. What aspects of the study of entanglement are applicable to generalized coherent states? Conversely, what can be learned about entanglement from the well-studied theory of coherent states? With these questions in mind, we characterize unentangled pure states as extremal states when considered as linear functionals on the local Lie algebra. As a result, a relativized notion of purity emerges, showing that there is a close relationship between purity, coherence and (non-)entanglement. To a large extent, these concepts can be defined and studied in the even more general setting of convex cones of states. Based on the idea that entanglement is relative, we suggest considering these notions in the context of partially ordered families of Lie algebras or convex cones, such as those that arise naturally for multipartite systems. The study of entanglement includes notions of local operations and, for information-theoretic purposes, entanglement measures and ways of scaling systems to enable asymptotic developments. We propose ways in which these may be generalized to the Lie-algebraic setting, and to a lesser extent to the convex-cones setting. One of our original motivations for this program is to understand the role of entanglement-like concepts in condensed matter. We discuss how our work provides tools for analyzing the correlations involved in quantum phase transitions and other aspects of condensed-matter systems.Comment: 37 page
    corecore