Abstract
In this paper, we consider the exact quantum query complexity of two fundamental symmetric functions. 1) MOD nm , which calculates the Hamming weight of an n-bit string modulo m; 2) EXACT nk,l ;, which determines if the Hamming weight of an n-bit string is exactly k or l. Although these two symmetric functions have received considerable attention, their exact quantum query complexities have not been fully characterized. Specifically, our results are as follows:
-
1)
We design an optimal quantum query algorithm to compute MOD nm exactly and thus provide a tight characterization of its exact quantum query complexity, which settles a previous conjecture. Based on this algorithm, we demonstrate that a broad class of symmetric functions is not evasive in the quantum model, i.e., there exist quantum algorithms to compute these functions exactly when the number of queries is less than their input size.
-
2)
By proposing a quantum algorithm that utilizes the minimum number of queries to compute EXACT nk,l exactly for some specific values of k and l, we give a tight characterization of its exact quantum query complexity in these scenarios.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Simon D R. On the power of quantum computation. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science. 1994, 116–123
Shor P W. Algorithms for quantum computation: Discrete logarithms and factoring. In: Proceedings of the 35th Annual Symposium on Foundations of Computer Science. 1994, 124–134
Liu Q, Zhandry M. On finding quantum multi-collisions. In: Proceedings of the 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2019, 189–218
Yamakawa T, Zhandry M. Classical vs quantum random oracles. In: Proceedings of the 40th Annual International Conference on the Theory and Applications of Cryptographic Techniques. 2021, 568–597
Gilyén A, Arunachalam S, Wiebe N. Optimizing quantum optimization algorithms via faster quantum gradient computation. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms. 2019, 1425–1444
Chakrabarti S, Childs A M, Li T, Wu X. Quantum algorithms and lower bounds for convex optimization. Quantum, 2020, 4: 221
Li T, Wu X. Quantum query complexity of entropy estimation. IEEE Transactions on Information Theory, 2019, 65(5): 2899–2921
Arunachalam S, Chakraborty S, Lee T, Paraashar M, De Wolf R. Two new results about quantum exact learning. Quantum, 2021, 5: 587
Buhrman H, De Wolf R. Complexity measures and decision tree complexity: a survey. Theoretical Computer Science, 2002, 288(1): 21–43
Deutsch D, Jozsa R. Rapid solution of problems by quantum computation. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1992, 439(1907): 553–558
Cleve R, Ekert A, Macchiavello C, Mosca M. Quantum algorithms revisited. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences, 1998, 454(1969): 339–354
Høyer P. Arbitrary phases in quantum amplitude amplification. Physical Review A, 2000, 62(5): 052304
Long G L. Grover algorithm with zero theoretical failure rate. Physical Review A, 2001, 64(2): 022307
Brassard G, Høyer P, Mosca M, Tapp A. Quantum amplitude amplification and estimation. Contemporary Mathematics, 2002, 305: 53–74
Qiu D, Zheng S. Characterizations of symmetrically partial Boolean functions with exact quantum query complexity. 2016, arXiv preprint arXiv: 1603.06505
Qiu D, Zheng S. Generalized Deutsch-Jozsa problem and the optimal quantum algorithm. Physical Review A, 2018, 97(6): 062331
He X, Sun X, Yang G, Yuan P. Exact quantum query complexity of weight decision problems via chebyshev polynomials. Science China Information Sciences, 2023, 66(2): 129503
Qiu D, Zheng S. Revisiting Deutsch-Jozsa algorithm. Information and Computation, 2020, 275: 104605
Li G, Li L. Deterministic quantum search with adjustable parameters: Implementations and applications. Information and Computation, 2023, 292: 105042
Li G, Li L. Optimal exact quantum algorithm for the promised element distinctness problem. 2022, arXiv preprint arXiv: 2211.05443
von zur Gathen J, Roche J R. Polynomials with two values. Combinatorica, 1997, 17(3): 345–362
Baker R C, Harman G, Pintz J. The difference between consecutive primes, II. Proceedings of the London Mathematical Society, 2001, 83(3): 532–562
Beals R, Buhrman H, Cleve R, Mosca M, De Wolf R. Quantum lower bounds by polynomials. Journal of the ACM, 2001, 48(4): 778–797
Montanaro A, Jozsa R, Mitchison G. On exact quantum query complexity. Algorithmica, 2015, 71(4): 775–796
Farhi E, Goldstone J, Gutmann S, Sipser M. Limit on the speed of quantum computation in determining parity. Physical Review Letters, 1998, 81(24): 5442–5444
Ambainis A, Iraids J, Smotrovs J. Exact quantum query complexity of EXACT and THRESHOLD. In: Proceedings of the 8th Conference on the Theory of Quantum Computation, Communication and Cryptography. 2013, 263–269
Cornelissen A, Mande N S, Ozols M, De Wolf R. Exact quantum query complexity of computing Hamming weight modulo powers of two and three. 2021, arXiv preprint arXiv: 2112.14682
Ambainis A, Iraids J, Nagaj D. Exact quantum query complexity of EXACT nk,l . In: Proceedings of the 43rd International Conference on Current Trends in Theory and Practice of Informatics. 2017, 243–255
Wu Z, Hou S Y, Zhang C, Li L, Zeng B. Variational learning algorithms for quantum query complexity. 2022, arXiv preprint arXiv: 2205.07449
Kahn J, Saks M, Sturtevant D. A topological approach to evasiveness. Combinatorica, 1984, 4(4): 297–306
Lutz F H. Some results related to the evasiveness conjecture. Journal of Combinatorial Theory, Series B, 2001, 81(1): 110–124
He X, Huang N, Sun X. On the decision tree complexity of string matching. In: Proceeding of the 26th Annual European Symposium on Algorithms. 2018, 45: 1–45: 13
Aaronson S. Algorithms for Boolean function query properties. SIAM Journal on Computing, 2003, 32(5): 1140–1157
Ambainis A, Gruska J, Zheng S. Exact quantum algorithms have advantage for almost all Boolean functions. Quantum Information & Computation, 2015, 15(5–6): 435–452
Kulkarni R, Qiao Y, Sun X. Any monotone property of 3-uniform hypergraphs is weakly evasive. Theoretical Computer Science, 2015, 588: 16–23
Deutsch D. Quantum theory, the church-turing principle and the universal quantum computer. Proceedings of the Royal Society A Mathematical, Physical and Engineering Sciences, 1985, 400(1818): 97–117
Nielsen M A, Chuang I L. Quantum Computation and Quantum Information. 10th anniversary ed. Cambridge: Cambridge University Press, 2010
Jeffrey A, Dai H H. Handbook of Mathematical Formulas and Integrals. 4th ed. Amsterdam: Academic, 2008
Acknowledgements
We would like to thank Lvzhou Li and Jingquan Luo for pointing out a flaw in Algorithm 1 in an early version of this manuscript. We would like to thank the anonymous reviewers for their advice on improving the article. This research was supported by the National Natural Science Foundation of China (Grant Nos. 62332009, 12347104, and 61972191) and the Innovation Program for Quantum Science and Technology (2021ZD0302901).
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Competing interests The authors declare that they have no competing interests or financial conflicts to disclose.
Additional information
Penghui Yao is currently an associate professor in the Department of Computer Science and Technology at Nanjing University, China. He received his PhD degree from the Centre for Quantum Technologies, National University of Singapore, Singapore in 2013. His research interests include quantum complexity theory, quantum information theory, quantum distributed computing, Fourier analysis in theoretical computer science and quantum computation, and derandomization.
Zekun Ye is currently a PhD student in the Department of Computer Science and Technology at Nanjing University, China. His research interests include quantum algorithms, quantum query complexity, and quantum communication complexity.
Electronic supplementary material
Rights and permissions
About this article
Cite this article
Yao, P., Ye, Z. On the exact quantum query complexity of MOD and EXACT functions. Front. Comput. Sci. 19, 194901 (2025). https://doi.org/10.1007/s11704-024-3770-4
Received:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11704-024-3770-4