Bounds on oblivious multiparty quantum communication complexity

DOI10.1007/978-3-031-20624-5_39arXiv2210.15402OpenAlexW4312298511MaRDI QIDQ6164004

François Le Gall, Daiki Suruga

Publication date: 26 July 2023

Published in: LATIN 2022: Theoretical Informatics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2210.15402

zbMATH Keywords

multiparty communicationquantum complexity theoryquantum communication complexity

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Theory of computing (68Qxx) Discrete mathematics in relation to computer science (68Rxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Online algorithms. The state of the art
• On the distributional complexity of disjointness
• Algebraic methods in the congested clique
• The communication complexity of distributed task allocation
• Quantum Information Complexity
• The Pattern Matrix Method
• Multi-party Quantum Communication Complexity with Routed Messages
• The Probabilistic Communication Complexity of Set Intersection
• Near-Optimal Bounds on the Bounded-Round Quantum Communication Complexity of Disjointness
• Quantum communication complexity of symmetric predicates
• Communication Complexity
• Communication Complexity

This page was built for publication: Bounds on oblivious multiparty quantum communication complexity