Quantum query complexity of some graph problems

被引：0
|
作者：
Dürr, C
Heiligman, M
Hoyer, P
Mhalla, M
机构：
[1] Univ Paris 11, UMR 8623, Rech Informat Lab, F-91405 Orsay, France
[2] Natl Secur Agcy, Adv Res & Dev Activ, Ft George G Meade, MD 20755 USA
[3] Univ Calgary, Dept Comp Sci, Calgary, AB T2N 1N4, Canada
[4] Inst IMAG, Lab Leibniz, Grenoble, France
来源：
AUTOMATA , LANGUAGES AND PROGRAMMING, PROCEEDINGS | 2004年 / 3142卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for the bounded error quantum query complexity Of CONNECTIVITY, STRONG CONNECTIVITY, MINIMUM SPANNING TREE, and SINGLE SOURCE SHORTEST PATHS. For example we show that the query complexity of MINIMUM SPANNING TREE is in Theta(n(3/2)) in the matrix model and in Theta(rootnm) in the array model, while, the complexity of CONNECTIVITY is also in Theta(n(3/2)) in the matrix model, but in Theta(n) in the array model. The upper bounds utilize search procedures for finding minima of functions under various conditions.
引用
收藏
页码：481 / 493
页数：13
相关论文
共 50 条
  • [1] Quantum query complexity for some graph problems
    Berzina, A
    Dubrovsky, A
    Freivalds, R
    Lace, L
    Scegulnaja, O
    SOFSEM 2004: THEORY AND PRACTICE OF COMPUTER SCIENCE, PROCEEDINGS, 2004, 2932 : 140 - 150
  • [2] Quantum query complexity of some graph problems
    Dürr, C
    Heiligman, M
    Hoyer, P
    Mhalla, M
    SIAM JOURNAL ON COMPUTING, 2006, 35 (06) : 1310 - 1328
  • [3] Lower bounds for query complexity of some graph problems
    Lace, L
    Freivalds, R
    VLSI'03: PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VLSI, 2003, : 309 - 313
  • [4] Some graph problems with equivalent lower bounds for query complexity
    Láce, L
    Praude, R
    Freivalds, R
    FCS '05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON FOUNDATIONS OF COMPUTER SCIENCE, 2005, : 80 - 86
  • [5] Quantum query complexity of symmetric oracle problems
    Copeland, Daniel
    Pommersheim, Jamie
    QUANTUM, 2021, 5
  • [6] Open Problems Related to Quantum Query Complexity
    Aaronson, Scott
    ACM TRANSACTIONS ON QUANTUM COMPUTING, 2021, 2 (04):
  • [7] Parameterized Quantum Query Algorithms for Graph Problems
    Terao, Tatsuya
    Mori, Ryuhei
    Leibniz International Proceedings in Informatics, LIPIcs, 308
  • [8] QUANTUM QUERY COMPLEXITY OF MINOR-CLOSED GRAPH PROPERTIES
    Childs, Andrew M.
    Kothari, Robin
    SIAM JOURNAL ON COMPUTING, 2012, 41 (06) : 1426 - 1450
  • [9] Quantum query complexity of minor-closed graph properties
    Childs, Andrew M.
    Kothari, Robin
    28TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2011), 2011, 9 : 661 - 672
  • [10] On the Complexity of Some Problems Related to Graph Extensions
    Abrosimov, M. B.
    MATHEMATICAL NOTES, 2010, 88 (5-6) : 619 - 625
12345