{
  "id": "quant-ph/0012052",
  "version": "v1",
  "published": "2000-12-13T06:17:02.000Z",
  "updated": "2000-12-13T06:17:02.000Z",
  "title": "Reducing the communication complexity with quantum entanglement",
  "authors": [
    "Peng Xue",
    "Yun-Feng Huang",
    "Yong-Sheng Zhang",
    "Chuan-Feng Li",
    "Guang-Can Guo"
  ],
  "comment": "4 Pages, 2 Figures",
  "journal": "Phys. Rev. A 64 (2001) 032304.",
  "doi": "10.1103/PhysRevA.64.032304",
  "categories": [
    "quant-ph"
  ],
  "abstract": "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.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2000-12-13T06:17:02.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "quantum entanglement",
      "probabilistic two-party communication complexity scenario",
      "simple all-optical implementation",
      "prior nonmaximally entangled state",
      "classical random correlations"
    ],
    "tags": [
      "journal article"
    ],
    "publication": {
      "publisher": "APS",
      "journal": "Phys. Rev. A"
    },
    "note": {
      "typesetting": "TeX",
      "pages": 4,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}