1) qnantum Grover algorithm
量子Grover算法
3) Grover quantum search algorithm
Grover量子搜索算法
1.
Based on these backgrounds,we propose a method to form NMR pulse sequences to realize the multi-qubit Grover quantum search algorithm.
本文以核磁共振和多量子算符代数理论为基础,提出了实现多量子位Grover量子搜索算法的核磁共振脉冲序列设计方法,并在量子计算仿真程序上进行了3量子位的Grover量子搜索算法的实验验证。
4) Grover operator
Grover算子
6) Grover algorithm
Grover算法
1.
Calculating Optimal Searching Times of Grover Algorithm;
逼近全概率Grover算法的搜索次数计算
2.
This quantum algorithm has higher probability of success than the algorithm based on Grover algorithm with multiple matches in the search space.
给出了基于固定相位的背包问题量子计算算法,证明了该算法在多解的情况下,能够以不低于98%的成功率在O((N/M)~(1/2))步完成对规模为n的背包问题求解(M是解的数目),而基于原始Grover算法的背包问题量子计算算法计算复杂度为O((N/M)~(1/2)),成功率是50%～100%。
3.
Simulated experiments of the reciprocal problem showcase that this proposed algorithm can find solutions with higher probability than traditional Grover algorithm at the condition of equivalent iterative steps,and the success probability can even be increased if the iterative steps is unlimited.
求逆问题的仿真实验表明该方法在同等迭代次数的条件下,成功概率高于传统Grover算法;且如果迭代次数不限,则成功概率可以更高。
补充资料：单量子阱(见量子阱)
单量子阱(见量子阱)
single quantum well
单且子阱sillgle quantum well见量子阱。
说明：补充资料仅用于学习参考，请勿用于其它任何用途。
参考词条