What classical resources are required to simulate quantum correlations? For the simplest and most important case of local projective measurements on an entangled Bell pair state, we show that exact simulation is possible using local hidden variables augmented by just one bit of classical communication. Certain quantum teleportation experiments, which teleport a single qubit, therefore admit a local hidden variables model.
We demonstrate that it is possible to simulate Bell violations using probabilistic methods. A quantum state corresponding to optical experiments that violate the Bell inequality is generated, demonstrating that these quantum paradoxes can indeed be simulated probabilistically. This provides an explicit counter-example to Feynman's claim that such classical simulations could not be carried out.
We present here a classical optics device based on an imaging architecture as analogy of a quantum system where the violation of the Bell inequality can be evidenced. In our case, the two qbits entangled state needed to obtain non classical correlations is encoded using an electromagnetic wave modulated in amplitude and phase. Computational states are represented in a way where each one of the two qbits is associated with two orthogonal directions in the input plane. In addition, unitary operations involved in the measurement of the observables are simulated with the use of a coherent optical …
We present a classical protocol for simulating correlations obtained by bipartite POVMs on an EPR pair. The protocol uses shared random variables (also known as local hidden variables) augmented by six bits of expected communication.
Violation of Bell inequality (or, Bell-type inequalities) by nonlocal correlations is justified by relaxation of at least one of the plausible physical constraints used to model such inequality. Based on this fact, in this letter we present a procedure to simulate three-qubit GHZ correlation relaxing two constraints, determinism and no signaling simultaneously. We have also derived the minimum amount of indeterminism and signaling to be introduced in a system. The corresponding number of signaling and local bits of mutual information needed to communicate are also provided and thus we are able…
The Bell-wave (B-wave) supposition has been introduced in an attempt to investigate Bell's conjecture (according to which "behind the scenes something is going faster than light"). Here it is shown, for the case of two entangled photons, that if it is further assumed that the B-waves propagate with superluminal but finite velocity then it is possible, at least in principle, to have faster-than-light (FTL) communication.
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.
We prove that for every Bell's inequality and for a broad class of protocols, there always exists a multi-party communication complexity problem, for which the protocol assisted by states which violate the inequality is more efficient than any classical protocol. Moreover, for that advantage Bell's inequality violation is a necessary and sufficient criterion. Thus, violation of Bell's inequalities has a significance beyond that of a non-optimal-witness of non-separability.
We investigate the amount of communication that must augment classical local hidden variable models in order to simulate the behaviour of entangled quantum systems. We consider the scenario where a bipartite measurement is given from a set of possibilities and the goal is to obtain exactly the same correlations that arise when the actual quantum system is measured. We show that, in the case of a single pair of qubits in a Bell state, a constant number of bits of communication is always sufficient--regardless of the number of measurements under consideration. We also show that, in the case of a…
We study Bell scenarios with binary outcomes supplemented by one bit of classical communication. We develop a method to find facet inequalities for such scenarios even when direct facet enumeration is not possible, or at least difficult. Using this method, we partially solve the scenario where Alice and Bob choose between three inputs, finding a total of 668 inequivalent facet inequalities (with respect to relabelings of inputs and outputs). We also show that some of these inequalities are constructed from the facet inequalities found in scenarios without communication, the well known Bell ine…
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.
A macroscopic quantum model of a two-level system (the analogue of a half-spin particle) is described. The model is employed for simulating not only the system under study, but the measurement process as well. Single- and two-particle state models of a quantum system are constructed. The Einstein-Podolsky-Rosen paradox and Bell's inequality are discussed within the framework of the model.
To reproduce in a local hidden variables theory correlations that violate Bell inequalities, communication must occur between the parties. We show that the amount of violation of a Bell inequality imposes a lower bound on the average communication needed to produce these correlations. Moreover, for every probability distribution there exists an optimal inequality for which the degree of violation gives the minimal average communication. As an example, to produce using classical resources the correlations that maximally violate the CHSH inequality, 0.4142 bits of communication are necessary and…
Correlations in an Einstein-Podolsky-Rosen-Bohm experiment can be made stronger than quantum correlations by allowing a single bit of classical communication between the two sides of the experiment.
In this paper we consider the possible correlations between two parties using local machines and shared randomness with an additional amount of classical communication. This is a continuation of the work initiated by Bacon and Toner in Ref. [\textit{Phys. Rev. Lett.} \textbf{90}, 157904 (2003)] who characterized the correlation polytope for $2\times 2$ measurement settings with binary outcomes plus one bit of communication. Here, we derive a complete set of Bell Inequalities for $3\times 2$ measurement settings and a shared bit of communication. When the communication direction is fixed, nine …
We consider a family of quantum communication protocols involving $N$ partners. We demonstrate the existence of a link between the security of these protocols against individual attacks by the eavesdropper, and the violation of some Bell's inequalities, generalizing the link that was noticed some years ago for two-partners quantum cryptography. The arguments are independent of the local hidden variable debate.
Quantum correlations which violate a Bell inequality are presumed to power better-than-classical protocols for solving communication complexity problems (CCPs). How general is this statement? We show that violations of correlation-type Bell inequalities allow advantages in CCPs, when communication protocols are tailored to emulate the Bell no-signaling constraint (by not communicating measurement settings). Abandonment of this restriction on classical models allows us to disprove the main result of, inter alia, [Brukner et. al., Phys Rev. Lett. 89, 197901 (2002)]; we show that quantum correlat…
Quantum resources can improve communication complexity problems (CCPs) beyond their classical constraints. One quantum approach is to share entanglement and create correlations violating a Bell inequality, which can then assist classical communication. A second approach is to resort solely to the preparation, transmission and measurement of a single quantum system; in other words quantum communication. Here, we show the advantages of the latter over the former in high-dimensional Hilbert space. We focus on a family of CCPs, based on facet Bell inequalities, study the advantage of high-dimensio…
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.
Bell nonlocality is a cornerstone of quantum theory with applications in information processing ranging from cryptography to distributed computing and game theory. Indeed, it is known that Bell's theorem can be formally linked to Bayesian games, allowing the use of nonlocal correlations to advise players and thereby achieve new points of equilibrium that are unavailable classically. Here we generalize this link, proving the connection between multistage games of incomplete information with Bell scenarios involving the communication of measurement outcomes between the parties. We apply the gene…
We develop a means of simulating the evolution and measurement of a multipartite quantum state under discrete or continuous evolution using another quantum system with states and operators lying in a real Hilbert space. This extends previous results which were unable to simulate local evolution and measurements with local operators and was limited to discrete evolution. We also detail applications to Bell inequalities and self-testing of quantum apparatus.
Entangled states can help in quantum state discrimination by local operations and classical communication (LOCC). For example, a Bell state is necessary (and sufficient) to perfectly discriminate a set of either three or four Bell states by LOCC. In this paper, we consider the task of LOCC discrimination of the states of noisy Bell ensembles, where a given ensemble consists of the states obtained by mixing the Bell states with an arbitrary two-qubit state with nonzero probabilities. It is proved that a Bell state is required for optimal discrimination by LOCC, even though the ensembles do not …
It is impossible to unambiguously distinguish the four Bell states in polarization, resorting to linear optical elements only. Recently, the hyperentangled Bell state, the simultaneous entanglement in more than one degree of freedom, has been used to assist in the complete Bell-state analysis of the four Bell states. However, if the additional degree of freedom is qubitlike, one can only distinguish 7 from the group of 16 states. Here we present a way to distinguish the hyperentangled Bell states completely with the help of cross-Kerr nonlinearity. Also, we discuss its application in the quant…
What is the communication cost of simulating the correlations produced by quantum theory? We generalize Bell inequalities to the setting of local realistic theories augmented by a fixed amount of classical communication. Suppose two parties choose one of M two-outcome measurements and exchange 1 bit of information. We present the complete set of inequalities for M = 2, and the complete set of inequalities for the joint correlation observable for M = 3. We find that correlations produced by quantum theory satisfy both of these sets of inequalities. One bit of communication is therefore sufficie…
Communication complexity problems (CCPs) are tasks in which separated parties attempt to compute a function whose inputs are distributed among the parties. Their communication is limited so that not all inputs can be sent. We show that broad classes of Bell inequalities can be mapped to CCPs and that a quantum violation of a Bell inequality is a necessary and sufficient condition for an enhancement of the related CCP beyond its classical limitation. However, one can implement CCPs by transmitting a quantum system, encoding no more information than is allowed in the CCP, and extract information…
We give a classical protocol to exactly simulate quantum correlations implied by a spin $s$ singlet state for the infinite sequence of \textit{integer} spin $s={1,4,13,...}$ satisfying $(2s+1)=3^{n}$,where $n$ is a positive integer.The required amount of communication is found to increase as $log_{3}d^{2}$ where $d=2s+1$ is the dimension of the spin $s$ Hilbert space.
Some forms of classical simulations of quantum type probabilities and correlations are capable of violating Boole's conditions of possible experience, such as the Clauser-Horne-Shimony-Holt inequality, even beyond the Tsirelson bound. This can be achieved by communicating a single bit encoding the measurement context.
Communication games are crucial tools for investigating the limitations of physical theories. The communication complexity (CC) problem is a typical example, for which several distributed parties attempt to jointly calculate a given function with limited classical communications. In this work, we present a method to construct CC problems from Bell tests in a graph-theoretic way. Starting from an experimental compatibility graph and the corresponding Bell test function, a target function which encodes the information of each edge can be constructed, then using this target function we could cons…
Entanglement appears in two different ways in quantum mechanics, namely as a property of states and as a property of measurement outcomes in joint measurements. By combining these two aspects of entanglement, it is possible to generate nonlocality between particles that never interacted, using the protocol of entanglement swapping. We investigate the communication cost of classically simulating this process. While the communication cost of simulating nonlocal correlations of entangled states appears to be generally quite low, we show here that infinite communication is required to simulate ent…
We numerically demonstrate that "mode-entangled states" based on the transverse modes of classical optical fields in multimode waveguides violate Bell's inequality. Numerically simulating the correlation measurement scheme of Bell's inequality, we obtain the normalized correlation functions of the intensity fluctuations for the two entangled classical fields. By using the correlation functions, the maximum violations of Bell's inequality are obtained. This implies that the two classical fields in the mode-entangled states, although spatially separated, present a nonlocal correlation.
Recently, experiments showed that the spatial-mode states of entangled photons are more robust than their polarization-mode states in quantum communications. Here we construct a complete and deterministic protocol for analyzing the spatial Bell states using the interaction between a photon and an electron spin in a charged quantum dot inside a one-side micropillar microcavity. A quantum nondemolition detector (QND) for checking the parity of a two-photon system can be constructed with the giant optical Faraday rotation in this solid state system. With this parity-check QND, we present a comple…
Suppose Alice and Bob share a maximally entangled state of any finite dimension and each perform two-outcome measurements on the respective part of the state. It is known, due to the recent result of Regev and Toner, that if a classical model is augmented with two bits of communication then all the quantum correlations arising from these measurements can be reproduced. Here we show that two bits of communication is in fact necessary for the perfect simulation. In particular, we prove that a pair of maximally entangled four-dimensional quantum systems cannot be simulated by a classical model au…
Assume Alice and Bob share some bipartite $d$-dimensional quantum state. A well-known result in quantum mechanics says that by performing two-outcome measurements, Alice and Bob can produce correlations that cannot be obtained locally, i.e., with shared randomness alone. We show that by using only two bits of communication, Alice and Bob can classically simulate any such correlations. All previous protocols for exact simulation required the communication to grow to infinity with the dimension $d$. Our protocol and analysis are based on a power series method, resembling Krivine's bound on Groth…
John Bell taught us that quantum mechanics can not be reproduced by non-contextual and local Hidden variable theory. The impossibility of replacing quantum mechanics by non-contextual Hidden Variable Theory can be turned to a impossible coloring pseudo-telepathy game to be played by two distant players. The game can not be won without communication in the classical world. But if the players share entangled state (quantum correlation) the game can be won deterministically using no communication. This again shows that though quantum correlation can not be used for communication, two parties can …
We have developed a scheme to generate, control, transmit and measure entangled photonic qutrits (two photons each of dimension d = 3). A Bell test of this source has previously been reported elsewhere [1], therefore, here we focus on how the control of the system is realized. Motivated by these results, we outline how the scheme can be used for two specific quantum protocols, namely key distribution and coin tossing and discuss some of their advantages and disadvantages.
This study presents the first two authenticated semi-quantum direct communication (ASQDC) protocols without using any classical channel. By pre-sharing the master secret key between two communicants, a sender with advanced quantum devices can transmit a secret message to a receiver who can only perform classical operations without any information leakage. The receiver is then capable of verifying the message up to the single qubit level, i.e., a one-qubit modification of the transmitted quantum sequence can be detected with a probability close to 1. Moreover, the proposed protocols are resista…
Recently, several aspects of controlled quantum communication (e.g., bidirectional controlled state teleportation, controlled quantum secure direct communication, controlled quantum dialogue, etc.) have been studied using $n$-qubit ($n\geq3$) entanglement. Specially, a large number of schemes for bidirectional controlled state teleportation are proposed using $m$-qubit entanglement ($m\in\{5,6,7\}$). Here, we propose a set of protocols to illustrate that it is possible to realize all these tasks related to controlled quantum communication using only Bell states and permutation of particles (Po…
In this article, a procedure called Probabilistic Swapped-Bell-States Analysis (PSBA) is proposed. Using this procedure two communication partners can transmit (binary-encoded) information over large spatial distances. This procedure is unusual insofar as no classical communication channels are used either during or after information encoding. To make this possible, entanglement swapping is used as a transport channel. The encoding of bits is realized by the execution (or non-execution, as the case may be) of entanglement swapping on multiple photon pairs, while decoding is realized by a stati…
In this article, we analyse the relationship between the Bell violation and the secure key rate of entanglement assisted quantum key distribution (QKD) protocols. Specifically, we address the question whether Bell violation is necessary or sufficient for secure communication. We construct a class of states which do not show Bell violation, however, which can be used for secure communication after local filtering. Similarly, we identify another class of states which show Bell violation but can not be used for generating secure key even after local filtering. The existence of these two classes o…
Quantum simulations of Bell inequality violations are numerically obtained using probabilistic phase space methods, namely the positive P-representation. In this approach the moments of quantum observables are evaluated as moments of variables that have values outside the normal eigenvalue range. There is thus a parallel with quantum weak measurements and weak values. Nevertheless, the representation is exactly equivalent to quantum mechanics. A number of states violating Bell inequalities are sampled, demonstrating that these quantum paradoxes can be treated with probabilistic methods. We tre…
(A) Bell's theorem rests on a conjunction of three assumptions: realism, locality and ``free will''. A discussion of these assumptions will be presented. It will be also shown that, if one adds to the assumptions the principle or rotational symmetry of physical laws, a stronger version of the theorem emerges. (B) A link between Bell's theorem and communication complexity problems will be presented. This also includes experimental realizations, which surprisingly do not involve entanglement. (C) A new sufficient and necessary criterion for entanglement of general (mixed) states is be presented.…
Classical and quantum physics provide fundamentally different predictions about experiments with separate observers that do not communicate, a phenomenon known as quantum nonlocality. This insight is a key element of our present understanding of quantum physics, and also enables a number of information processing protocols with security beyond what is classically attainable. Relaxing the pivotal assumption of no communication leads to new insights into the nature quantum correlations, and may enable new applications where security can be established under less strict assumptions. Here, we stud…
Quantum correlations, in particular those, which enable to violate a Bell inequality \cite{BELL}, open a way to advantage in certain communication tasks. However, the main difficulty in harnessing quantumness is its fragility to, e.g, noise or loss of particles. We study the persistency of Bell correlations of GHZ based mixtures and Dicke states. For the former, we consider quantum communication complexity reduction (QCCR) scheme, and propose new Bell inequalities (BIs), which can be used in that scheme for higher persistency in the limit of large number of particles $N$. In case of Dicke stat…
We consider relations between communication complexity problems and detecting correlations (violating local realism) with no local hidden variable model. We show first universal equivalence between characteristics of protocols used in that type of problems and non-signaling correlations. We construct non linear bipartite Bell type inequalities and strong nonlocality test with binary observables by providing general method of Bell inequalities construction and showing that existence of gap between quantum and classical complexity leads to violation of these inequalities. We obtain, first to our…
The question of how large Bell inequality violations can be, for quantum distributions, has been the object of much work in the past several years. We say that a Bell inequality is normalized if its absolute value does not exceed 1 for any classical (i.e. local) distribution. Upper and (almost) tight lower bounds have been given for the quantum violation of these Bell inequalities in terms of number of outputs of the distribution, number of inputs, and the dimension of the shared quantum states. In this work, we revisit normalized Bell inequalities together with another family: inefficiency-re…
In the first part of this thesis Bell's theorem is revisited. It points at a difference between the quantum and the classical world. This difference is often behind the advantages of solutions using quantum mechanics. New and more general versions of Bell inequalities are presented. These inequalities involve multiple settings per observer. Compared with the two-setting inequalities, the new ones reveal the non-classical character of a broader class of states. Some of them are also proven to be optimal (tight). Next, we go beyond Bell's theorem. It is shown, both in theory and in experiment, t…
Determinism, no signaling and measurement independence are some of the constraints required for framing Bell inequality. Any model simulating nonlocal correlations must either individually or jointly give up these constraints. Recently M. J. W. Hall (Phys Review A, \textbf{84}, 022102 (2011)) derived different forms of Bell inequalities under the assumption of individual or joint relaxation of those constraints on both(i.e., two) the sides of a bipartite system. In this work we have investigated whether one sided relaxation can also be a useful resource for simulating nonlocal correlations or …
Secure cryptographic protocols are indispensable for modern communication systems. It is realized through an encryption process in cryptography. In quantum cryptography, Quantum Key Distribution (QKD) is a widely popular quantum communication scheme that enables two parties to establish a shared secret key that can be used to encrypt and decrypt messages. But security loopholes still exist in this cryptographic protocol, as an eavesdropper can in principle still intercept all the ciphertext to perform cryptanalysis and the key may get leaked to the eavesdropper, although it happens very rarely…
Adopting quantum communication to modern networking requires transmitting quantum information through fiber-based infrastructure. We report the first demonstration of superdense coding over optical fiber links, taking advantage of a complete Bell-state measurement enabled by time-polarization hyperentanglement, linear optics, and common single-photon detectors. We demonstrate the highest single-qubit channel capacity to date utilizing linear optics, $1.665 \pm 0.018$, and we provide a full experimental implementation of a hybrid, quantum-classical communication protocol for image transfer.
Quantum communication relies on the efficient generation of entanglement between remote quantum nodes, due to entanglement's key role in achieving and verifying secure communications. Remote entanglement has been realized using a number of different probabilistic schemes, but deterministic remote entanglement has only recently been demonstrated, using a variety of superconducting circuit approaches. However, the deterministic violation of a Bell inequality, a strong measure of quantum correlation, has not to date been demonstrated in a superconducting quantum communication architecture, in par…
