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 条
  • [1] MATCHING UPPER BOUNDS ON SYMMETRIC PREDICATES IN QUANTUM COMMUNICATION COMPLEXITY
    Suruga, Daiki
    QUANTUM INFORMATION & COMPUTATION, 2024, 24 (11-12) : 917 - 931
  • [2] Quantum communication complexity of symmetric predicates
    Razborov, AA
    IZVESTIYA MATHEMATICS, 2003, 67 (01) : 145 - 159
  • [3] Lower bounds for quantum communication complexity
    Klauck, H
    42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 288 - 297
  • [4] Lower bounds for quantum communication complexity
    Klauck, Hartmut
    SIAM JOURNAL ON COMPUTING, 2007, 37 (01) : 20 - 46
  • [5] Upper bounds on the multiplicative complexity of symmetric Boolean functions
    Brandao, Luis T. A. N.
    Calik, Cagdas
    Sonmez Turan, Meltem
    Peralta, Rene
    CRYPTOGRAPHY AND COMMUNICATIONS-DISCRETE-STRUCTURES BOOLEAN FUNCTIONS AND SEQUENCES, 2019, 11 (06): : 1339 - 1362
  • [6] Upper bounds on the multiplicative complexity of symmetric Boolean functions
    Luís T. A. N. Brandão
    Çağdaş Çalık
    Meltem Sönmez Turan
    René Peralta
    Cryptography and Communications, 2019, 11 : 1339 - 1362
  • [7] Tighter upper bounds on the exact complexity of string matching
    Cole, R
    Hariharan, R
    SIAM JOURNAL ON COMPUTING, 1997, 26 (03) : 803 - 856
  • [8] ON THE EXACT COMPLEXITY OF STRING MATCHING - UPPER-BOUNDS
    GALIL, Z
    GIANCARLO, R
    SIAM JOURNAL ON COMPUTING, 1992, 21 (03) : 407 - 437
  • [9] Lower bounds on quantum multiparty communication complexity
    Lee, Troy
    Schechtman, Gideon
    Shraibman, Adi
    PROCEEDINGS OF THE 24TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, 2009, : 254 - +
  • [10] Upper bounds for the complexity of sequences generated by symmetric Boolean functions
    Merekin, YV
    DISCRETE APPLIED MATHEMATICS, 2001, 114 (1-3) : 227 - 231
12345