ﻻ يوجد ملخص باللغة العربية
The often elusive Poincare recurrence can be witnessed in a completely separable system. For such systems, the problem of recurrence reduces to the classic mathematical problem of simultaneous Diophantine approximation of multiple numbers. The latter problem then can be somewhat satisfactorily solved by using the famous Lenstra-Lenstra-Lov{a}sz (LLL) algorithm, which is implemented in the Mathematica built-in function verbLatticeReduce. The procedure is illustrated with a harmonic chain. The incredibly large recurrence times are obtained exactly. They follow the expected scaling law very well.
The existence in the physical QCD vacuum of nonzero gluon condensates, such as $<g^2F^2>$, requires dominance of gluon fields with finite mean action density. This naturally allows any real number value for the unit ``topological charge $q$ character
This Mathematica 7.0/8.0 package upgrades and extends the quantum computer simulation code called QDENSITY. Use of the density matrix was emphasized in QDENSITY, although that code was also applicable to a quantum state description. In the present ve
This book is an attempt to help students transform all of the concepts of quantum mechanics into concrete computer representations, which can be constructed, evaluated, analyzed, and hopefully understood at a deeper level than what is possible with m
The purpose of an entanglement witness experiment is to certify the creation of an entangled state from a finite number of trials. The statistical confidence of such an experiment is typically expressed as the number of observed standard deviations o
The ability to coherently control mechanical systems with optical fields has made great strides over the past decade, and now includes the use of photon counting techniques to detect the non-classical nature of mechanical states. These techniques may