Quantum Weakly Nondeterministic Communication Complexity
量子物理
2021-10-05 v3 计算复杂性
摘要
We study the weakest model of quantum nondeterminism in which a classical proof has to be checked with probability one by a quantum protocol. We show the first separation between classical nondeterministic communication complexity and this model of quantum nondeterministic communication complexity for a total function. This separation is quadratic.
引用
@article{arxiv.quant-ph/0511025,
title = {Quantum Weakly Nondeterministic Communication Complexity},
author = {Francois Le Gall},
journal= {arXiv preprint arXiv:quant-ph/0511025},
year = {2021}
}
备注
12 pages. v3: minor corrections