arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2611.06716quant-ph
收藏

在囚禁离子量子计算机上求解非阿贝尔隐藏子群问题:测量基的威力

Solving a non-abelian hidden subgroup problem on a trapped-ion quantum computer: the power of the measurement basis

University of Cambridge(剑桥大学)

Oliver O'Brien

AI总结:

该研究在IonQ Forte囚禁离子量子计算机上实验求解q面体群的非阿贝尔隐藏子群问题,验证了相关理论预测,发现不同采样方法的成功情况,并在特定参数下硬件性能超越经典算法。

摘要:

隐藏子群问题(HSP)统一了许多最知名的量子加速算法。对于阿贝尔群,可通过弱傅里叶采样高效求解;但对于非阿贝尔群(包括与图同构和格基密码学相关的情况),合适的测量基至关重要且往往未知。我们实验研究了q面体群Z_q ⋉ Z_p上的HSP,该群介于二面体群和仿射群之间,标志着高效可解实例与仅信息论可解实例的边界。在IonQ Forte囚禁离子量子计算机上,当p≤7时,我们实现了弱傅里叶采样、适配基下的强傅里叶采样、相邻对的强傅里叶采样以及遗忘阿贝尔采样。我们证明了Moore、Rockmore、Russell和Schulman的理论预测在噪声设备上依然成立:弱采样无法揭示隐藏子群,适配基在大q时成功,相邻对在小q时成功,遗忘采样在单位成功概率以下饱和。当p=7、q=6时,硬件在最多3次预言机查询下超过了穷尽优化的经典算法的成功概率。

英文摘要:

The hidden subgroup problem (HSP) unifies many of the best-known quantum speed-ups. For abelian groups it is solved efficiently by weak Fourier sampling, but for non-abelian groups, which include the cases relevant to graph isomorphism and lattice-based cryptography, the right measurement basis is crucial and often unknown. We experimentally study the HSP over the $q$-hedral groups $\mathbb{Z}_q \ltimes \mathbb{Z}_p$, which interpolate between the dihedral and affine groups and mark a boundary between instances that are efficiently solvable and those that are only information-theoretically solvable. On the IonQ Forte trapped-ion quantum computer, with $p \le 7$, we implement weak Fourier sampling, strong Fourier sampling in an adapted basis, strong Fourier sampling of adjacent pairs, and forgetful abelian sampling. We demonstrate that the theoretical predictions of Moore, Rockmore, Russell and Schulman survive on a noisy device: weak sampling reveals nothing about the hidden subgroup, the adapted basis succeeds for large $q$, adjacent pairs succeed for small $q$, and forgetful sampling saturates below unit success. For $p=7$, $q=6$, the hardware exceeds the success probability of an exhaustively optimised classical algorithm for up to three oracle queries.

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

↑