skip to main content
10.1145/2332432.2332446acmconferencesArticle/Chapter ViewAbstractPublication PagespodcConference Proceedingsconference-collections
abstract

Brief announcement: what can be computed without communication?

Published:16 July 2012Publication History

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)=ab, 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.

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. 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 ScholarGoogle ScholarCross RefCross Ref
  3. J. Barrett and S. Pironio. Popescu-Rohrlich correlations as a unit of nonlocality. Phys. Rev. Lett. 95(14), 2005.Google ScholarGoogle ScholarCross RefCross Ref
  4. J. S. Bell. On the Einstein-Podolsky-rosen paradox. Physics, 1(3):195--200, 1964.Google ScholarGoogle ScholarCross RefCross Ref
  5. B. S. Cirel'son. Quantum generalizations of bell's inequality. Letters in Math. Phys., 4(2):93--100, 1980.Google ScholarGoogle ScholarCross RefCross Ref
  6. 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 ScholarGoogle ScholarCross RefCross Ref
  7. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle Scholar
  9. 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 ScholarGoogle ScholarCross RefCross Ref
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  12. P. Fraigniaud, S. Rajsbaum, and C. Travers. Universal distributed checkers and orientation-detection tasks. Submitted, 2012.Google ScholarGoogle Scholar
  13. M. Naor and L. Stockmeyer. What can be computed locally? SIAM J. Comput. 24(6): 1259--1277 (1995). Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. S. Popescu and D. Rohrlich. Quantum nonlocality as an axiom. Foundations of Physics, 24(3):379--385, 1994.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Brief announcement: what can be computed without communication?

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      PODC '12: Proceedings of the 2012 ACM symposium on Principles of distributed computing
      July 2012
      410 pages
      ISBN:9781450314503
      DOI:10.1145/2332432

      Copyright © 2012 Authors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 16 July 2012

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • abstract

      Acceptance Rates

      Overall Acceptance Rate740of2,477submissions,30%

      Upcoming Conference

      PODC '24
    • Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader