ABSTRACT
When playing the boolean game (δ,f), two players, upon reception of respective inputs x and y, must respectively output a and b satisfying δ(a, b)=f(x, y), in absence of any communication. It is known that, for δ(a, b)=a ⊕ b, the ability for the players to use entangled quantum bits (qbits) helps. In this paper, we show that, for δ different from the exclusive-or operator, quantum correlations do not help. This result is an invitation to revisit the theory of distributed checking, a.k.a. distributed verification, currently sticked to the usage of decision functions δ based on the AND-operator, hence potentially preventing us from using the potential benefit of quantum effects.
- H. Arfaoui and P. Fraigniaud. What can be computed without communication? 19th Int. Colloquium on Structural Information and Communication Complexity (SIROCCO), LNCS 7355, pp 135--146, 2012. Google ScholarDigital Library
- J. Barrett, N. Linden, S. Massar, S. Pironio, S. Popescu, and D. Roberts. Nonlocal correlations as an information-theoretic resource. Physical Review A 71(2):1--11, 2005.Google ScholarCross Ref
- J. Barrett and S. Pironio. Popescu-Rohrlich correlations as a unit of nonlocality. Phys. Rev. Lett. 95(14), 2005.Google ScholarCross Ref
- J. S. Bell. On the Einstein-Podolsky-rosen paradox. Physics, 1(3):195--200, 1964.Google ScholarCross Ref
- B. S. Cirel'son. Quantum generalizations of bell's inequality. Letters in Math. Phys., 4(2):93--100, 1980.Google ScholarCross Ref
- J. F. Clauser, M. A. Horne, A. Shimony, and R. A. Holt. Proposed experiment to test local hidden-variable theories. Physical Review Letters, 23(15):880--884, 1969.Google ScholarCross Ref
- A. Das Sarma, S. Holzer, L. Kor, A. Korman, D. Nanongkai, G. Pandurangan, D. Peleg, and R. Wattenhofer. Distributed verification and hardness of distributed approximation. 43rd ACM Symp. on Theory of Computing (STOC), 2011. Google ScholarDigital Library
- F. Dupuis, N. Gisin, A. Hasidim, A. Allan Méthot, and H. Pilpel. No nonlocal box is universal. J. Math. Phys. 48(082107), 2007.Google Scholar
- A. Einstein, B. Podolsky, and N. Rosen. Can quantum-mechanical description of physical reality be considered complete? Physical Review, 47(10):777--780, 1935.Google ScholarCross Ref
- P. Fraigniaud, A. Korman, and D. Peleg. Local distributed decision. 52nd Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 708--717, 2011. Google ScholarDigital Library
- P. Fraigniaud, S. Rajsbaum, and C. Travers. Locality and checkability in wait-free computing. 25th International Symposium on Distributed Computing (DISC), pp 333--347, 2011. Google ScholarDigital Library
- P. Fraigniaud, S. Rajsbaum, and C. Travers. Universal distributed checkers and orientation-detection tasks. Submitted, 2012.Google Scholar
- M. Naor and L. Stockmeyer. What can be computed locally? SIAM J. Comput. 24(6): 1259--1277 (1995). Google ScholarDigital Library
- S. Popescu and D. Rohrlich. Quantum nonlocality as an axiom. Foundations of Physics, 24(3):379--385, 1994.Google ScholarCross Ref
Index Terms
- Brief announcement: what can be computed without communication?
Recommendations
On the power of non-local boxes
A non-local box is a virtual device that has the following property: given that Alice inputs a bit at her end of the device and that Bob does likewise, it produces two bits, one at Alice's end and one at Bob's end, such that the XOR of the outputs is ...
Strict hierarchy among Bell Theorems
As demonstrated by John Bell, quantum mechanics exhibits correlations in spacelike separated bipartite systems that are impossible to reproduce by classical means. There are three levels of ''Bell Theorems'', depending on which aspects of the quantum ...
A New Error-Modeling of Hardy’s Paradox for Superconducting Qubits and Its Experimental Verification
Hardy’s paradox (equivalently, Hardy’s non-locality or Hardy’s test) [Phys. Rev. Lett. 68, 2981 (1992)] is used to show non-locality without inequalities, and it has been tested several times using optical circuits. We, for the first time, ...
Comments