Constant-round quantum advantage in communication complexity for total functions
Atsuya Hasegawa François Le Gall
作者信息
Abstract
We show that there exists a total function for which there is a polynomial gap between the randomized and the constant-round quantum communication complexity. Previously, such a separation was known only for quantum protocols using polynomially many rounds.引用本文复制引用
Atsuya Hasegawa,François Le Gall.Constant-round quantum advantage in communication complexity for total functions[EB/OL].(2026-08-20)[2026-09-01].https://arxiv.org/abs/2608.19787.学科分类
通信
|国家预印本平台