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 条

[21] Some lower bounds for the complexity of continuation methods
Dedieu, JP
Smale, S
[J]. JOURNAL OF COMPLEXITY, 1998, 14 (04) : 454 - 465
[22] ON LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
洪加威
[J]. Science in China,SerA., 1979, Ser.A.1979 (08) : 890 - 900
[23] LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
HONG, J
[J]. SCIENTIA SINICA, 1979, 22 (08): : 890 - 900
[24] ON LOWER BOUNDS OF TIME COMPLEXITY OF SOME ALGORITHMS
洪加威
[J]. Science China Mathematics, 1979, (08) : 890 - 900
[25] On Lower Bounds for the Time and the Bit Complexity of Some Probabilistic Distributed Graph Algorithms (Extended Abstract)
Fontaine, Allyx
Metivier, Yves
Robson, John Michael
Zemmari, Akka
[J]. SOFSEM 2014: THEORY AND PRACTICE OF COMPUTER SCIENCE, 2014, 8327 : 235 - 245
[26] Hardness of Continuous Local Search: Query Complexity and Cryptographic Lower Bounds
Hubacek, Pavel
Yogev, Eylon
[J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 1352 - 1371
[27] 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
[28] HARDNESS OF CONTINUOUS LOCAL SEARCH: QUERY COMPLEXITY AND CRYPTOGRAPHIC LOWER BOUNDS
Hubacek, Pavel
Yogev, Eylon
[J]. SIAM JOURNAL ON COMPUTING, 2020, 49 (06) : 1128 - 1172
[29] 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
[30] General lower bounds on the query complexity within the exact learning model
Klasner, N
Simon, HU
[J]. DISCRETE APPLIED MATHEMATICS, 2000, 107 (1-3) : 61 - 81

← 1 2 3 4 5 →