Solving the K-subset summation problem based on twice quantum searching

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 <math xmlns:mml="http://www.w3.org/1998/...

Full description

Saved in:
Bibliographic Details
Published inTongxin Xuebao Vol. 46; pp. 182 - 190
Main Authors YE Tianyu, WU Heng, GAN Zhigang
Format Journal Article
LanguageChinese
Published Editorial Department of Journal on Communications 01.07.2025
Subjects
Boolean satisfiability problem
Grover quantum searching algorithm
K-subset summation problem
quantum circuit
Online AccessGet full text
ISSN1000-436X

Cover

More Information
Summary: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 <math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M6">K <graphic specific-use="big" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/60230FE2-A2AD-4456-A2D8-AFECCAB09F14-M006.jpg"> <graphic specific-use="small" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/60230FE2-A2AD-4456-A2D8-AFECCAB09F14-M006c.jpg"> elements. Specifically, an Oracle operator was used to accomplish the phase flip to mark all subsets of <math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M7">K <graphic specific-use="big" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativeImage/60230FE2-A2AD-4456-A2D8-AFECCAB09F14-M006.jpg"> <graphic specific-use="small" xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="alternativ
ISSN:1000-436X