LOWER BOUNDS ON QUANTUM QUERY COMPLEXITY

被引：0
|
作者：
Toran, Jacobo [1 ]
Hoyer, Peter [2 ]
Spalek, Robert [3 ,4 ]
机构：
[1] Univ Ulm, Dept Theoret Informat, Oberer Eselsberg, D-89069 Ulm, Germany
[2] Univ Calgary, Dept Comp Sci, Calgary, AB, Canada
[3] CWI, Amsterdam, Netherlands
[4] Univ Amsterdam, Amsterdam, Netherlands
来源：
BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE | 2005年 / 87期
基金：
加拿大自然科学与工程研究理事会;
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Shor's and Grover's famous quantum algorithms for factoring and searching show that quantum computers can solve certain computational problems significantly faster than any classical computer. We discuss here what quantum computers cannot do, and specifically how to prove limits on their computational power. We cover the main known techniques for proving lower bounds, and exemplify and compare the
引用
收藏
页码：78 / 103
页数：26
相关论文
共 50 条
  • [21] Quantum multiparty communication complexity and circuit lower bounds
    Kerenidis, Iordanis
    [J]. THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, PROCEEDINGS, 2007, 4484 : 306 - 317
  • [22] A quantum lower bound for the query complexity of Simon's problem
    Koiran, P
    Nesme, V
    Portier, N
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2005, 3580 : 1287 - 1298
  • [23] An improved lower bound on query complexity for quantum PAC learning
    Zhang, Chi
    [J]. INFORMATION PROCESSING LETTERS, 2010, 111 (01) : 40 - 45
  • [24] ARE LOWER BOUNDS ON THE COMPLEXITY LOWER BOUNDS FOR UNIVERSAL CIRCUITS
    NIGMATULLIN, RG
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 331 - 340
  • [25] A lower bound on the quantum query complexity of read-once functions
    Barnum, H
    Saks, M
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2004, 69 (02) : 244 - 258
  • [26] A method to prove query lower bounds
    Jagadish, M.
    Iyer, Sridhar
    [J]. ITICSE 2014 - Proceedings of the 2014 Innovation and Technology in Computer Science Education Conference, 2014, : 81 - 86
  • [27] Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester
    Lin, Cedric Yen-Yu
    Lin, Han-Hsuan
    [J]. 30TH CONFERENCE ON COMPUTATIONAL COMPLEXITY (CCC 2015), 2015, 33 : 537 - 566
  • [28] Upper Bounds on Quantum Query Complexity Inspired by the Elitzur-Vaidman Bomb Tester
    Lin, Cedric Yen-Yu
    Lin, Han-Hsuan
    [J]. THEORY OF COMPUTING, 2016, 12
  • [29] Lower bounds on the communication complexity of two-party (quantum) processes
    Montina, Alberto
    Wolf, Stefan
    [J]. 2014 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2014, : 1484 - 1488
  • [30] Optimal query complexity bounds for finding graphs
    Choi, Sung-Soon
    Kim, Jeong Han
    [J]. ARTIFICIAL INTELLIGENCE, 2010, 174 (9-10) : 551 - 569
12345