Quantum and classical communication complexity of permutation-invariant functions

DOI10.4230/LIPICS.STACS.2024.39MaRDI QIDQ6902683zbMATH OpenFDO

Authors Ziyi Guan, Yunqi Huang, Penghui Yao, Zekun Ye

Publication date 10 November 2025

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

communication complexitylog-rank conjecturepermutation-invariant functionsquantum advantages

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Quantum and classical communication complexity of permutation-invariant functions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902683)