arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1701.08669quant-phmath.CT
收藏

隐子群问题量子算法的全图解处理

Fully graphical treatment of the quantum algorithm for the Hidden Subgroup Problem

Stefano Gogioso, Aleks Kissinger

摘要:

阿贝尔隐子群问题(HSP)是一个非常普遍的问题,许多已知量子指数加速的问题(如整数分解、离散对数和Simon问题)都可以看作是它的具体实例,传统的量子协议描述是低级的,并且严重依赖于经典群论和复向量空间之间的相互作用。相反,我们给出了一个高层次的图示,展示了真正发挥作用的量子结构。具体来说,我们提供了第一个完整的图解证明的正确性阿贝尔HSP协议,强互补的观测是其成功的关键因素。作为完全图解,我们的证明扩展了传统的有限维量子理论的情况下:例如,我们可以用它来表明,西蒙的问题可以有效地解决在真正的量子理论,并获得一个协议,解决HSP某些无限阿贝尔群。

英文摘要:

The abelian Hidden Subgroup Problem (HSP) is extremely general, and many problems with known quantum exponential speed-up (such as integers factorisation, the discrete logarithm and Simon's problem) can be seen as specific instances of it. The traditional presentation of the quantum protocol for the abelian HSP is low-level, and relies heavily on the the interplay between classical group theory and complex vector spaces. Instead, we give a high-level diagrammatic presentation which showcases the quantum structures truly at play. Specifically, we provide the first fully diagrammatic proof of correctness for the abelian HSP protocol, showing that strongly complementary observables are the key ingredient to its success. Being fully diagrammatic, our proof extends beyond the traditional case of finite-dimensional quantum theory: for example, we can use it to show that Simon's problem can be efficiently solved in real quantum theory, and to obtain a protocol that solves the HSP for certain infinite abelian groups.

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

↑