MATCHING UPPER BOUNDS ON SYMMETRIC PREDICATES IN QUANTUM COMMUNICATION COMPLEXITY

被引：0
|
作者：
Suruga, Daiki [1 ]
机构：
[1] Graduate School of Mathematics, Nagoya University Furocho, Chikusaku, Nagoya,464-8602, Japan
来源：
Quantum Information and Computation | 2024年 / 24卷 / 11-12期
关键词：
The author was partially supported by the MEXT Q-LEAP grant No. JPMXS0120319794. The author would like to take this opportunity to thank the Nagoya University Interdisci-plinary Frontier Fellowship supported by Nagoya University and [!text type='JS']JS[!/text]T; the establishment of university fellowships towards the creation of science technology innovation; Grant Number JPMJFS2120. The author also would like to thank Franu00E7ois Le Gall for his kindness and valuable comments and Ronald de Wolf for kind comments on an earlier draft of this paper. The author also would like to thank the anonymous reviewer for a careful review and valuable comments.The author was partially supported by the MEXT Q-LEAP grant No. JPMXS0120319794. The author would like to take this opportunity to thank the Nagoya University Interdisciplinary Frontier Fellowship supported by Nagoya University and [!text type='JS']JS[!/text]T; Grant Number JPMJFS2120. The author also would like to thank Franu00B8cois Le Gall for his kindness and valuable comments and Ronald de Wolf for kind comments on an earlier draft of this paper. The author also would like to thank the anonymous reviewer for a careful review and valuable comments;
D O I：
10.26421/QIC24.11-12-2
中图分类号：
学科分类号：
摘要：
引用
收藏
页码：917 / 931
相关论文
共 50 条
12345