arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0810.3695quant-phcs.CC
收藏

Weyl-Heisenberg群上隐子群问题的一个有效量子算法

An Efficient Quantum Algorithm for the Hidden Subgroup Problem over Weyl-Heisenberg Groups

Hari Krovi, Martin Roetteler

摘要:

在量子计算中已经实现的许多指数加速比是通过隐子群问题(HSP)获得的。我们证明了Weyl-Heisenberg群上的HSP可以在量子计算机上有效地求解。这些群在物理学中是众所周知的,在量子纠错码理论中起着重要作用。我们的算法是基于陪集态的非交换傅立叶分析,陪集态是由给定的黑盒函数产生的量子态。我们使用Clebsch-Gordan分解来组合和减少不可约表示的张量积。此外,我们使用一种新的技术,改变标签的不可约表示,以获得低维的不可约表示在分解过程中。该算法的一个特点是,在算法的每次迭代中,量子计算机同时对两个陪集态进行运算。这是一个改进,以前最知名的量子算法,这些群体需要四个陪集状态。

英文摘要:

Many exponential speedups that have been achieved in quantum computing are obtained via hidden subgroup problems (HSPs). We show that the HSP over Weyl-Heisenberg groups can be solved efficiently on a quantum computer. These groups are well-known in physics and play an important role in the theory of quantum error-correcting codes. Our algorithm is based on non-commutative Fourier analysis of coset states which are quantum states that arise from a given black-box function. We use Clebsch-Gordan decompositions to combine and reduce tensor products of irreducible representations. Furthermore, we use a new technique of changing labels of irreducible representations to obtain low-dimensional irreducible representations in the decomposition process. A feature of the presented algorithm is that in each iteration of the algorithm the quantum computer operates on two coset states simultaneously. This is an improvement over the previously best known quantum algorithm for these groups which required four coset states.

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

↑