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...

Celý popis

Podrobná bibliografie

Hlavní autoři:	YE Tianyu, WU Heng, GAN Zhigang
Médium:	Artigo
Jazyk:	Chinês
Vydáno:	Editorial Department of Journal on Communications 2025-07-01
Edice:	Tongxin xuebao
Témata:	K-subset summation problem Grover quantum searching algorithm Boolean satisfiability problem quantum circuit
On-line přístup:	http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2025132/
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!