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 条
  • [11] New upper bounds on the Boolean circuit complexity of symmetric functions
    Demenkov, E.
    Kojevnikov, A.
    Kulikov, A.
    Yaroslavtsev, G.
    INFORMATION PROCESSING LETTERS, 2010, 110 (07) : 264 - 267
  • [12] Upper bounds on quantum uncertainty products and complexity measures
    Guerrero, Angel
    Sanchez-Moreno, Pablo
    Dehesa, Jesus S.
    PHYSICAL REVIEW A, 2011, 84 (04):
  • [13] Quantum multiparty communication complexity and circuit lower bounds
    Kerenidis, Iordanis
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 306 - 317
  • [14] Quantum multiparty communication complexity and circuit lower bounds
    Kerenidis, Iordanis
    MATHEMATICAL STRUCTURES IN COMPUTER SCIENCE, 2009, 19 (01) : 119 - 132
  • [15] Complexity bounds on general hard-core predicates
    Goldmann, M
    Näslund, M
    Russell, A
    JOURNAL OF CRYPTOLOGY, 2001, 14 (03) : 177 - 195
  • [16] Complexity Bounds on General Hard-Core Predicates
    Mikael Goldmann
    Mats Näslund
    Alexander Russell
    Journal of Cryptology, 2001, 14 : 177 - 195
  • [17] Upper bounds on the communication complexity of optimally resilient cryptographic multiparty computation
    Hirt, M
    Nielsen, JB
    ADVANCES IN CRYPTOLOGY ASIACRYPT 2005, 2005, 3788 : 79 - 99
  • [18] Lower bounds on the communication complexity of two-party (quantum) processes
    Montina, Alberto
    Wolf, Stefan
    2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1484 - 1488
  • [19] New bounds on classical and quantum one-way communication complexity
    Jain, Rahul
    Zhang, Shengyu
    THEORETICAL COMPUTER SCIENCE, 2009, 410 (26) : 2463 - 2477
  • [20] Lower Bounds in Communication Complexity
    Lee, Troy
    Shraibman, Adi
    FOUNDATIONS AND TRENDS IN THEORETICAL COMPUTER SCIENCE, 2007, 3 (04): : 263 - 399
12345