Quantum information processing is the emerging field that defines and realizes computing devices that make use of quantum mechanical principles, like the superposition principle, entanglement, and interference. In this review we study the information counterpart of computing. The abstract form of the distributed computing setting is called communication complexity. It studies the amount of information, in terms of bits or in our case qubits, that two spatially separated computing devices need to exchange in order to perform some computational task. Surprisingly, quantum mechanics can be used to obtain dramatic advantages for such tasks.
We review the area of quantum communication complexity, and show how it connects the foundational physics questions regarding non-locality with those of communication complexity studied in theoretical computer science. The first examples exhibiting the advantage of the use of qubits in distributed information-processing tasks were based on non-locality tests. However, by now the field has produced strong and interesting quantum protocols and algorithms of its own that demonstrate that entanglement, although it cannot be used to replace communication, can be used to reduce the communication exponentially. In turn, these new advances yield a new outlook on the foundations of physics, and could even yield new proposals for experiments that test the foundations of physics.
In all local realistic theories worked out till now, locality is considered as a basic assumption. Most people in the field consider the inconsistency between local realistic theories and quantum mechanics to be a result of non-local nature of quantum mechanics. In this paper, we derive Bell's inequality for particles with instantaneous interactions, and show that the aforementioned contradiction still exists between quantum mechanics and non-local hidden variable models. Then, we use this non-locality to obtain the GHZ theorem. In what follows, we show that Bacon and Toner's protocol, for the…
We first present a protocol for deterministically distilling non-locality, building upon a recent result of Forster et al. [Phys. Rev. Lett. 102, 120401 (2009)]. Our protocol, which is optimal for two-copy distillation, works efficiently for a specific class of post-quantum non-local boxes, which we term correlated non-local boxes. In the asymptotic limit, all correlated non-local boxes are distilled to the maximally non-local box of Popescu and Rohrlich. Then, taking advantage of a result of Brassard \textit{et al.} [Phys. Rev. Lett. 96, 250401 (2006)] we show that all correlated non-local bo…
It is shown that the detection loophole which arises when trying to rule out local realistic theories as alternatives for quantum mechanics can be closed if the detection efficiency $η$ is larger than $η\geq d^{1/2} 2^{-0.0035d}$ where $d$ is the dimension of the entangled system. Furthermore it is argued that this exponential decrease of the detector efficiency required to close the detection loophole is almost optimal. This argument is based on a close connection that exists between closing the detection loophole and the amount of classical communication required to simulate quantum correlat…
Quantum theory puts forward phenomena unexplainable by classical physics - or information, for that matter. A prominent example is non-locality. Non-local correlations cannot be explained, in classical terms, by shared information but only by communication. On the other hand, the phenomenon does not allow for (potentially faster-than-light) message transmission. The fact that some non-local and non-signaling correlations are predicted by quantum theory, whereas others fail to be, asks for a criterion, as simple as possible, that characterizes which joint input-output behaviors are ``quantum'' …
The proofs of quantum nonlocality due to GHZ and Hardy are quantitatively different from that of Bell insofar as they rely only on a consideration of whether events are possible or impossible, rather than relying on specific experimental probabilities. Here, we consider the computational task of determining whether or not a given table of possibilities constitutes a departure from possibilistic local realism. By considering the case in which one party has access to measurements with two outcomes and the other three, it is possible to see at exactly which point this task becomes computationally…
Non-local correlations are one of the most fascinating consequences of quantum physics from the point of view of information: Such correlations, although not allowing for signaling, are unexplainable by pre-shared information. The correlations have applications in cryptography, communication complexity, and sit at the very heart of many attempts of understanding quantum theory -- and its limits -- better in terms of classical information. In these contexts, the question is crucial whether such correlations can be distilled, i.e., whether weak correlations can be used for generating (a smaller …
Polarization correlations of two distant observers are observed by using coherent light fields based on Stapp's formulation of nonlocality. Using a 50/50 beam splitter transformation, a vertically polarized coherent light field is found to be entangled with a horizontally polarized coherent noise field. The superposed light fields at each output port of the beam splitter are sent to two distant observers, where the fields are interfered and manipulated at each observer by using a quarter wave plate and an analyzer. The interference signal contains information of the projection angle of the ana…
In this thesis, we study about three subjects 1- Classical simulation of two spin-$s$ singlet correlations for all $s$ involving spin measurements, 2- Quantum correlations in successive single spin measurements, 3- Non locality without inequality for almost all two-qubit entangled states based on Cabello's non locality argument.
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, except that it is not necessary to close the locality loophole. I derive bounds for the detector efficiency and background count rates necessary for an experimental implementation and show that they are close to what can be currently achieved using ion trap technology. I also analyze the requirements for a three-party protocol and show that they are less demandi…
Quantum pseudo-telepathy is an intriguing phenomenon which results from the application of quantum information theory to communication complexity. To demonstrate this phenomenon researchers in the field of quantum communication complexity devised a number of quantum non-locality games. The setting of these games is as follows: the players are separated so that no communication between them is possible and are given a certain computational task. When the players have access to a quantum resource called entanglement, they can accomplish the task: something that is impossible in a classical setti…
There are various non-equivalent definitions of locality. Three of them, impossibility of instantaneous communication, impossibility of action-at-a-distance, and impossibility of faster-than-light travel, while not fully implying each other, have a large overlap. When the term non-locality is used, most physicists think that one of these three conditions is being violated. There is a minority of physicists, however, who uses "locality" with a fourth meaning, the satisfaction of the hypotheses underlying Bell inequality. This definition devoids Bell's theorem of its profoundness, reducing it to…
Non-local correlations are not only a fascinating feature of quantum theory, but an interesting resource for information processing, for instance in communication-complexity theory or cryptography. An important question in this context is whether the resource can be distilled: Given a large amount of weak non-local correlations, is there a method to obtain strong non-locality using local operations and shared randomness? We partly answer this question by no: CHSH-type non-locality, the only possible non-locality of binary systems, which is not super-strong, but achievable by measurements on ce…
Hardy's non-locality paradox is a proof without inequalities showing that certain non-local correlations violate local realism. It is `possibilistic' in the sense that one only distinguishes between possible outcomes (positive probability) and impossible outcomes (zero probability). Here we show that Hardy's paradox is quite universal: in any (2,2,l) or (2,k,2) Bell scenario, the occurence of Hardy's paradox is a necessary and sufficient condition for possibilistic non-locality. In particular, it subsumes all ladder paradoxes. This universality of Hardy's paradox is not true more generally: we…
Non-local correlations are among the most fascinating features of quantum theory from the point of view of information: Such correlations, although not allowing for signaling, are unexplainable by pre-shared information. The correlations have applications in cryptography, communication complexity, and sit at the very heart of many attempts of understanding quantum theory -- and its limits -- in terms of classical information. In these contexts, the question is crucial whether such correlations can be amplified or distilled, i.e., whether and how weak correlations can be used for generating (a …
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 quantum mechanics: While, on the one hand, it is immediately clear that classical players will lose the game with substantial probability, it can, on the other hand, always be won by players sharing an entangled quantum state. The simplicity of the classical analysis of our game contrasts the often quite involved analysis of previously proposed examples of thi…
This article presents a local realistic interpretation of quantum entanglement. The entanglement is explained as innate interference between the non-empty state associated with the peaked piece of one particle and the empty states associated with the non-peaked pieces of the others of entangled particles, which inseparably join together. The correlation of the results of measurements on the ensemble of composite entangled systems is related to this kind of interference. Consequently, there is no nonlocal influence between entangled particles in measurements. Particularly, this explanation thus…
Bell's theorem, stating that quantum predictions are incompatible with a local hidden variable description, is a cornerstone of quantum theory and at the center of many quantum information processing protocols. Over the years, different perspectives on non-locality have been put forward as well as different ways to to detect non-locality and quantify it. Unfortunately and in spite of its relevance, as the complexity of the Bell scenario increases, deciding whether a given observed correlation is non-local becomes computationally intractable. Here, we propose to analyse a Bell scenario as a ten…
Ever since the work of Bell, it has been known that entangled quantum states can rise non-local correlations. However, for almost forty years, it has been assumed that the most non-local states would be the maximally entangled ones. Surprisingly it is not the case: non-maximally entangled states are generally more non-local than maximally entangled states for all the measures of non-locality proposed to date: Bell inequalities, the Kullback-Leibler distance, entanglement simulation with communication or with non-local boxes, the detection loophole and efficiency of cryptography. In fact, one c…
It is well known that entangled quantum states can be nonlocal: the correlations between local measurements carried out on these states cannot always be reproduced by local hidden variable models. Svetlichny, followed by others, showed that multipartite quantum states are even more nonlocal than bipartite ones in the sense that nonlocal classical models with (super-luminal) communication between some of the parties cannot reproduce the quantum correlations. Here we study in detail the kinds of nonlocality present in quantum states. More precisely we enquire what kinds of classical communicatio…
Non-local correlations are usually understood through the outcomes of alternative measurements (on two or more parts of a system) that cannot altogether actually be carried out in an experiment. Indeed, a joint input/output -- e.g., measurement-setting/outcome -- behavior is non-local if and only if the outputs for all possible inputs cannot coexist consistently. It has been argued that this counterfactual view is how Bell's inequalities and their violations are to be seen. We propose an alternative perspective which refrains from setting into relation the results of mutually exclusive measure…
The communication cost of simulating probability distributions obtained by measuring quantum states is a natural way to quantify quantum non-locality. While much is known in the case of bipartite entanglement, little has been done in the multipartite setting. In this paper, we focus on the GHZ state. Specifically, equatorial measurements lead to correlations similar to the ones obtained with Bell states. We give a protocol to simulate these measurements on the n-partite GHZ state using O(n^2) bits of communication on average.
Non-locality stands nowadays not only as one of the cornerstones of quantum theory, but also plays a crucial role in quantum information processing. Several experimental investigations of nonlocality have been carried out over the years. In spite of their fundamental relevance, however, all previous experiments do not consider a crucial ingredient that is ubiquitous in quantum networks: the fact that correlations between distant parties are mediated by several, typically independent, sources of quantum states. Here, using a photonic setup we investigate a quantum network consisting of three sp…
Motivated by Popescu's example of hidden nonlocality, we elaborate on the conjecture that quantum states that are intuitively nonlocal, i.e., entangled, do not admit a local causal hidden variables model. We exhibit quantum states which either (i) are nontrivial counterexamples to this conjecture or (ii) possess a new kind of more deeply hidden irreducible nonlocality. Moreover, we propose a nonlocality complexity classification scheme suggested by the latter possibility. Furthermore, we show that Werner's (and similar) hidden variables models can be extended to an important class of generaliz…
This paper surveys the field of quantum communication complexity. Some interesting recent results are collected concerning relations to classical communication, lower bound methods, one-way communication, and applications of quantum communication complexity.
Non-locality is a powerful resource for various communication and information theoretic tasks, e.g., to establish a secret key between two parties, or to reduce the communication complexity of distributed computing. Typically, the more non-local a system is, the more useful it is as a resource for such tasks. We address the issue of non-locality distillation, i.e., whether it is possible to create a strongly non-local system by local operations on several weakly non-local ones. More specifically, we consider a setting where non-local systems can be realized via measurements on underlying share…
We present a simple communication complexity problem where three parties benefit from sharing bound entanglement. This demonstrates that entanglement distillability of the shared state is not necessary in order to surpass classical communication complexity.
Oblivious transfer, a central functionality in modern cryptography, allows a party to send two one-bit messages to another who can choose one of them to read, remaining ignorant about the other, whereas the sender does not learn the receiver's choice. Oblivious transfer the security of which is information-theoretic for both parties is known impossible to achieve from scratch. - The joint behavior of certain bi-partite quantum states is non-local, i.e., cannot be explained by shared classical information. In order to better understand such behavior, which is classically explainable only by com…
Superluminal communications have been proposed to solve the Einstein, Podolsky and Rosen (EPR) paradox. So far, no evidence for these superluminal communications has been obtained and only lower bounds for the superluminal velocities have been established. In this paper we describe an improved experiment that increases by about two orders of magnitude the maximum detectable superluminal velocities. The locality, the freedom-of-choice and the detection loopholes are not addressed here. No evidence for superluminal communications has been found and a new higher lower bound for their velocities h…
In communication complexity, a number of distant parties have the task of calculating a distributed function of their inputs, while minimizing the amount of communication between them. It is known that with quantum resources, such as entanglement and quantum channels, one can obtain significant reductions in the communication complexity of some tasks. In this work, we study the role of the quantum superposition of the direction of communication as a resource for communication complexity. We present a tripartite communication task for which such a superposition allows for an exponential saving …
Here we propose a general relativistic quantum framework for cryptography that exploits the fascinating connection of quantum non-locality and special theory of relativity with cryptography. The underlying principle of unconditional security is causality and two-fold quantum non-local correlations: first entanglement swapping and then teleportation over causally independent entangled systems. We show that the proposed framework has following remarkable and novel features in mistrustful cryptography: (i) It helps in defining a new notion of oblivious transfer where both the data transferred and…
We obtain a general connection between a quantum advantage in communication complexity and non-locality. We show that given any protocol offering a (sufficiently large) quantum advantage in communication complexity, there exists a way of obtaining measurement statistics which violate some Bell inequality. Our main tool is port-based teleportation. If the gap between quantum and classical communication complexity can grow arbitrarily large, the ratio of the quantum value to the classical value of the Bell quantity becomes unbounded with the increase in the number of inputs and outputs.
Quantum communication, and indeed quantum information in general, has changed the way we think about quantum physics. In 1984 and 1991, the first protocol for quantum cryptography and the first application of quantum non-locality, respectively, attracted a diverse field of researchers in theoretical and experimental physics, mathematics and computer science. Since then we have seen a fundamental shift in how we understand information when it is encoded in quantum systems. We review the current state of research and future directions in this new field of science with special emphasis on quantum…
In this paper, we extend our previous discussion on ontological determinism, non-locality and quantum mechanics to that of the Sarfatti post-quantum mechanics perspective. We examine the nature of quantum equilibrium and non-equilibrium and uncertainty following the Sarfatti description of this theoretical development, which serves to extend the statistical linear unitary quantum mechanics for closed systems to a locally-retrocausal, non-statistical, non-linear, non-unitary theory for open systems. We discuss how the Bohmian quantum potential has a dependence upon the position of its Bell beab…
We consider the problem of remote state preparation recently studied in several papers. We study the communication complexity of this problem, in the presence of entanglement and in the scenario of single use of the channel.
The generation of certifiable randomness is the most fundamental information-theoretic task that meaningfully separates quantum devices from their classical counterparts. We propose a protocol for exponential certified randomness expansion using a single quantum device. The protocol calls for the device to implement a simple quantum circuit of constant depth on a 2D lattice of qubits. The output of the circuit can be verified classically in linear time, and is guaranteed to contain a polynomial number of certified random bits assuming that the device used to generate the output operated using …
We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than that is required with only classical random correlations. A simple all-optical implementation of this protocol is presented and demonstrates our conclusion.
We prove that the fidelity of two exemplary communication complexity protocols, allowing for an N-1 bit communication, can be exponentially improved by N-1 (unentangled) qubit communication. Taking into account, for a fair comparison, all inefficiencies of state-of-the-art set-up, the experimental implementation outperforms the best classical protocol, making it the candidate for multi-party quantum communication applications.
Quantum entanglement cannot be used to achieve direct communication between remote parties, but it can reduce the communication needed for some problems. Let each of k parties hold some partial input data to some fixed k-variable function f. The communication complexity of f is the minimum number of classical bits required to be broadcasted for every party to know the value of f on their inputs. We construct a function G such that for the one-round communication model and three parties, G can be computed with n+1 bits of communication when the parties share prior entanglement. We then show tha…
We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a method for proving classical communication complexity lower bounds developed by Raz to the quantum case. Applying this method we give an exponential separation between bounded error quantum communication complexity and nondeterministic quantum communication complexity. We develop several other lower bound methods based on the Fourier transform, notably showing that \sqrt{\bar{s}(f)/\log n}, for the average sensitivity \b…
We prove a general lower bound on the bounded-error entanglement-assisted quantum communication complexity of Boolean functions. The bound is based on the concept that any classical or quantum protocol to evaluate a function on distributed inputs can be turned into a quantum communication protocol. As an application of this bound, we give a very simple proof of the statement that almost all Boolean functions on n+n bits have linear communication complexity, even in the presence of unlimited entanglement.
I show that a simple multi-party communication task can be performed more efficiently with quantum communication than with classical communication, even with low detection efficiency $η$. The task is a communication complexity problem in which distant parties need to compute a function of the distributed inputs, while minimizing the amount of communication between them. A realistic quantum optical setup is suggested that can demonstrate a five-party quantum protocol with higher-than-classical performance, provided $η>0.33$ .
We study the relation between the quantum games, communication complexity problems and Bell inequalities. In particular we are interested in answering the question whether for every element of one of these groups there is a corresponding element in the other two. We show that there are cases where there is no such relation. Moreover, in the communication complexity problems for which there is no Bell inequality the advantage of the quantum strategies over the classical ones is much higher.
Quantum correlations are critical to our understanding of nature, with far-reaching technological and fundamental impact. These often manifest as violations of Bell's inequalities, bounds derived from the assumptions of locality and realism, concepts integral to classical physics. Many tests of Bell's inequalities have studied pairs of correlated particles; however, the immense interest in multi-particle quantum correlations is driving the experimental frontier to test systems beyond just pairs. All experimental violations of Bell's inequalities to date require supplementary assumptions, openi…
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 occurri…
We propose a protocol for Alice to implement a multiqubit quantum operation from the restricted sets on distant qubits possessed by Bob, and then we investigate the communication complexity of the task in different communication scenarios. By comparing with the previous work, our protocol works without prior sharing of entanglement, and requires less communication resources than the previous protocol in the qubit-transmission scenario. Furthermore, we generalize our protocol to $d$-dimensional operations.
We discuss quantum non-locality and contextuality, emphasising logical and structural aspects. We also show how the same mathematical structures arise in various areas of classical computation.
Addressing the feasibilty of quantum communication with electrons we consider entangled spin states of electrons in a double-dot which is weakly coupled to in--and outgoing leads. We show that the entanglement of two electrons in the double-dot can be detected in mesoscopic transport and noise measurements. In the Coulomb blockade and cotunneling regime the singlet and triplet states lead to phase-coherent current and noise contributions of opposite signs and to Aharonov-Bohm and Berry phase oscillations in response to magnetic fields. These oscillations are a genuine two-particle effect and p…
Present-day quantum communication predominantly depends on trusted relays (e.g., quantum repeaters, low-Earth-orbit satellite) connected by optical fiber cables to transmit information. However, recent evidence supports a decades-old concept that quantum entanglement, harnessed by current quantum communication systems, does not necessarily rely on a physical relay medium. In modern quantum communication networks, this trusted relay infrastructure is (1) susceptible to security attacks, (2) limited by the channel capacity, (3) subject to decoherence loss, and (4) expensive to set up. The instan…
We show several results related to interactive proof modes of communication complexity. First we show lower bounds for the QMA-communication complexity of the functions Inner Product and Disjointness. We describe a general method to prove lower bounds for QMA-communication complexity, and show how one can 'transfer' hardness under an analogous measure in the query complexity model to the communication model using Sherstov's pattern matrix method. Combining a result by Vereshchagin and the pattern matrix method we find a communication problem with AM-communication complexity $O(\log n)$, PP-com…
