搜索结果: 1-6 共查到“理学 Query Complexity”相关记录6条 . 查询时间(0.078 秒)
Quantum query complexity of minor-closed graph properties
Quantum query minor-closed graph properties
2010/11/8
We study the quantum query complexity of minor-closed graph properties, which include such problems as determining whether a graph is planar, is a forest, or does not contain a path of a given length....
We study the power of nonadaptive quantum query algorithms, which are algorithms whose queries to the input do not depend on the result of previous queries. First, we show that any bounded-error nonad...
Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database
quantum algorithm unsorted database search problem quantum query complexity
2007/8/15
2007Vol.48No.2pp.264-266DOI:
Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database
SHANG Bin
School of Computer Science & Technology, ...
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
Quantum Query Complexity Two and Three Dimensions
2012/11/29
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature.For the d-dimensional grid graphs, the complexity has been determined asymptotic...
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go.
Graph Properties Circular Functions Quantum Query
2012/11/29
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity.That is, for a permutation group Γ, how low can the complexity be for any boolean fu...
Query Complexity: Worst-Case Quantum Versus Average-Case Classical
Query Complexity Worst-Case Quantum Versus Average-Case Classical
2010/10/18
Withdrawn. The results in the paper only work for a certain subclass of Boolean functions, in which block sensitivity has properties similar to those of ordinary sensitivity. They don’t work in genera...