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 条
  • [31] The complexity of some problems related to GRAPH 3-COLORABILITY
    Brandstädt, A
    Le, VB
    Szymczak, T
    DISCRETE APPLIED MATHEMATICS, 1998, 89 (1-3) : 59 - 73
  • [32] Exact quantum query complexity of weight decision problems via Chebyshev polynomials
    Xiaoyu He
    Xiaoming Sun
    Guang Yang
    Pei Yuan
    Science China Information Sciences, 2023, 66
  • [33] Exact quantum query complexity of weight decision problems via Chebyshev polynomials
    Xiaoyu HE
    Xiaoming SUN
    Guang YANG
    Pei YUAN
    Science China(Information Sciences), 2023, 66 (02) : 297 - 298
  • [34] The quantum query complexity of 0-1 Knapsack and associated claw problems
    Arvind, V
    Schuler, R
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2003, 2906 : 168 - 177
  • [35] Exact quantum query complexity of weight decision problems via Chebyshev polynomials
    He, Xiaoyu
    Sun, Xiaoming
    Yang, Guang
    Yuan, Pei
    SCIENCE CHINA-INFORMATION SCIENCES, 2023, 66 (02)
  • [36] Quantum Complexity: Some Recent Results, Some Open Problems, Some Thoughts
    Lipton, Richard J.
    THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2011, 2011, 6648 : 171 - 171
  • [37] Quantum Query Complexity of Entropy Estimation
    Li, Tongyang
    Wu, Xiaodi
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2019, 65 (05) : 2899 - 2921
  • [38] The quantum query complexity of elliptic PDE
    Heinrich, Stefan
    JOURNAL OF COMPLEXITY, 2006, 22 (05) : 691 - 725
  • [39] LOWER BOUNDS ON QUANTUM QUERY COMPLEXITY
    Toran, Jacobo
    Hoyer, Peter
    Spalek, Robert
    BULLETIN OF THE EUROPEAN ASSOCIATION FOR THEORETICAL COMPUTER SCIENCE, 2005, (87): : 78 - 103
  • [40] Query complexity of quantum biased oracles
    Iwama, Kazuo
    Raymond, Rudy
    Yamashita, Shigeru
    QUANTUM COMPUTATION AND INFORMATION: FROM THEORY TO EXPERIMENT, 2006, 102 : 19 - 42
12345