Quantum query algorithms and lower bounds

被引：0
|
作者：
Ambainis, A [1 ]
机构：
[1] Inst Adv Study, Sch Math, Princeton, NJ 08540 USA
来源：
Classical and New Paradigms of Computation and Their Complexity Hierarchies | 2004年 / 23卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Many quantum algorithms can be analyzed in a query (oracle) model where input is given by a black box that answers queries and the complexity of the algorithm is measured by the number of queries to the black box that it uses. We survey the main results and techniques in this model, with an emphasis on lower bound methods.
引用
收藏
页码：15 / 32
页数：18
相关论文
共 50 条
  • [1] LOWER BOUNDS ON QUANTUM QUERY COMPLEXITY
    Toran, Jacobo
    Hoyer, Peter
    Spalek, Robert
    [J]. BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (87): : 78 - 103
  • [2] Lower Bounds in the Preprocessing and Query Phases of Routing Algorithms
    White, Colin
    [J]. ALGORITHMS - ESA 2015, 2015, 9294 : 1013 - 1024
  • [3] Adversary lower bounds for nonadaptive quantum algorithms
    Koiran, Pascal
    Landes, Juergen
    Portier, Natacha
    Yao, Penghui
    [J]. LOGIC, LANGUAGE, INFORMATION AND COMPUTATION, 2008, 5110 : 226 - +
  • [4] Quantum algorithms and lower bounds for convex optimization
    Chakrabarti, Shouvanik
    Childs, Andrew M.
    Li, Tongyang
    Wu, Xiaodi
    [J]. QUANTUM, 2020, 4
  • [5] Adversary lower bounds for nonadaptive quantum algorithms
    Koiran, Pascal
    Landes, Juergen
    Portier, Natacha
    Yao, Penghui
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2010, 76 (05) : 347 - 355
  • [6] Lower bounds for adiabatic quantum algorithms by quantum speed limits
    Chen, Jyong-Hao
    [J]. PHYSICAL REVIEW RESEARCH, 2023, 5 (03):
  • [7] Quantum learning algorithms imply circuit lower bounds
    Arunachalam, Srinivasan
    Grilo, Alex B.
    Gur, Tom
    Oliveira, Igor C.
    Sundaram, Aarthi
    [J]. Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS, 2022, 2022-February : 562 - 573
  • [8] Quantum learning algorithms imply circuit lower bounds
    Arunachalam, Srinivasan
    Grilo, Alex B.
    Gur, Tom
    Oliveira, Igor C.
    Sundaram, Aarthi
    [J]. 2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 562 - 573
  • [9] 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
  • [10] 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
12345