首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   50篇
  免费   0篇
化学   10篇
数学   3篇
物理学   37篇
  2017年   1篇
  2012年   1篇
  2010年   1篇
  2009年   1篇
  2008年   1篇
  2006年   2篇
  2001年   1篇
  2000年   1篇
  1998年   1篇
  1997年   1篇
  1996年   1篇
  1995年   1篇
  1994年   3篇
  1993年   1篇
  1991年   2篇
  1989年   2篇
  1987年   1篇
  1985年   2篇
  1984年   3篇
  1981年   3篇
  1979年   2篇
  1978年   1篇
  1977年   3篇
  1976年   1篇
  1975年   3篇
  1974年   1篇
  1973年   1篇
  1972年   1篇
  1935年   1篇
  1932年   1篇
  1931年   1篇
  1930年   1篇
  1928年   1篇
  1927年   1篇
  1925年   1篇
排序方式: 共有50条查询结果,搜索用时 0 毫秒
1.
2.
Global stability theory is introduced as a tool allowing the classification of mathematical models of phase transitions. The point of view is that a topological structure whose stability controls the transition, can be identified in the process of computation of the partition function. In particular we discuss mean field theories and the two dimensional Ising model. Interesting features are disclosed concerning the classification of the instabilities, such as the number of parameters and possible approximations.  相似文献   
3.
Quantum knitting     
We analyze the connections between the mathematical theory of knots and quantum physics by addressing a number of algorithmic questions related to both knots and braid groups. Knots can be distinguished by means of “knot invariants,” among which the Jones polynomial plays a prominent role, since it can be associated with observables in topological quantum field theory. Although the problem of computing the Jones polynomial is intractable in the framework of classical complexity theory, it has been recently recognized that a quantum computer is capable of approximating it in an efficient way. The quantum algorithms discussed here represent a breakthrough for quantum computation, since approximating the Jones polynomial is actually a “universal problem,” namely, the hardest problem that a quantum computer can efficiently handle.  相似文献   
4.
5.
6.
7.
We construct nonlinear maps which realize the fermionization of bosons and the bosonization of fermions with the view of obtaining states coding naturally integers in standard or in binary basis. Specifically, with reference to spin systems, we derive raising and lowering bosonic operators in terms of standard fermionic operators and vice versa. The crucial role of multiboson operators in the whole construction is emphasized. Dedicated to Giuseppe Castagnoli for his 65th birthday.  相似文献   
8.
The group of diffeomorphisms is crucial in quantum computing. Representing it by vector fields over a d-manifold, d?2, accounting for both projective action and conformal symmetry at the quantum mechanical level, requires the direct-sum decomposition of tensor product for non-compact algebras, viable only for su(1,1). As a step towards the solution, a realization of the (d=1) Virasoro algebra VirDiff+(S(1)) in the universal envelope of su(1,1) (and h(1)) is presented, which is simple in the discrete positive series irreducible unitary representation of su(1,1).  相似文献   
9.
The paper provides a critical overview of the basic conceptual tools and algorithms of quantum information theory underlying the construction of quantum invariants of links and 3-manifolds as well as of their connections with algorithms and algorithmic complexity questions that arise in geometry and quantum gravity models.  相似文献   
10.
Summary The possible extension of the notion of generalized coherent state to the case of infinite-dimesional affine Lie algebras is discussed with special attention to the resulting topological structure of the coherent states manifold, and to its connection with the structure of the algebra. The relevance for the solution of nonlinear dynamical systems equations of motion is briefly reviewed. To speed up publication, the authors have agreed not to receive proofs which have been supervised by the Scientific Committee.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号