A black box with two input bits and two output bits is called a non-local PR box, if the XOR of the output bits equals the AND of the input bits. In a recent article, Cerf et al. show that Alice and Bob, using such a PR box, can effectively simulate entanglement without the need of communication. We show that an adaptation of a model due to Dirk Aerts, yields a realistic simulation of the non-local PR box without communication. Because the model is entirely realistic, it cannot violate relativistic constraints. Like a non-local box, it can be used to simulate the singlet state coincidence probabilities, but the time to complete the observation of the outcome will exceed the time it takes a photon to travel one arm in an EPRB setup. The model explicitly shows how to produce an outcome that is locally perfectly random, but nevertheless determines what happens in the other wing of the experiment, without communication taking place between the two wings. In this sense, it can serve as an accurate metaphor for the mechanism of entanglement. The model considerably strengthens the claim that no communication is necessary to simulate entanglement.
A black box with two input bits and two output bits is called a non-local PR box, if the XOR of the output bits equals the AND of the input bits. In a recent article, Cerf et al. show that Alice and Bob, using such a PR box, can effectively simulate entanglement without the need of communication. We show that an adaptation of a model due to Dirk Aerts, yields a realistic simulation of the non-local PR box without communication. Because the model is entirely realistic, it cannot violate relativistic constraints. Like a non-local box, it can be used to simulate the singlet state coincidence probabilities, but the time to complete the observation of the outcome will exceed the time it takes a photon to travel one arm in an EPRB setup. The model explicitly shows how to produce an outcome that is locally perfectly random, but nevertheless determines what happens in the other wing of the experiment, without communication taking place between the two wings. In this sense, it can serve as an accurate metaphor for the mechanism of entanglement. The model considerably strengthens the claim that no communication is necessary to simulate entanglement.
A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a, b are uniformly distributed and the parity of a+b equals xy. Such boxes have been central to the study of quantum or generalized non-locality as well as the simulation of non-signaling distributions. In this paper, we start by studying how many non-local boxes Alice and Bob need in order to compute a Boolean function f. We provide tight upper and lower bounds in terms of the communication complexity of the function both in the deterministic and randomized case. We then proceed to show that the study of non-local box complexity has interesting applications for classical computation as well. In particular, we look at secure function evaluation, and study the question posed by Beimel and Malkin of how many Oblivious Transfer calls Alice and Bob need in order to securely compute a function f. We show that this question is related to the non-local box complexity of the function and conclude by greatly improving their bounds. Finally, another consequence of our results is that traceless two-outcome measurements on maximally entangled states can be simulated with 3 non-local boxes, while no finite bound was previously known.
A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b, where a,b are uniformly distributed and a⊕b=x∧y. Such boxes have been central to the study of quantum or generalized non-locality, as well as the simulation of non-signaling distributions. In this paper, we start by studying how many non-local boxes Alice and Bob need in order to compute a Boolean function f. We provide tight upper and lower bounds in terms of the communication complexity of the function both in the deterministic and randomized case. We show that non-local box complexity has interesting applications to classical cryptography, in particular to secure function evaluation, and study the question posed by Beimel and Malkin \cite{BM} of how many Oblivious Transfer calls Alice and Bob need in order to securely compute a function f. We show that this question is related to the non-local box complexity of the function and conclude by greatly improving their bounds. Finally, another consequence of our results is that traceless two-outcome measurements on maximally entangled states can be simulated with 3 \nlbs, while no finite bound was previously known.
A non-local box is an abstract device into which Alice and Bob input bits x and y respectively and receive outputs a and b respectively, where a,b are uniformly distributed and a⊕b=x∧y. Such boxes have been central to the study of quantum or generalized non-locality as well as the simulation of non-signaling distributions. In this paper, we start by studying how many non-local boxes Alice and Bob need in order to compute a Boolean function f. We provide tight upper and lower bounds in terms of the communication complexity of the function both in the deterministic and randomized case. We show that non-local box complexity has interesting applications to classical cryptography, in particular to secure function evaluation, and study the question posed by Beimel and Malkin \cite{BM} of how many Oblivious Transfer calls Alice and Bob need in order to securely compute a function f. We show that this question is related to the non-local box complexity of the function and conclude by greatly improving their bounds. Finally, another consequence of our results is that traceless two-outcome measurements on maximally entangled states can be simulated with 3 \nlbs, while no finite bound was previously known.
This paper demonstrates the capability to simulate EPR experiments in a realistic way (i.e. without transmission of information between the source and the detector) and confirms even more the Bell’s theorem, by demonstrating that effectively non-local variables are required to violate the Bell’s inequality. Unlike all EPR experiments, this modeling instead of simply noting the inadequacy of a local modeling proposes a new way of non-local idealization. These simulations work on spreadsheet by idealizing objects with a non-linear notion, the extended object. This allows to set up a new principle of locality (or non-locality) and a new meaning on the loopholes of EPR experiments. It sheds new light on several concepts of Quantum Mechanics (QM): the quantum states (would represent an equivalence class of many different indistinguishable objects seen as equivalent in terms of measurement), the wave function (would represent a probability on this equivalence class seen as a single set despite different probabilities of happening for the individual objects composing this equivalence class), the measurement (in our simulation, the measured object is not modified), the superposition of states (in our simulation, Schrödinger's cat is never both dead and alive). These simulations lead to several kinds of EPR experiments with violations of the Bell’s inequalities with values different from the QM, allow to realize entanglements with more than 2 objects (whatever the number of Alice and Bob) or even with more than 2 results (beyond the only “+1” or “-1” outputs). Many questions remain to be explored in the physics domain on quantum phenomena (teleportation, encryption, quantum computing, etc.…), but this theoretical approach also reveals the necessity of developing new non-linear tools in mathematics domain and seems to show that QM could finally be a limit case of a more fundamental nonlinear physics theory founded on these extended objects. This observation is strangely reminiscent of developments such as string theory.
Bell's theorem states that quantum mechanics is not a locally causal theory. This state is often interpreted as nonlocality in quantum mechanics. Toner and Bacon [Phys. Rev. Lett. 91, 187904 (2003)] have shown that a shared random-variable theory augmented by one bit of classical communication exactly simulates the Bell correlation in a singlet state. In this paper, we show that in Toner and Bacon protocol, one of the parties (Bob) can deduce another party's (Alice) measurement outputs, if she only informs Bob of one of her own outputs. Afterwards, we suggest a nonlocal version of Toner and Bacon protocol wherein classical communications is replaced by nonlocal effects, so that Alice's measurements cause instantaneous effects on Bob's outputs. In the nonlocal version of Toner and Bacon's protocol, we get the same result again. We also demonstrate that the same approach is applicable to Svozil's protocol.
This paper demonstrates the capability to simulate EPR experiments in a realistic way (i.e.without transmission of information between the source and the detector) and confirms even more the Bell's theorem, by demonstrating that effectively non-local variables are required to violate the Bell's inequality.Unlike all EPR experiments, this modeling instead of simply noting the inadequacy of a local modeling proposes a new way of non-local idealization.These simulations work on spreadsheet by idealizing objects with a non-linear notion, the extended object.This allows to set up a new principle of locality (or non-locality) and a new meaning on the loopholes of EPR experiments.It sheds new light on several concepts of Quantum Mechanics (QM): the quantum states (would represent an equivalence class of many different indistinguishable objects seen as equivalent in terms of measurement), the wave function (would represent a probability on this equivalence class seen as a single set despite different probabilities of happening for the individual objects composing this equivalence class), the measurement (in our simulation, the measured object is not modified), the superposition of states (in our simulation, Schrödinger's cat is never both dead and alive).These simulations lead to several kinds of EPR experiments with violations of the Bell's inequalities with values different from the QM, allow to realize entanglements with more than 2 objects (whatever the number of Alice and Bob) or even with more than 2 results (beyond the only "+1" or "-1" outputs).Many questions remain to be explored in the physics domain on quantum phenomena (teleportation, encryption, quantum computing, etc.), but this theoretical approach also reveals the necessity of developing new non-linear tools in mathematics domain and seems to show that QM could finally be a limit case of a more fundamental nonlinear physics theory founded on these How to cite this paper: Le Corre, S.