理学 >>> 物理学 >>> 理论物理学 声学 热学 光学 电磁学 无线电物理 电子物理学 凝聚态物理学 等离子体物理学 原子分子物理学 原子核物理学 高能物理学 计算物理学 应用物理学 物理学其他学科
搜索结果: 1-15 共查到物理学 complexity相关记录18条 . 查询时间(0.085 秒)
Some physical implementation schemes of quantum computing -- such as those based on superconducting qubits, quantum dots, and cold atoms -- can apply two-qubit gates only on certain pairs of qubits. O...
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 ...
We briefly review some of the scientific challenges and epistemological issues related to climate science. We discuss the formulation and testing of theories and numerical models, which, given the pre...
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...
Bit commitment schemes are at the basis of modern cryptography. Since information-theoretic security is impossible both in the classical and the quantum regime, we need to look at computationally secu...
One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little further philosophical importance. In this essay, I offer a detailed c...
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...
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...
In this paper we present an equilibrium value based framework for solving SDPs via the multiplicative weight update method which is different from the one in Kale’s thesis [Kal07]. One of the main adv...
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...
In this work, we analyze the behavior of statistical complexity in several systems where two identical densities that travel in opposite direction cross each other. The crossing between two Gaussian, ...
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...
2007Vol.48No.2pp.264-266DOI: Quantum Query Complexity for Searching Multiple Marked States from an Unsorted Database SHANG Bin School of Computer Science & Technology, ...
14-Mar-2007,EAST LANSING, Mich. -- Despite advances in experimental nuclear physics, the most detailed probing of atomic nuclei still requires heavy doses of advanced nuclear theory. The problem is th...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...