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

作　　者：Shao-Ming Fei 

机构地区：[1]School of Mathematical Sciences, Capital Normal University

出　　处：《Science Bulletin》2017年第14期980-981,共2页科学通报（英文版）

基　　金：supported by the National Natural Science Foundation of China(11675113)

摘　　要：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 inIn 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 .

关 键 词：计算复杂性 分离 查询 量子 计算理论 物理资源 计算问题 

分 类 号：O413[理学—理论物理]