Reducing the communication complexity with quantum entanglement
量子物理
2019-08-17 v1
摘要
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.
引用
@article{arxiv.quant-ph/0012052,
title = {Reducing the communication complexity with quantum entanglement},
author = {Peng Xue and Yun-Feng Huang and Yong-Sheng Zhang and Chuan-Feng Li and Guang-Can Guo},
journal= {arXiv preprint arXiv:quant-ph/0012052},
year = {2019}
}
备注
4 Pages, 2 Figures