Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function
量子物理
2022-03-29 v1 计算复杂性
摘要
We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently by Kerenidis and Raz [KR06]. Our version of the result gives an example in the bounded storage model of cryptography, where the key is secure if the adversary has a certain amount of classical storage, but is completely insecure if he has a similar amount of quantum storage.
引用
@article{arxiv.quant-ph/0607174,
title = {Exponential Separation of Quantum and Classical One-Way Communication Complexity for a Boolean Function},
author = {Dmytro Gavinsky and Julia Kempe and Ronald de Wolf},
journal= {arXiv preprint arXiv:quant-ph/0607174},
year = {2022}
}
备注
8 pages, no figures