论文标题
一种量子算法，以估计布尔功能中严格的雪崩标准的亲密关系
A quantum algorithm to estimate the closeness to the Strict Avalanche criterion in Boolean functions
论文作者
论文摘要
我们提出了一种量子算法（以量子甲骨文的形式），该算法估计给定布尔函数的亲密性与满足``严格的雪崩标准''（SAC）的函数。该算法需要布尔函数oracle的$ n $查询，其中$ n $是输入变量的数量，这比经典算法执行相同任务所需的查询少。我们将我们的方法与其他量子算法进行比较，这些算法可用于估计与SAC的接近度，并显示我们的算法用量子甲骨文的最少调用来验证SAC，并且需要给定置信度结合的最少样本。
We propose a quantum algorithm (in the form of a quantum oracle) that estimates the closeness of a given Boolean function to one that satisfies the ``strict avalanche criterion'' (SAC). This algorithm requires $n$ queries of the Boolean function oracle, where $n$ is the number of input variables, this is fewer than the queries required by the classical algorithm to perform the same task. We compare our approach with other quantum algorithms that may be used for estimating the closeness to SAC and it is shown our algorithm verifies SAC with the fewest possible calls to quantum oracle and requires the fewest samples for a given confidence bound.
