首页|Constant-round quantum advantage in communication complexity for total functions

Constant-round quantum advantage in communication complexity for total functions

Atsuya Hasegawa François Le Gall

来源：

Arxiv

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-10-12)[2026-10-17].https://arxiv.org/abs/2608.19787.

学科分类

物理学

首发时间： 2026-10-12

下载量：0

点击量：49

段落导航