AI帮你理解科学

AI 生成解读视频

AI抽取解析论文重点内容自动生成视频


pub
生成解读视频

AI 溯源

AI解析本论文相关学术脉络


Master Reading Tree
生成 溯源树

Characterization of Non-Deterministic Quantum Query and Quantum Communication Complexity

IEEE Conference on Computational Complexity, pp.271-271, (2000)

被引用86|浏览10
EI
下载 PDF 全文
引用

摘要

It is known that the classical and quantum query complexities of a total Boolean function ý are polynomially related to the degree of its representing polynomial, but the optimal exponents in these relations are unknown. We show that the non-deterministic quantum query complexity of ý is linearly related to the degree of a 驴non-determinis...更多

代码

数据

您的评分 :
0

 

标签
评论
数据免责声明
页面数据均来自互联网公开来源、合作出版商和通过AI技术自动分析结果,我们不对页面数据的有效性、准确性、正确性、可靠性、完整性和及时性做出任何承诺和保证。若有疑问,可以通过电子邮件方式联系我们:report@aminer.cn
小科