搜索结果: 1-11 共查到“理论物理学 complexity”相关记录11条 . 查询时间(0.076 秒)
Internal Diffusion-Limited Aggregation: Parallel Algorithms and Complexity
Internal diffusion gathered circuit subset the comparator
2014/12/22
The computational complexity of internal diffusion-limited aggregation (DLA) is examined from both a theoretical and a practical point of view. We show that for two or more dimensions, the problem of ...
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....
Aging is a fundamental aspect of living systems that undergo a progressive deterioration of physiological function with age and an increase of vulnerability to disease and death. Living systems, know...
Phase-space characterization of complexity in quantum many-body dynamics
Phase-space characterization complexity quantum many-body dynamics
2010/10/18
We propose a phase-space Wigner harmonics entropy measure for many-body quantum dynamical
complexity. This measure, which reduces to the well known measure of complexity in classical
systems and whi...
Statistical mechanics of classical and quantum computational complexity
Statistical mechanics classical quantum computational
2010/10/22
The quest for quantum computers is motivated by their potential for solving problems that defy
existing, classical, computers. The theory of computational complexity, one of the crown jewels of compu...
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...
Non-locality distillation and post-quantum theories with trivial communication complexity
Non-locality distillation post-quantum theories trivial communication complexity
2010/4/9
We first present a protocol for deterministically distilling non-locality, building upon a recent result of Forster et al. [Phys. Rev. Lett. 102, 120401 (2009)]. Our protocol, which is optimal for two...
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...