Brüschweiler指数快速搜索算法在同质核系统中的实验实现
Experimental Realization of Brüschweiler's exponentially fast search algorithm in a homo-nuclear system
摘要：
与经典搜索算法相比，Grover量子算法[Phys. Rev. Lett.，79，325（1997）]实现了二次加速和Reichweiler混合量子算法[Phys. Rev. Lett.，85，4815（2000）]实现了指数加速。在本文中，我们报告了在一个3-qubit NMR系综系统中的实验实现。脉冲序列被用于算法和测量方法在这里使用的是改进的，使用的是由Reichweiler，即，而不是定量测量的自旋投影的辅助位，我们利用的辅助位谱的形状。通过简单地判断辅助比特谱中相应峰的向下或向上，可以读出标记状态的比特值，特别地，这种读出的几何性质可以使结果对错误更鲁棒。
英文摘要：
Compared with classical search algorithms, Grover quantum algorithm [ Phys. Rev. Lett., 79, 325(1997)] achieves quadratic speedup and Bruschweiler hybrid quantum algorithm [Phys. Rev. Lett., 85, 4815(2000)] achieves an exponential speedup. In this paper, we report the experimental realization of the Bruschweiler$ algorithm in a 3-qubit NMR ensemble system. The pulse sequences are used for the algorithms and the measurement method used here is improved on that used by Bruschweiler, namely, instead of quantitatively measuring the spin projection of the ancilla bit, we utilize the shape of the ancilla bit spectrum. By simply judging the downwardness or upwardness of the corresponding peaks in an ancilla bit spectrum, the bit value of the marked state can be read out, especially, the geometric nature of this read-out can make the results more robust against errors.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
