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><ma...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2025-07-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2025132/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|