Exact quantum query complexity of weight decision problems via Chebyshev polynomials
文献类型：期刊论文
| 作者 | He Xiaoyu; Sun Xiaoming; Yang Guang; Yuan Pei |
| 刊名 | SCIENCE CHINA. INFORMATION SCIENCE
 |
| 出版日期 | 2023 |
| 卷号 | 66期号:2 |
| ISSN号 | 1674-733X |
| 英文摘要 | The weight decision problem, which requires determining the Hamming weight of a given binary string, is a natural and important problem with lots of applications, such as cryptanalysis and coding theory. In this study, we investigate the exact quantum query complexity of weight decision problems, where the exact quantum algorithm must always output the correct answer within finite steps (see Appendix A for a detailed explanation). |
| 语种 | 英语 |
| 源URL | [http://119.78.100.204/handle/2XEOYT63/37922]  |
| 专题 | 中国科学院计算技术研究所期刊论文_英文 |
| 作者单位 | 中国科学院计算技术研究所 |
| 推荐引用方式 GB/T 7714 | He Xiaoyu,Sun Xiaoming,Yang Guang,et al. Exact quantum query complexity of weight decision problems via Chebyshev polynomials[J]. SCIENCE CHINA. INFORMATION SCIENCE,2023,66(2). |
| APA | He Xiaoyu,Sun Xiaoming,Yang Guang,&Yuan Pei.(2023).Exact quantum query complexity of weight decision problems via Chebyshev polynomials.SCIENCE CHINA. INFORMATION SCIENCE,66(2). |
| MLA | He Xiaoyu,et al."Exact quantum query complexity of weight decision problems via Chebyshev polynomials".SCIENCE CHINA. INFORMATION SCIENCE 66.2(2023). |
入库方式： OAI收割
来源：计算技术研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。