dorsal/arxiv
View SchemaReducing the communication complexity with quantum entanglement
| Authors | Peng Xue, Yun-Feng Huang, Yong-Sheng Zhang, Chuan-Feng Li, Guang-Can Guo |
|---|---|
| Categories | |
| ArXiv ID | quant-ph/0012052 |
| URL | https://arxiv.org/abs/quant-ph/0012052 |
| DOI | 10.1103/PhysRevA.64.032304 |
| Journal | Phys. Rev. A 64 (2001) 032304. |
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.
{
"annotation_id": "6a121f02-678f-4931-9fb9-fee9fda68d0b",
"date_created": "2026-03-02T18:01:42.547000Z",
"date_modified": "2026-03-02T18:01:42.547000Z",
"file_hash": "924001a6acfa731147c4144d75efb3d46df81354e7bf75b2e4f2a46b48af87e7",
"private": false,
"record": {
"abstract": "We propose a probabilistic two-party communication complexity scenario with a\nprior nonmaximally entangled state, which results in less communication than\nthat is required with only classical random correlations. A simple all-optical\nimplementation of this protocol is presented and demonstrates our conclusion.",
"arxiv_id": "quant-ph/0012052",
"authors": [
"Peng Xue",
"Yun-Feng Huang",
"Yong-Sheng Zhang",
"Chuan-Feng Li",
"Guang-Can Guo"
],
"categories": [
"quant-ph"
],
"doi": "10.1103/PhysRevA.64.032304",
"journal_ref": "Phys. Rev. A 64 (2001) 032304.",
"title": "Reducing the communication complexity with quantum entanglement",
"url": "https://arxiv.org/abs/quant-ph/0012052"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "dafc4eb2-7153-4af7-a2aa-013deb7e50a8",
"id": "arXiv Dataset IDs",
"type": "Model",
"variant": "snapshot-2026-03-01",
"version": "0.1.0"
},
"user_id": 1000002
}