How Chaotic is a State of a Quantum System ?
A. Wehrl (1973)
Recherche Coopérative sur Programme n°25
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
A. Wehrl (1973)
Recherche Coopérative sur Programme n°25
Similarity:
D. Goderis, C. Maes (1991)
Annales de l'I.H.P. Physique théorique
Similarity:
P. Ługiewicz, R. Olkiewicz (2006)
Banach Center Publications
Similarity:
Robert, Didier (2008)
Serdica Mathematical Journal
Similarity:
2000 Mathematics Subject Classification: 81Q60, 35Q40. A standard supersymmetric quantum system is defined by a Hamiltonian [^H] = ½([^Q]*[^Q] +[^Q][^Q]*), where the super-charge [^Q] satisfies [^Q]2 = 0, [^Q] commutes with [^H]. So we have [^H] ≥ 0 and the quantum spectrum of [^H] is non negative. On the other hand Pais-Ulhenbeck proposed in 1950 a model in quantum-field theory where the d'Alembert operator [¯] = [(∂2)/( ∂t2)] − Δx is replaced by fourth order operator [¯]([¯]...
Majewski, Adam W., Zegarlinski, Boguslaw (1995)
Mathematical Physics Electronic Journal [electronic only]
Similarity:
Bi, Qiao, Guo, Liu, Ruda, H.E. (2010)
Advances in Mathematical Physics
Similarity:
(1998)
Banach Center Publications
Similarity:
Bishop, R.C., Bohm, A., Gadella, M. (2004)
Discrete Dynamics in Nature and Society
Similarity:
Atmanspacher, Harald (2004)
Discrete Dynamics in Nature and Society
Similarity:
Katz, Matthew Lubelski, Wang, Jingbo (2010)
Advances in Mathematical Physics
Similarity:
Diego de Falco, Dario Tamascelli (2011)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Quantum annealing, or quantum stochastic optimization, is a classical randomized algorithm which provides good heuristics for the solution of hard optimization problems. The algorithm, suggested by the behaviour of quantum systems, is an example of proficuous cross contamination between classical and quantum computer science. In this survey paper we illustrate how hard combinatorial problems are tackled by quantum computation and present some examples of the heuristics provided by quantum...
I. Aref'eva, P. Medvedev, O. Rytchkov, I. Volovich (1998)
Banach Center Publications
Similarity:
We consider the classical and quantum dynamics of D0 branes within the Yang-Mills approximation. Using a simple ansatz we show that a classical trajectory exhibits a chaotic motion. Chaotic dynamics in N=2 supersymmetric Yang-Mills theory is also discussed.
Maysam Maysami Sadr (2017)
Czechoslovak Mathematical Journal
Similarity:
We define algebraic families of (all) morphisms which are purely algebraic analogs of quantum families of (all) maps introduced by P. M. Sołtan. Also, algebraic families of (all) isomorphisms are introduced. By using these notions we construct two classes of Hopf-algebras which may be interpreted as the quantum group of all maps from a finite space to a quantum group, and the quantum group of all automorphisms of a finite noncommutative (NC) space. As special cases three classes of NC...
Akram, Javed, Naseer, Khalid, Rehman, Inam-Ur, Saif, Farhan (2009)
Mathematical Problems in Engineering
Similarity: