TITLE

A note on Magnus formula

AUTHOR(S)
Prato, D.; Lamberti, P.W.
PUB. DATE
March 1997
SOURCE
Journal of Chemical Physics;3/15/1997, Vol. 106 Issue 11, p4640
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
Evaluates the Magnus formula for the time evolution operator in quantum mechanics from an algorithmic point of view. Rules and guidelines in obtaining the general term in the expansion as a compact time-ordered integral; Application of the rules in the fifth order; Obtaining the nth order in Magnus expansion by means of a direct computational implementation.
ACCESSION #
4163268

 

Related Articles

  • An alternative to the magnus expansion in time-dependent perturbation theory. Salzman, W. R. // Journal of Chemical Physics;1/15/1985, Vol. 82 Issue 2, p822 

    An alternative to the Magnus expansion in time-dependent quantum mechanical perturbation theory is presented. An exponential form of the time-development operator, given as the exponential of a sum of products of integrals well known in time-dependent quantum mechanics, is derived from the...

  • Balancing of flexible rotors based on evolutionary algorithms. OKE, WASIU ADEYEMI; ABIDO, MOHAMMAD ALI; ASAFA, TESLEEM BABATUNDE // Mechanics & Industry;2015, Vol. 16 Issue 4, p406-1 

    An unbalance in a rotating flexible rotor causes excessive vibration and elastic deformations with subsequent malfunction and failure. In spite of different techniques deployed to reduce or eliminate rotor unbalance, it is impossible to remove the unbalance completely. The unbalance will only be...

  • Quantum information and computation. Bennett, Charles H. // Physics Today;Oct95, Vol. 48 Issue 10, p24 

    Focuses on the emerging quantum theory of communication and computation, in which the stuff transmitted is not classical information but arbitrary superpositions of quantum states. Fundamental properties of quantum systems; Nature of quantum information processing; Quantum data compression; Fast...

  • Implementation of a three-quantum-bit search algorithm. Vandersypen, Lieven M. K.; Steffen, Matthias; Sherwood, Mark H.; Yannoni, Costantino S.; Breyta, Gregory; Chuang, Isaac L. // Applied Physics Letters;1/31/2000, Vol. 76 Issue 5, p646 

    We report the experimental implementation of Grover's quantum search algorithm on a quantum computer with three quantum bits. The computer consists of molecules of [sup 13]C-labeled CHFBr[sub 2], in which the three weakly coupled spin-1/2 nuclei behave as the bits and are initialized,...

  • Quantum Recognition of Eigenvalues, Structure of Devices, and Thermodynamic Properties. Ozhigov, Yu. I. // Journal of Experimental & Theoretical Physics;Feb2003, Vol. 96 Issue 2, p340 

    Quantum algorithms that speed up their classical counterparts are proposed for the following problems: recognition of eigenvalues with a fixed precision, recognition of molecular and electronic device structures, and the finding of thermodynamic functions. We mainly consider structures that...

  • Noniterative algorithms for finding quantum optimal controls. Wusheng Zhu; Rabitz, Herschel // Journal of Chemical Physics;4/15/1999, Vol. 110 Issue 15, p7142 

    Reports on the development of noniterative algorithms for finding quantum optimal controls. Zeroth-order approximation developed as a reference case; First-order approximation; Modified first-order approximation; Results of numerical tests.

  • Iterative evaluation of the path integral for a system coupled to an anharmonic bath. Makri, Nancy // Journal of Chemical Physics;10/8/1999, Vol. 111 Issue 14, p6164 

    Reports on an iterative algorithm for evaluating the path integral expression for the reduced density matrix of a quantum system interacting with an anharmonic dissipative bath whose influence functional is obtained through numerical methods Consistency of the bath in terms of spectator...

  • Flat Histogram Methods for Quantum Systems. Wessel, Stefan; Troyer, Matthias; Alet, Fabien // AIP Conference Proceedings;2003, Vol. 690 Issue 1, p402 

    We present generalizations of the classical flat histogram algorithm of Wang and Landau to quantum systems. The algorithms proceed by stochastically evaluating the coefficients of a high temperature series expansion or a finite temperature perturbation expansion to arbitrary order. Similar to...

  • Preconditioned complex generalized minimal residual algorithm for dense algebraic variational equations in quantum reactive scattering. Reeves, Melissa S.; Chatfield, David C.; Truhlar, Donald G. // Journal of Chemical Physics;8/15/1993, Vol. 99 Issue 4, p2739 

    Variational basis-set formulations of the quantum mechanical reactive scattering problem lead to large, dense sets of equations. In previous work, we showed that the generalized minimal residual (GMRes) algorithm is sometimes competitive in terms of computer time with direct methods for these...

Share

Read the Article

Courtesy of THE LIBRARY OF VIRGINIA

Sorry, but this item is not currently available from your library.

Try another library?
Sign out of this library

Other Topics