The query model has generated considerable interest in both classical and quantum computing communities. Typically, quantum advantages are demonstrated by showcasing a quantum algorithm with a better query complexity compared to its classical counterpart. Exact quantum query algorithms play a pivotal role in developing quantum algorithms. For example, the Deutsch-Jozsa algorithm demonstrated exponential quantum advantages over classical deterministic algorithms. As an important complexity measure, exact quantum query complexity describes the minimum number of queries required to solve a specific problem exactly using a quantum algorithm. In this paper, we consider the exact quantum query complexity of the following two $n$-bit symmetric functions: $\text{MOD}_m^n(x) = |x| \bmod m$ and $$ \text{EXACT}_{k,l}^n(x) = \begin{cases} 1, &\text{if }|x| \in \{k,l\}, \\ 0, &\text{otherwise}, \end{cases} $$ where $|x|$ is the number of $1$'s in $x$. Our results are as follows: i) We present an optimal quantum algorithm for computing $\text{MOD}_m^n$, achieving a query complexity of $\lceil n(1-\frac{1}{m}) \rceil$ for $1 < m \le n$. This settles a conjecture proposed by Cornelissen, Mande, Ozols and de Wolf (2021). Based on this algorithm, we show the exact quantum query complexity of a broad class of symmetric functions that map $\{0,1\}^n$ to a finite set $X$ is less than $n$. ii) When $l-k \ge 2$, we give an optimal exact quantum query algorithm to compute $\text{EXACT}_{k,l}^n$ for the case $k=0$ or $k=1,l=n-1$. This resolves the conjecture proposed by Ambainis, Iraids and Nagaj (2017) partially.

翻译：查询模型在经典计算与量子计算领域均引起了广泛关注。通常，量子优势通过展示一种查询复杂度优于经典算法的量子算法来体现。确切量子查询算法在量子算法发展中扮演关键角色，例如Deutsch-Jozsa算法证明了相较于经典确定性算法的指数级量子优势。作为重要的复杂度度量指标，确切量子查询复杂度描述了使用量子算法精确求解特定问题所需的最小查询次数。本文研究以下两个n比特对称函数的确切量子查询复杂度：$\text{MOD}_m^n(x) = |x| \bmod m$ 与 $$ \text{EXACT}_{k,l}^n(x) = \begin{cases} 1, &\text{若 }|x| \in \{k,l\}, \\ 0, &\text{其他情况}, \end{cases} $$ 其中$|x|$表示$x$中1的个数。我们的主要结果如下：i) 针对$\text{MOD}_m^n$函数，我们提出了最优量子算法，当$1 < m \le n$时查询复杂度为$\lceil n(1-\frac{1}{m}) \rceil$，解决了Cornelissen、Mande、Ozols和de Wolf（2021年）提出的猜想。基于该算法，我们证明了一类将$\{0,1\}^n$映射到有限集$X$的广泛对称函数的确切量子查询复杂度小于$n$。ii) 当$l-k \ge 2$且满足$k=0$或$k=1,l=n-1$时，我们给出了计算$\text{EXACT}_{k,l}^n$的最优确切量子查询算法，部分解决了Ambainis、Iraids和Nagaj（2017年）提出的猜想。