arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.7381cs.CCquant-ph
收藏

关于以“概率”为模k的计算

On computation with 'probabilities' modulo k

Niel de Beaudrap

摘要:

我们提出了一个框架来研究模型的计算不确定性的数据,抽象的“分布”。在这些分布中,概率被从固定的半环$S$中提取的“振幅”所取代,其中非负实数、复数、有限域$\mathbb F_{p^r}$和循环环$\mathbb Z_k$都是例子。不同的$S$会产生不同的计算模型,我们可以研究这些模型,以更好地理解随机计算和量子计算之间(可能)的功率差异。Schumacher和Westmoreland [arXiv:1010.2929]的“模态量子态”就是这种分布的例子,因为$S$是一个有限域。对于$S = \mathbb F_2$,Willcock和Sabry [arXiv:1102.3587]表明,UNIQUE-SAT可通过由可逆门组成的多项式时间均匀电路族求解。我们的特点的决策问题可解的多项式均匀电路家庭,使用可逆或“酉”变换循环环$S = \mathbb Z_k$,或(在这种情况下,$k$是一个素数权力)有限域$S = \mathbb F_k$。特别是,对于一个素数幂的$k$,这些正是$\mathsf{Mod}_k\mathsf P$类中的问题。

英文摘要:

We propose a framework to study models of computation of indeterministic data, represented by abstract "distributions". In these distributions, probabilities are replaced by "amplitudes" drawn from a fixed semi-ring $S$, of which the non-negative reals, the complex numbers, finite fields $\mathbb F_{p^r}$, and cyclic rings $\mathbb Z_k$ are examples. Varying $S$ yields different models of computation, which we may investigate to better understand the (likely) difference in power between randomised and quantum computation. The "modal quantum states" of Schumacher and Westmoreland [arXiv:1010.2929] are examples of such distributions, for $S$ a finite field. For $S = \mathbb F_2$, Willcock and Sabry [arXiv:1102.3587] show that UNIQUE-SAT is solvable by polynomial-time uniform circuit families consisting of invertible gates. We characterize the decision problems solvable by polynomial uniform circuit families, using either invertible or "unitary" transformations over cyclic rings $S = \mathbb Z_k$, or (in the case that $k$ is a prime power) finite fields $S = \mathbb F_k$. In particular, for $k$ a prime power, these are precisely the problems in the class $\mathsf{Mod}_k\mathsf P$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑