Polynomial degree vs. quantum query complexity

被引：59
|
作者：
Ambainis, A
机构：
[1] Univ Waterloo, Dept Combinator & Optimizat, Waterloo, ON N2L 3G1, Canada
[2] Univ Waterloo, Inst Quantum Comp, Waterloo, ON N2L 3G1, Canada
来源：
JOURNAL OF COMPUTER AND SYSTEM SCIENCES | 2006年 / 72卷 / 02期
关键词：
quantum lower bounds; quantum query complexity; polynomial degree of Boolean functions;
D O I：
10.1016/j.jcss.2005.06.006
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bounds on quantum algorithms. It has been an open problem whether this lower bound is tight. We exhibit a function with polynomial degree M and quantum query complexity Omega(M-1.321...). This is the first superlinear separation between polynomial degree and quantum query complexity. The lower bound is shown by a generalized version of the quantum adversary method. (c) 2005 Elsevier Inc. All rights reserved.
引用
收藏
页码：220 / 238
页数：19
相关论文
共 50 条
  • [1] Polynomial degree vs. quantum query complexity
    Ambainis, A
    44TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2003, : 230 - 239
  • [2] Space Complexity Vs. Query Complexity
    Oded Lachish
    Ilan Newman
    Asaf Shapira
    computational complexity, 2008, 17 : 70 - 93
  • [3] Space complexity vs. query complexity
    Lachish, Oded
    Newman, Ilan
    Shapira, Asaf
    COMPUTATIONAL COMPLEXITY, 2008, 17 (01) : 70 - 93
  • [4] Space complexity vs. query complexity
    Lachish, Oded
    Newman, Ilan
    Shapira, Asaf
    APPROXIMATION, RANDOMIZATION AND COMBINATORIAL OPTIMIZATION: ALGORITHMS AND TECHNIQUES, 2006, 4110 : 426 - 437
  • [5] The quantum query complexity of the hidden subgroup problem is polynomial
    Ettinger, M
    Hoyer, P
    Knill, E
    INFORMATION PROCESSING LETTERS, 2004, 91 (01) : 43 - 48
  • [6] Ultrametric Vs. Quantum Query Algorithms
    Freivalds, Rusins
    THEORY AND PRACTICE OF NATURAL COMPUTING (TPNC 2014), 2014, 8890 : 1 - 10
  • [7] Boolean functions with a low polynomial degree and quantum query algorithms
    Ozols, R
    Freivalds, R
    Ivanovs, J
    Kalnina, E
    Lace, L
    Miyakawa, M
    Tatsumi, H
    Taimina, D
    SOFSEM 2005:THEORY AND PRACTICE OF COMPUTER SCIENCE, 2005, 3381 : 408 - 412
  • [8] Metric 1-Median Selection: Query Complexity vs. Approximation Ratio
    Chang, Ching-Lueh
    COMPUTING AND COMBINATORICS, COCOON 2016, 2016, 9797 : 131 - 142
  • [9] Metric 1-Median Selection: Query Complexity vs. Approximation Ratio
    Chang, Ching-Lueh
    ACM TRANSACTIONS ON COMPUTATION THEORY, 2018, 9 (04)
  • [10] Degree vs. Approximate Degree and Quantum Implications of Huang's Sensitivity Theorem
    Aaronson, Scott
    Ben-David, Shalev
    Kothari, Robin
    Rao, Shravas
    Tal, Avishay
    STOC '21: PROCEEDINGS OF THE 53RD ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2021, : 1330 - 1342
12345