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...
Збережено в:
| Автори: | , , |
|---|---|
| Формат: | Artigo |
| Мова: | Chinês |
| Опубліковано: |
Editorial Department of Journal on Communications
2025-07-01
|
| Серія: | Tongxin xuebao |
| Предмети: | |
| Онлайн доступ: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2025132/ |
| Теги: |
Немає тегів, Будьте першим, хто поставить тег для цього запису!
|