資源簡(jiǎn)介
這是量子搜索算法的原函數(shù),其中DHA模擬量子計(jì)算機(jī)的一組給定數(shù)據(jù)尋找最小值的過(guò)程,而B(niǎo)BHT的目的是搜尋給定數(shù)據(jù)里特定數(shù)據(jù)的過(guò)程
代碼片段和文件信息
%This?simulation?is?for?BBHT?QSA
function?BBHTQSA=BBHT(xNyz)
x_p=1/sqrt(N)*ones(size(x));
x_o=zeros(size(x));
BBHTQSA=0;
x_ind=1:N;
m=1;
lambda=6/5;
t_max=0;
signal=0;????????%提示是否搜索到了目標(biāo)解
while?(signal==0?&&?t_max<=4.5*sqrt(N))
????j_iter=randi(m);
for?i=1:1:N
????if?x(i) ????????x_p(i)=-x_p(i);
????????x_o(i)=1;
????end
end
t=sum(x_o);
theta=asin(t/N);
for?i=1:1:N
????if?x_o(i)==1
????????x_p(i)=1/sqrt(t)*sin((2*j_iter+1)*theta);
????else
????????x_p(i)=1/sqrt(N-t)*cos((2*j_iter+1)*theta);
????end
end
x_prob=x_p.^2/sum(x_p.^2);
q_msur=randsrc(11[x_ind;x_prob]);
if?x(q_msur)<=yz
????BBHTQSA=q_msur;
????signal=1;
????break;??
else
????m=floor(min(lambda*msqrt(N)));
end
t_max=t_max+1;
end????
????????
?屬性????????????大小?????日期????時(shí)間???名稱(chēng)
-----------?---------??----------?-----??----
?????文件????????775??2018-02-18?16:05??quantum?search\BBHT.m
?????文件????????430??2018-02-18?16:06??quantum?search\DHA.m
?????目錄??????????0??2018-02-19?18:42??quantum?search
-----------?---------??----------?-----??----
?????????????????1205????????????????????3
評(píng)論
共有 條評(píng)論