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 <inline-formula><alternatives><math xmlns:mml="h...

תיאור מלא

מידע ביבליוגרפי

Principais autores:	YE Tianyu, WU Heng, GAN Zhigang
פורמט:	Artigo
שפה:	Chinês
יצא לאור:	Editorial Department of Journal on Communications 2025-07-01
סדרה:	Tongxin xuebao
נושאים:	K-subset summation problem Grover quantum searching algorithm Boolean satisfiability problem quantum circuit
גישה מקוונת:	http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2025132/
תגים:	הוספת תג אין תגיות, היה/י הראשונ/ה לתייג את הרשומה!