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

您当前的位置：

首页 >

文章列表页 >

Papers | 更新时间：2025-08-07

- Solving the K-subset summation problem based on twice quantum searching
- Journal on Communications Vol. 46, Issue 7, Pages: 182-190(2025)
- 作者机构：
  
  浙江工商大学信息与电子工程学院，浙江杭州 310018
- 作者简介：
- 基金信息：
  
  The National Natural Science Foundation of China(62071430)
- DOI：10.11959/j.issn.1000-436x.2025132
  CLC： TP301.6
- Received：31 March 2025，
  
  Revised：2025-07-10，
  
  Accepted：15 July 2025，
  
  Published：25 July 2025
- 稿件说明：
移动端阅览
叶天语,吴恒,甘志刚.基于两次量子搜索的K子集和问题求解[J].通信学报,2025,46(07):182-190.

YE Tianyu,WU Heng,GAN Zhigang.Solving the K-subset summation problem based on twice quantum searching[J].Journal on Communications,2025,46(07):182-190.
叶天语,吴恒,甘志刚.基于两次量子搜索的K子集和问题求解[J].通信学报,2025,46(07):182-190. DOI： 10.11959/j.issn.1000-436x.2025132.

YE Tianyu,WU Heng,GAN Zhigang.Solving the K-subset summation problem based on twice quantum searching[J].Journal on Communications,2025,46(07):182-190. DOI： 10.11959/j.issn.1000-436x.2025132.

Views

630

下载量

CSCD

Alert me when the article has been cited

提交

Tools

Publicity Resources

Efficient quantum circuit implementations of SM3 and RIPEMD-160 Hash functions

Related Author

ZOU Jian

GUO Nansheng

LI Junkang

Related Institution

College of Computer and Data Science, Fuzhou University

Fujian Provincial Key Laboratory of Network Systems and Information Security, Fuzhou University

AI导读

AI脑图

AI问答

⁰