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 条
  • [21] LOWER BOUNDS ON COMMUNICATION COMPLEXITY
    DURIS, P
    GALIL, Z
    SCHNITGER, G
    INFORMATION AND COMPUTATION, 1987, 73 (01) : 1 - 22
  • [22] Upper bounds for totally symmetric sets
    Kordek, Kevin
    Li, Lily Qiao
    Partin, Caleb
    INVOLVE, A JOURNAL OF MATHEMATICS, 2021, 14 (05): : 853 - 870
  • [23] Upper Bounds on Matching Families in Zpqn
    Chee, Yeow Meng
    Ling, San
    Wang, Huaxiong
    Zhang, Liang Feng
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (08) : 5131 - 5139
  • [24] Lower Bounds on the Deterministic and Quantum Communication Complexity of Hamming-Distance Problems
    Ambainis, Andris
    Gasarch, William
    Srinivasan, Aravind
    Utis, Andrey
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2015, 7 (03)
  • [25] Lower bounds for quantum-inspired classical algorithms via communication complexity
    Mande, Nikhil S.
    Shao, Changpeng
    QUANTUM, 2025, 9
  • [26] Upper bounds on trellis complexity of lattices
    Tarokh, V
    Vardy, A
    IEEE TRANSACTIONS ON INFORMATION THEORY, 1997, 43 (04) : 1294 - 1300
  • [27] New upper bounds on the linear complexity
    Caballero-Gil, P
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 2000, 39 (3-4) : 31 - 38
  • [28] Algorithms for Sat and Upper Bounds on Their Complexity
    M. A. Vsemirnov
    E. A. Hirsch
    E. Ya. Dantsin
    S. V. Ivanov
    Journal of Mathematical Sciences, 2003, 118 (2) : 4948 - 4962
  • [29] Tight bounds for the multiplicative complexity of symmetric functions
    Boyar, Joan
    Peralta, Rene
    THEORETICAL COMPUTER SCIENCE, 2008, 396 (1-3) : 223 - 246
  • [30] Tight Bounds on Communication Complexity of Symmetric XOR Functions in One-Way and SMP Models
    Leung, Ming Lam
    Li, Yang
    Zhang, Shengyu
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 403 - 408
12345