Exact quantum query complexity of weight decision problems via Chebyshev polynomials

CSpace

	Exact quantum query complexity of weight decision problems via Chebyshev polynomials
	He Xiaoyu; Sun Xiaoming; Yang Guang; Yuan Pei
	2023
发表期刊	SCIENCE CHINA. INFORMATION SCIENCE
ISSN	1674-733X
卷号	66 期号:2
摘要	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).
语种	英语
文献类型	期刊论文
条目标识符	http://119.78.100.204/handle/2XEOYT63/37923
专题	中国科学院计算技术研究所
作者单位	中国科学院计算技术研究所
第一作者单位	中国科学院计算技术研究所
推荐引用方式 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).