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 条
  • [1] Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
    Laplante, Sophie
    Magniez, Frederic
    [J]. SIAM JOURNAL ON COMPUTING, 2008, 38 (01) : 46 - 62
  • [2] Lower bounds for randomized and quantum query complexity using Kolmogorov arguments
    Laplante, S
    Magniez, F
    [J]. 19TH IEEE ANNUAL CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2004, : 294 - 304
  • [3] Quantum query algorithms and lower bounds
    Ambainis, A
    [J]. Classical and New Paradigms of Computation and Their Complexity Hierarchies, 2004, 23 : 15 - 32
  • [4] Lower bounds for query complexity of some graph problems
    Lace, L
    Freivalds, R
    [J]. VLSI'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VLSI, 2003, : 309 - 313
  • [5] Lower bounds for the query complexity of equilibria in Lipschitz games
    Goldberg, Paul W.
    Katzman, Matthew J.
    [J]. THEORETICAL COMPUTER SCIENCE, 2023, 962
  • [6] Lower bounds for quantum communication complexity
    Klauck, H
    [J]. 42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 288 - 297
  • [7] Lower bounds for quantum communication complexity
    Klauck, Hartmut
    [J]. SIAM JOURNAL ON COMPUTING, 2007, 37 (01) : 20 - 46
  • [8] An algorithmic argument for nonadaptive query complexity lower bounds on advised quantum computation (Extended abstract)
    Nishimura, H
    Yamakami, T
    [J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2004, PROCEEDINGS, 2004, 3153 : 827 - 838
  • [9] Lower Bounds on Quantum Query Complexity for Read-Once Formulas with XOR and MUX Operators
    Fukuhara, Hideaki
    Takimoto, Eiji
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2010, E93D (02) : 280 - 289
  • [10] Some graph problems with equivalent lower bounds for query complexity
    Láce, L
    Praude, R
    Freivalds, R
    [J]. FCS '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON FOUNDATIONS OF COMPUTER SCIENCE, 2005, : 80 - 86
12345