Document Open Access Logo

On the Fine-Grained Query Complexity of Symmetric Functions

Authors Supartha Podder, Penghui Yao, Zekun Ye

PDF

File

Thumbnail PDF
PDF
LIPIcs.ISAAC.2023.55.pdf
  • Filesize: 0.72 MB
  • 18 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Theory of computation → Models of computation
Keywords
  • Query complexity
  • Symmetric functions
  • Quantum advantages

Metrics

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

Abstract

Watrous conjectured that the randomized and quantum query complexities of symmetric functions are polynomially equivalent, which was resolved by Ambainis and Aaronson [Scott Aaronson and Andris Ambainis, 2014], and was later improved in [André Chailloux, 2019; Shalev Ben-David et al., 2020]. This paper explores a fine-grained version of the Watrous conjecture, including the randomized and quantum algorithms with success probabilities arbitrarily close to 1/2. Our contributions include the following:  
1) An analysis of the optimal success probability of quantum and randomized query algorithms of two fundamental partial symmetric Boolean functions given a fixed number of queries. We prove that for any quantum algorithm computing these two functions using T queries, there exist randomized algorithms using poly(T) queries that achieve the same success probability as the quantum algorithm, even if the success probability is arbitrarily close to 1/2. These two classes of functions are instrumental in analyzing general symmetric functions. 
2) We establish that for any total symmetric Boolean function f, if a quantum algorithm uses T queries to compute f with success probability 1/2+β, then there exists a randomized algorithm using O(T²) queries to compute f with success probability 1/2 + Ω(δβ²) on a 1-δ fraction of inputs, where β,δ can be arbitrarily small positive values. As a corollary, we prove a randomized version of Aaronson-Ambainis Conjecture [Scott Aaronson and Andris Ambainis, 2014] for total symmetric Boolean functions in the regime where the success probability of algorithms can be arbitrarily close to 1/2. 
3) We present polynomial equivalences for several fundamental complexity measures of partial symmetric Boolean functions. Specifically, we first prove that for certain partial symmetric Boolean functions, quantum query complexity is at most quadratic in approximate degree for any error arbitrarily close to 1/2. Next, we show exact quantum query complexity is at most quadratic in degree. Additionally, we give the tight bounds of several complexity measures, indicating their polynomial equivalence. Conversely, we exhibit an exponential separation between randomized and exact quantum query complexity for certain partial symmetric Boolean functions.

Cite As Get BibTex

Supartha Podder, Penghui Yao, and Zekun Ye. On the Fine-Grained Query Complexity of Symmetric Functions. In 34th International Symposium on Algorithms and Computation (ISAAC 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 283, pp. 55:1-55:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2023) https://doi.org/10.4230/LIPIcs.ISAAC.2023.55

Author Details

Supartha Podder
  • Department of Computer Science, Stony Brook University, New York, NY, USA
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

  • Podder, Supartha: supported by US National Science Foundation (award no 1954311).
  • Yao, Penghui: supported by National Natural Science Foundation of China (Grant No. 62332009, 61972191) and Innovation Program for Quantum Science and Technology (Grant No. 2021ZD0302900).
  • Ye, Zekun: supported by National Natural Science Foundation of China (Grant No. 62332009, 61972191) and Innovation Program for Quantum Science and Technology (Grant No. 2021ZD0302900).

References

  1. 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.
  2. Scott Aaronson and Andris Ambainis. Forrelation: A problem that optimally separates quantum from classical computing. SIAM Journal on Computing, 47(3):982-1038, 2018. URL: https://doi.org/10.1137/15M1050902.
  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, Shalev Ben-David, Robin Kothari, Shravas Rao, and Avishay Tal. Degree vs. approximate degree and quantum implications of Huang’s sensitivity theorem. In Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1330-1342. ACM, 2021. URL: https://doi.org/10.1145/3406325.3451047.
  5. Scott Aaronson, Robin Kothari, William Kretschmer, and Justin Thaler. Quantum lower bounds for approximate counting via Laurent polynomials. In Proceedings of the 35th Computational Complexity Conference, pages 7:1-7:47, 2020. URL: https://doi.org/10.4230/LIPIcs.CCC.2020.7.
  6. Andris Ambainis and Janis Iraids. Optimal one-shot quantum algorithm for EQUALITY and AND. Baltic Journal of Modern Computing, 4(4), 2016. URL: https://doi.org/10.22364/bjmc.2016.4.4.09.
  7. Arturs Backurs and Mohammad Bavarian. On the sum of L1 influences. In Proceedings of the IEEE 29th Conference on Computational Complexity, pages 132-143, 2014. URL: https://doi.org/10.1109/CCC.2014.21.
  8. Nikhil Bansal and Makrand Sinha. k-Forrelation optimally separates quantum and classical query complexity. In Proccedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1303-1316, 2021. URL: https://doi.org/10.1145/3406325.3451040.
  9. 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.
  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. Lecture 6: The polynomial method. https://cs.uwaterloo.ca/~s4bendav/CS867QIC890/CS867QIC890W21week4notes.pdf, 2021.
  12. 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.
  13. Gilles Brassard, Peter Høyer, and Alain Tapp. Quantum cryptanalysis of hash and claw-free functions. In LATIN 1998: Theoretical Informatics, Third Latin American Symposium, volume 1380, pages 163-169, 1998. URL: https://doi.org/10.1007/BFb0054319.
  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. 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.
  16. 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.
  17. Ronald de Wolf. A note on quantum algorithms and the minimal degree of ε-error polynomials for symmetric functions. Quantum Information and Computation, 8(10):943-950, 2008. URL: https://doi.org/10.26421/QIC8.10-4.
  18. David Deutsch and Richard Jozsa. Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences, 439(1907):553-558, 1992. URL: https://doi.org/10.1098/rspa.1992.0167.
  19. Bill Fefferman and Shelby Kimmel. Quantum vs. Classical Proofs and Subset Verification. In Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, volume 117, pages 22:1-22:23, 2018. URL: https://doi.org/10.4230/LIPIcs.MFCS.2018.22.
  20. Yuval Filmus, Hamed Hatami, Nathan Keller, and Noam Lifshitz. On the sum of L1 influences of bounded functions. Israel Journal of Mathematics, 214(1):167-192, 2016. URL: https://doi.org/10.1007/s11856-016-1355-0.
  21. Shafi Goldwasser and Michael Sipser. Private coins versus public coins in interactive proof systems. In Proceedings of the 18th annual ACM symposium on Theory of computing, pages 59-68, 1986. URL: https://doi.org/10.1145/12130.12137.
  22. 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.
  23. 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. Google Scholar
  24. Buhrman Harry and Ronald de Wolf. Complexity measures and decision tree complexity: a survey. Theoretical Computer Science, 288(1):21-43, 2002. URL: https://doi.org/10.1016/S0304-3975(01)00144-X.
  25. Xiaoyu He, Xiaoming Sun, Guang Yang, and Pei Yuan. Exact quantum query complexity of weight decision problems. Science China Information Sciences, 66:129503, 2023. https://arxiv.org/abs/1801.05717. URL: https://doi.org/10.1007/s11432-021-3468-x.
  26. Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, and Shigeru Yamashita. Unbounded-error classical and quantum communication complexity. In Proceedings of the 18th International Symposium on Algorithms and Computation, ISAAC 2007, volume 4835, pages 100-111, 2007. URL: https://doi.org/10.1007/978-3-540-77120-3_11.
  27. Kazuo Iwama, Harumichi Nishimura, Rudy Raymond, and Shigeru Yamashita. Unbounded-error one-way classical and quantum communication complexity. In Proceedings of the 34th International Colloquium on Automata, Languages and Programming, ICALP 2007, volume 4596, pages 110-121, 2007. URL: https://doi.org/10.1007/978-3-540-73420-8_12.
  28. Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, and Amir Yehudayoff. Tight bounds on the Fourier growth of bounded functions on the hypercube. arXiv preprint, 2021. URL: https://arxiv.org/abs/2107.06309.
  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. Vladimir I. Levenshtein. Krawtchouk polynomials and universal bounds for codes and designs in Hamming spaces. IEEE Transactions on Information Theory, 41(5):1303-1321, 1995. URL: https://doi.org/10.1109/18.412678.
  31. Shachar Lovett and Jiapeng Zhang. Fractional certificates for bounded functions. In Proceedings of the 14th Innovations in Theoretical Computer Science Conference, volume 251, pages 84:1-84:13, 2023. URL: https://doi.org/10.4230/LIPIcs.ITCS.2023.84.
  32. John C. Mason and David C. Handscomb. Chebyshev polynomials. CRC Press, 2002. Google Scholar
  33. Ashley Montanaro, Richard Jozsa, and Graeme Mitchison. On exact quantum query complexity. Algorithmica, 71(4):775-796, 2015. URL: https://doi.org/10.1007/s00453-013-9826-8.
  34. Ashley Montanaro, Harumichi Nishimura, and Rudy Raymond. Unbounded-error quantum query complexity. In Proceedings of the 19th International Symposium on Algorithms and Computation, ISAAC 2008, volume 5369, pages 919-930, 2008. URL: https://doi.org/10.1007/978-3-540-92182-0_80.
  35. 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.
  36. Supartha Podder, Penghui Yao, and Zekun Ye. On the fine-grained query complexity of symmetric functions. arXiv preprint, 2023. URL: https://arxiv.org/abs/2309.11279.
  37. Daowen Qiu and Shenggen Zheng. Characterizations of symmetrically partial Boolean functions with exact quantum query complexity. arXiv preprint, 2016. URL: https://arxiv.org/abs/1603.06505.
  38. Daowen Qiu and Shenggen Zheng. Generalized Deutsch-Jozsa problem and the optimal quantum algorithm. Physical Review A, 97(6):062331, 2018. URL: https://doi.org/10.1103/PhysRevA.97.062331.
  39. Daowen Qiu and Shenggen Zheng. Revisiting Deutsch-Jozsa algorithm. Information and Computation, 2020(275):104605, 2020. URL: https://doi.org/10.1016/j.ic.2020.104605.
  40. Alexander A. Sherstov. Approximate inclusion-exclusion for arbitrary symmetric functions. Computational Complexity, 18(2):219-247, 2009. URL: https://doi.org/10.1007/s00037-009-0274-4.
  41. Alexander A. Sherstov, Andrey A. Storozhenko, and Pei Wu. An optimal separation of randomized and quantum query complexity. In Proccedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, pages 1289-1302, 2021. URL: https://doi.org/10.1145/3406325.3451019.
  42. 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, 1994. URL: https://doi.org/10.1109/SFCS.1994.365700.
  43. Daniel R. Simon. On the power of quantum computation. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science, pages 116-123, 1994. URL: https://doi.org/10.1109/SFCS.1994.365701.
  44. Avishay Tal. Towards optimal separations between quantum and randomized query complexities. In Proccedings of the 61st Annual Symposium on Foundations of Computer Science, pages 228-239, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00030.
  45. 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.
  46. Christof Zalka. Grover’s quantum searching algorithm is optimal. Physical Review A, 60(4):2746, 2000. URL: https://doi.org/10.1103/PhysRevA.60.2746.
  47. Mark Zhandry. A note on the quantum collision and set equality problems. Quantum Information and Computation, 15(7&8):557-567, 2015. URL: https://doi.org/10.26421/QIC15.7-8-2.
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-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact