The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Existem alguns resultados que mostram que as comunicações quânticas são mais poderosas do que as comunicações clássicas. Além disso, embora os estados quânticos emaranhados não forneçam informações extras, ao usar o emaranhamento anterior a complexidade da comunicação quântica de algumas funções é menor do que a complexidade da comunicação clássica. As comunicações com emaranhamento prévio podem ser consideradas uma espécie de modelo de moeda pública. Neste artigo, investigamos comunicações quânticas para múltiplas partes com emaranhamento anterior e mostramos que existe uma função de produto interno generalizada para k-parte tal que a complexidade da comunicação quântica é no máximo k bits, mas a complexidade clássica da comunicação precisa de pelo menos
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Takashi MIHARA, "Multi-Party Quantum Communication Complexity with Prior Entanglements" in IEICE TRANSACTIONS on Information,
vol. E84-D, no. 11, pp. 1548-1555, November 2001, doi: .
Abstract: There exist some results showing that quantum communications are more powerful than classical communications. Moreover, although quantum entangled states do not give extra information, by using prior entanglement the quantum communication complexity of some functions is less than the classical communication complexity. The communications with prior entanglement can be regarded as a type of public coin models. In this paper, we investigate quantum communications for multi-party with prior entanglement, and show that there exists a generalized inner product function for k-party such that the quantum communication complexity is at most k bits, but the classical communication complexity needs at least
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_11_1548/_p
Copiar
@ARTICLE{e84-d_11_1548,
author={Takashi MIHARA, },
journal={IEICE TRANSACTIONS on Information},
title={Multi-Party Quantum Communication Complexity with Prior Entanglements},
year={2001},
volume={E84-D},
number={11},
pages={1548-1555},
abstract={There exist some results showing that quantum communications are more powerful than classical communications. Moreover, although quantum entangled states do not give extra information, by using prior entanglement the quantum communication complexity of some functions is less than the classical communication complexity. The communications with prior entanglement can be regarded as a type of public coin models. In this paper, we investigate quantum communications for multi-party with prior entanglement, and show that there exists a generalized inner product function for k-party such that the quantum communication complexity is at most k bits, but the classical communication complexity needs at least
keywords={},
doi={},
ISSN={},
month={November},}
Copiar
TY - JOUR
TI - Multi-Party Quantum Communication Complexity with Prior Entanglements
T2 - IEICE TRANSACTIONS on Information
SP - 1548
EP - 1555
AU - Takashi MIHARA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2001
AB - There exist some results showing that quantum communications are more powerful than classical communications. Moreover, although quantum entangled states do not give extra information, by using prior entanglement the quantum communication complexity of some functions is less than the classical communication complexity. The communications with prior entanglement can be regarded as a type of public coin models. In this paper, we investigate quantum communications for multi-party with prior entanglement, and show that there exists a generalized inner product function for k-party such that the quantum communication complexity is at most k bits, but the classical communication complexity needs at least
ER -