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 条
  • [41] Upper bounds on the depth of symmetric Boolean functions
    Sergeev I.S.
    Moscow University Computational Mathematics and Cybernetics, 2013, 37 (4) : 195 - 201
  • [42] Near-optimal bounds on bounded-round quantum communication complexity of disjointness
    Braverman, Mark
    Garg, Ankit
    Ko, Young Kun
    Mao, Jieming
    Touchette, Dave
    2015 IEEE 56TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 2015, : 773 - 791
  • [43] NEAR-OPTIMAL BOUNDS ON THE BOUNDED-ROUND QUANTUM COMMUNICATION COMPLEXITY OF DISJOINTNESS
    Braverman, Mark
    Garg, Ankit
    Ko, Young Kun
    Mao, Jieming
    Touchette, Dave
    SIAM JOURNAL ON COMPUTING, 2018, 47 (06) : 2277 - 2314
  • [44] LOWER BOUNDS ON QUANTUM QUERY COMPLEXITY
    Toran, Jacobo
    Hoyer, Peter
    Spalek, Robert
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (87): : 78 - 103
  • [45] Complexity and Capacity Bounds for Quantum Channels
    Levene, Rupert H.
    Paulsen, Vern I.
    Todorov, Ivan G.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2018, 64 (10) : 6917 - 6928
  • [46] Bandwidth Upper Bounds for Matching Coupled Loads
    Nie, Ding
    Hochwald, Bertrand
    2015 IEEE INTERNATIONAL SYMPOSIUM ON ANTENNAS AND PROPAGATION & USNC/URSI NATIONAL RADIO SCIENCE MEETING, 2015, : 1394 - 1395
  • [47] UPPER BOUNDS FOR THE COMPLEXITY OF TORUS KNOT COMPLEMENTS
    Fominykh, Evgeny
    Wiest, Bert
    JOURNAL OF KNOT THEORY AND ITS RAMIFICATIONS, 2013, 22 (10)
  • [48] Upper bounds for the complexity of sparse and tally descriptions
    Arvind, V.
    Köbler, J.
    Mundhenk, M.
    Theory of Computing Systems, 1996, 29 (01): : 63 - 94
  • [49] Upper bounds for the complexity of sparse and tally descriptions
    Arvind, V
    Kobler, J
    Mundhenk, M
    MATHEMATICAL SYSTEMS THEORY, 1996, 29 (01): : 63 - 94
  • [50] Classical lower bounds from quantum upper bounds
    Ben-David, Shalev
    Bouland, Adam
    Garg, Ankit
    Kothari, Robin
    2018 IEEE 59TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2018, : 339 - 349
12345