481.
An efficient quantum algorithm based on twice quantum searching was proposed to solve the K-subset summation problem. In the first quantum searching, a varied Grover operator was utilized to generate the quantum superposition containing all subsets of
![]()
![]()
elements. Specifically, an Oracle operator was used to accomplish the phase flip to mark all subsets of
![]()
![]()
elements, followed by a diffusion operator for amplifying the probability amplitudes of marked target subsets. In the second quantum searching, another varied Grover operator was employed to find the subsets whose summation of
![]()
![]()
elements equalled to the target value from all subsets of
![]()
![]()
elements. In detail, a specially designed sum-checking Oracle operator was used to mark all subsets of
![]()
![]()
elements whose summation of
![]()
![]()
elements equalled to the target value, followed by a diffusion operator for amplifying the probability amplitudes of marked subsets. Simulation experimental results turn out that the proposed method achieves an accuracy of no less than 89%, which is higher than that of existing methods.… …
相似文献