期刊文献+

What is the largest separation between quantum and classical query complexity?

What is the largest separation between quantum and classical query complexity?
原文传递
导出
摘要 In the theory of computation,a key question in analyzing the computational complexity of a certain computational problem is how much least physical resource would be needed to solve a computational task[1].Here,the physical sources include time and the storage,in particular,the number of unit gates and processors in In the theory of computation, a key question in analyzing the computational complexity of a certain computational problem is how much least physical resource would be needed to solve a com- putational task .
作者 Shao-Ming Fei
出处 《Science Bulletin》 SCIE EI CAS CSCD 2017年第14期980-981,共2页 科学通报(英文版)
基金 supported by the National Natural Science Foundation of China(11675113)
作者简介 E-mail address: feishm@cnu.edu.cn
  • 相关文献

参考文献2

二级参考文献1

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部