Lower bounds for query complexity of some graph problems

被引：0
|
作者：
Lace, L [1 ]
Freivalds, R [1 ]
机构：
[1] Univ Latvia, Inst Math & Comp Sci, LV-1459 Riga, Latvia
来源：
VLSI'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VLSI | 2003年
关键词：
quantum computation; query algorithms; lower bounds;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
The paper [BuhdW02] by H.Buhrman and P, de Wolf contains an impressive survey of solved and open problem in quantum query complexity, including many graph problems. We use recent results by A.Ambainis [Amb02] to prove higher lower bounds for some of these problems. Some of our new lower bounds do not close the gap between the best upper and lower bounds. We prove in these cases that it is impossible to provide a better application of Ambainis' technique for these problems.
引用
收藏
页码：309 / 313
页数：5
相关论文
共 50 条
  • [1] 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
  • [2] Quantum query complexity for some graph problems
    Berzina, A
    Dubrovsky, A
    Freivalds, R
    Lace, L
    Scegulnaja, O
    [J]. SOFSEM 2004: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2004, 2932 : 140 - 150
  • [3] Quantum query complexity of some graph problems
    Dürr, C
    Heiligman, M
    Hoyer, P
    Mhalla, M
    [J]. SIAM JOURNAL ON COMPUTING, 2006, 35 (06) : 1310 - 1328
  • [4] Quantum query complexity of some graph problems
    Dürr, C
    Heiligman, M
    Hoyer, P
    Mhalla, M
    [J]. AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2004, 3142 : 481 - 493
  • [5] The Query Complexity of Graph Isomorphism: Bypassing Distribution Testing Lower Bounds
    Onak, Krzysztof
    Sun, Xiaorui
    [J]. STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING, 2018, : 165 - 171
  • [6] 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
  • [7] Lower bounds for the majority communication complexity of various graph accessibility problems
    Meinel, C.
    Waack, S.
    [J]. Theory of Computing Systems, 1996, 29 (06): : 649 - 659
  • [8] Lower bounds for the majority communication complexity of various graph accessibility problems
    Meinel, C
    Waack, S
    [J]. MATHEMATICAL SYSTEMS THEORY, 1996, 29 (06): : 649 - 659
  • [9] LOWER BOUNDS FOR THE MODULAR COMMUNICATION COMPLEXITY OF VARIOUS GRAPH ACCESSIBILITY PROBLEMS
    MEINEL, C
    WAACK, S
    [J]. LATIN '95: THEORETICAL INFORMATICS, 1995, 911 : 427 - 435
  • [10] Query complexity lower bounds for reconstruction of codes
    Chakraborty, Sourav
    Fischer, Eldar
    Matsliah, Arie
    [J]. Theory of Computing, 2014, 10 : 513 - 533
12345