用Grover算法计算类高斯变换的量子线路
Quantum Circuit for Calculating Mobius-like Transforms Via Grover-like Algorithm
摘要:
在本文中,我们给出了用于计算两个密切相关的线性变换的量子线路,我们共同称为类高斯变换。第一个是函数$f^{-}(S^-)\in \mathbb{C}$的莫比乌斯变换,其中$S^-\subset \{0,1,\ldots,n-1\}$。第二个是概率分布$P(y^n)$的边缘,其中$y^n\in Bool^n$。用于计算这些类高斯变换的已知经典算法采用${\cal O}(2^n)$步骤。我们的量子算法是基于Grover类算法,它需要${\cal O}(\sqrt{2^n})$步骤。
英文摘要:
In this paper, we give quantum circuits for calculating two closely related linear transforms that we refer to jointly as Mobius-like transforms. The first is the Mobius transform of a function $f^{-}(S^-)\in \mathbb{C}$, where $S^-\subset \{0,1,\ldots,n-1\}$. The second is a marginal of a probability distribution $P(y^n)$, where $y^n\in Bool^n$. Known classical algorithms for calculating these Mobius-like transforms take ${\cal O}(2^n)$ steps. Our quantum algorithm is based on a Grover-like algorithm and it takes ${\cal O}(\sqrt{2^n})$ steps.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。