Document Open Access Logo

Quantum and Classical Communication Complexity of Permutation-Invariant Functions

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

PDF
Thumbnail PDF

File

LIPIcs.STACS.2024.39.pdf
  • Filesize: 0.74 MB
  • 19 pages

Document Identifiers

Author Details

Ziyi Guan
  • EPFL, Lausanne, Switzerland
Yunqi Huang
  • University of Technology Sydney, Australia
Penghui Yao
  • State Key Laboratory for Novel Software Technology, Nanjing University, China
  • Hefei National Laboratory, China
Zekun Ye
  • State Key Laboratory for Novel Software Technology, Nanjing University, China

Funding

  • Guan, Ziyi: partially supported by the Ethereum Foundation.
  • Yao, Penghui: supported by National Natural Science Foundation of China (Grant No. 62332009, 12347104, 61972191) and Innovation Program for Quantum Science and Technology (Grant No. 2021ZD0302901).
  • Ye, Zekun: supported by National Natural Science Foundation of China (Grant No. 62332009, 12347104, 61972191) and Innovation Program for Quantum Science and Technology (Grant No. 2021ZD0302901).

Cite As Get BibTex

Ziyi Guan, Yunqi Huang, Penghui Yao, and Zekun Ye. Quantum and Classical Communication Complexity of Permutation-Invariant Functions. In 41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024). Leibniz International Proceedings in Informatics (LIPIcs), Volume 289, pp. 39:1-39:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2024) https://doi.org/10.4230/LIPIcs.STACS.2024.39

Abstract

This paper gives a nearly tight characterization of the quantum communication complexity of the permutation-invariant Boolean functions. With such a characterization, we show that the quantum and randomized communication complexity of the permutation-invariant Boolean functions are quadratically equivalent (up to a logarithmic factor). Our results extend a recent line of research regarding query complexity [Scott Aaronson and Andris Ambainis, 2014; André Chailloux, 2019; Shalev Ben-David et al., 2020] to communication complexity, showing symmetry prevents exponential quantum speedups.
Furthermore, we show the Log-rank Conjecture holds for any non-trivial total permutation-invariant Boolean function. Moreover, we establish a relationship between the quantum/classical communication complexity and the approximate rank of permutation-invariant Boolean functions. This implies the correctness of the Log-approximate-rank Conjecture for permutation-invariant Boolean functions in both randomized and quantum settings (up to a logarithmic factor).

Subject Classification

ACM Subject Classification
  • Theory of computation → Models of computation
Keywords
  • Communication complexity
  • Permutation-invariant functions
  • Log-rank Conjecture
  • Quantum advantages

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Related Versions

References

  1. Scott Aaronson. How much structure is needed for huge quantum speedups? arXiv preprint, 2022. URL: https://arxiv.org/abs/2209.06930.
  2. Scott Aaronson and Andris Ambainis. The need for structure in quantum speedups. Theory of Computing, 10:133-166, 2014. URL: https://doi.org/10.4086/toc.2014.v010a006.
  3. Scott Aaronson and Shalev Ben-David. Sculpting quantum speedups. In Proceedings of the 31st Conference on Computational Complexity, volume 50, pages 26:1-26:28, 2016. URL: https://doi.org/10.4230/LIPIcs.CCC.2016.26.
  4. Scott Aaronson and Yaoyun Shi. Quantum lower bounds for the collision and the element distinctness problems. Journal of ACM, 51(4):595-605, 2004. URL: https://doi.org/10.1145/1008731.1008735.
  5. Anurag Anshu, Naresh Goud Boddu, and Dave Touchette. Quantum log-approximate-rank conjecture is also false. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 982-994, 2019. URL: https://doi.org/10.1109/FOCS.2019.00063.
  6. Anurag Anshu, Dave Touchette, Penghui Yao, and Nengkun Yu. Exponential separation of quantum communication and classical information. In Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing, pages 277-288. ACM, 2017. URL: https://doi.org/10.1145/3055399.3055401.
  7. Ziv Bar-Yossef, T. S. Jayram, and Iordanis Kerenidis. Exponential separation of quantum and classical one-way communication complexity. In Proceedings of the 36th Annual ACM Symposium on Theory of Computing, pages 128-137. ACM, 2004. URL: https://doi.org/10.1145/1007352.1007379.
  8. Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, and Ronald de Wolf. Quantum lower bounds by polynomials. Journal of the ACM, 48(4):778-797, 2001. URL: https://doi.org/10.1145/502090.502097.
  9. Aleksandrs Belovs, Arturo Castellanos, François Le Gall, Guillaume Malod, and Alexander A. Sherstov. Quantum communication complexity of distribution testing. Quantum Information and Computation, 21(15&16):1261-1273, 2021. URL: https://doi.org/10.26421/QIC21.15-16-1.
  10. Shalev Ben-David. The structure of promises in quantum speedups. In Proceedings of the 11th Conference on the Theory of Quantum Computation, Communication and Cryptography, volume 61, pages 7:1-7:14, 2016. URL: https://doi.org/10.4230/LIPIcs.TQC.2016.7.
  11. Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, and Daochen Wang. Symmetries, graph properties, and quantum speedups. In Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, pages 649-660, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00066.
  12. Eli Ben-Sasson, Shachar Lovett, and Noga Ron-Zewi. An additive combinatorics approach relating rank to communication complexity. J. ACM, 61(4), 2014. URL: https://doi.org/10.1145/2629598.
  13. Gilles Brassard, Peter Høyer, Michele Mosca, and Alain Tapp. Quantum amplitude amplification and estimation. Contemporary Mathematics, 305:53-74, 2002. Google Scholar
  14. Sergey Bravyi, David Gosset, Robert König, and Marco Tomamichel. Quantum advantage with noisy shallow circuits in 3D. In Proccedings of the 60th IEEE Annual Symposium on Foundations of Computer Science, pages 995-999, 2019. URL: https://doi.org/10.1109/FOCS.2019.00064.
  15. Harry Buhrman and Ronald de Wolf. Communication complexity lower bounds by polynomials. In Proceedings of the 16th Annual IEEE Conference on Computational Complexity, pages 120-130, 2001. URL: https://doi.org/10.1109/CCC.2001.933879.
  16. André Chailloux. A note on the quantum query complexity of permutation symmetric functions. In Proceedings of the 10th Innovations in Theoretical Computer Science Conference, volume 124, pages 19:1-19:7, 2019. URL: https://doi.org/10.4230/LIPIcs.ITCS.2019.19.
  17. Amit Chakrabarti and Oded Regev. An optimal lower bound on the communication complexity of gap-hamming-distance. In Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, pages 51-60, 2011. URL: https://doi.org/10.1145/1993636.1993644.
  18. Amit Chakrabarti and Oded Regev. An optimal lower bound on the communication complexity of Gap-Hamming-Distance. SIAM Journal on Computing, 41(5):1299-1317, 2012. URL: https://doi.org/10.1137/120861072.
  19. Arkadev Chattopadhyay, Nikhil S. Mande, and Suhail Sherif. The log-approximate-rank conjecture is false. J. ACM, 67(4), June 2020. URL: https://doi.org/10.1145/3396695.
  20. Sitan Chen, Jordan Cotler, Hsin-Yuan Huang, and Jerry Li. Exponential separations between learning with and without quantum memory. In Proccedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, pages 574-585, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00063.
  21. Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, and Ronald de Wolf. Exponential separations for one-way quantum communication complexity, with applications to cryptography. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pages 516-525. ACM, 2007. URL: https://doi.org/10.1145/1250790.1250866.
  22. Dmitry Gavinsky and Pavel Pudlák. Exponential separation of quantum and classical non-interactive multi-party communication complexity. In Proceedings of the 23rd Annual IEEE Conference on Computational Complexity, pages 332-339. IEEE Computer Society, 2008. URL: https://doi.org/10.1109/CCC.2008.27.
  23. Badih Ghazi, Pritish Kamath, and Madhu Sudan. Communication complexity of permutation-invariant functions. In Proceedings of the 27th Annual ACM-SIAM Symposium on Discrete Algorithms, pages 1902-1921, 2016. URL: https://doi.org/10.1137/1.9781611974331.ch134.
  24. Daniel Grier and Luke Schaeffer. Interactive shallow clifford circuits: quantum advantage against NC¹ and beyond. In Proccedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, pages 875-888, 2020. URL: https://doi.org/10.1145/3357713.3384332.
  25. L. K. Grover. A fast quantum mechanical algorithm for database search. In Proceedings of the 28th IEEE Annual Symposium on Theory of Computing, pages 212-219, 1996. URL: https://doi.org/10.1145/237814.237866.
  26. Ziyi Guan, Yunqi Huang, Penghui Yao, and Zekun Ye. Quantum and classical communication complexity of permutation-invariant functions. arXiv preprint, 2024. URL: https://arxiv.org/abs/2401.00454.
  27. Yassine Hamoudi and Frédéric Magniez. Quantum chebyshev’s inequality and applications. In Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, volume 132, pages 69:1-69:16, 2019. URL: https://doi.org/10.4230/LIPIcs.ICALP.2019.69.
  28. Wei Huang, Yaoyun Shi, Shengyu Zhang, and Yufan Zhu. The communication complexity of the Hamming distance problem. Information Processing Letter, 99(4):149-153, 2006. URL: https://doi.org/10.1016/j.ipl.2006.01.014.
  29. John Kallaugher. A quantum advantage for a natural streaming problem. In Proccedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, pages 897-908, 2021. URL: https://doi.org/10.1109/FOCS52979.2021.00091.
  30. Alexander Knop, Shachar Lovett, Sam McGuire, and Weiqiang Yuan. Log-rank and lifting for and-functions. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 197-208, 2021. URL: https://doi.org/10.1145/3406325.3450999.
  31. L. Lovasz and M. Saks. Lattices, mobius functions and communications complexity. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science, pages 81-90, 1988. URL: https://doi.org/10.1109/SFCS.1988.21924.
  32. Shachar Lovett. Communication is bounded by root of rank. J. ACM, 63(1), 2016. URL: https://doi.org/10.1145/2724704.
  33. Ashley Montanaro. A new exponential separation between quantum and classical one-way communication complexity. Quantum Information and Computation, 11(7&8):574-591, 2011. URL: https://doi.org/10.26421/QIC11.7-8-3.
  34. Ramamohan Paturi. On the degree of polynomials that approximate symmetric boolean functions (preliminary version). In Proceedings of the 24th Annual ACM Symposium on Theory of Computing, pages 468-474. ACM, 1992. URL: https://doi.org/10.1145/129712.129758.
  35. Ran Raz. Exponential separation of quantum and classical communication complexity. In Proceedings of the Thirty-First Annual ACM Symposium on Theory of Computing, pages 358-367. ACM, 1999. URL: https://doi.org/10.1145/301250.301343.
  36. Alexander A Razborov. Quantum communication complexity of symmetric predicates. Izvestiya: Mathematics, 67(1):145, 2003. URL: https://doi.org/10.1070/IM2003v067n01ABEH000422.
  37. Alexander A. Sherstov. The pattern matrix method. SIAM Journal of Computing, 40(6):1969-2000, 2011. URL: https://doi.org/10.1137/080733644.
  38. Alexander A. Sherstov. The communication complexity of gap Hamming distance. Theory of Computing, 8(1):197-208, 2012. URL: https://doi.org/10.4086/toc.2012.v008a008.
  39. Peter W Shor. Algorithms for quantum computation: discrete logarithms and factoring. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 124-134, November 1994. URL: https://doi.org/10.1109/SFCS.1994.365700.
  40. Daniel R. Simon. On the power of quantum computation. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 116-123, November 1994. URL: https://doi.org/10.1109/SFCS.1994.365701.
  41. Makrand Sinha and Ronald de Wolf. Exponential separation between quantum communication and logarithm of approximate rank. In 2019 IEEE 60th Annual Symposium on Foundations of Computer Science (FOCS), pages 966-981, 2019. URL: https://doi.org/10.1109/FOCS.2019.00062.
  42. Daiki Suruga. Matching upper bounds on symmetric predicates in quantum communication complexity. arXiv preprint, 2006. URL: https://arxiv.org/abs/2301.00370.
  43. Thomas Vidick. A concentration inequality for the overlap of a vector on a large set, with application to the communication complexity of the Gap-Hamming-Distance problem. Chicago Journal of Theoretical Computer Science, 2012, 2012. URL: http://cjtcs.cs.uchicago.edu/articles/2012/1/contents.html.
  44. Takashi Yamakawa and Mark Zhandry. Verifiable quantum advantage without structure. In Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, pages 69-74, 2022. URL: https://doi.org/10.1109/FOCS54457.2022.00014.
  45. Zhiqiang Zhang and Yaoyun Shi. Communication complexities of symmetric XOR functions. Quantum Information and Computation, 9(3&4):255-263, 2009. URL: https://doi.org/10.26421/QIC9.3-4-5.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact