TITLE

Combining semiclassical time evolution and quantum Boltzmann operator to evaluate reactive flux correlation function for thermal rate constants of complex systems

AUTHOR(S)
Yamamoto, Takeshi; Wang, Haobin; Miller, William H.
PUB. DATE
May 2002
SOURCE
Journal of Chemical Physics;5/1/2002, Vol. 116 Issue 17, p7335
SOURCE TYPE
Academic Journal
DOC. TYPE
Article
ABSTRACT
The semiclassical (SC) initial value representation (IVR) provides a way for including quantum effects into classical molecular dynamics simulations. Implementation of the SC-IVR to the thermal rate constant calculation, based on the reactive flux correlation function formalism, has two major obstacles: (1) the SC integrand may be highly oscillatory with respect to the initial phase space variables; and (2) matrix elements of the Boltzmannized flux operator, which are crucial in generating the initial (or final) distribution for the SC trajectories, are generally not available in analytic forms. In this paper, we present practical ways of overcoming these two barriers for the SC calculation of thermal rate constants. For the first problem, we show that use of a symmetric flux–flux correlation function, together with the generalized Filinov transformation technique, can significantly smooth the corresponding SC integrand and make the calculation practical for quite large systems. For the second problem, we propose a general method for evaluating matrix elements of the Boltzmannized flux operator “on-the-fly,” based on the combination of the imaginary-time path integral technique with the Metropolis random walk algorithm. Using these approaches, it is shown that thermal rate constants can be obtained for systems with more than 100 degrees of freedom, as well as for reactions in the deep tunneling regimes where quantum effects are significant. © 2002 American Institute of Physics.
ACCESSION #
6494737

 

Related Articles

  • Quantum random walk for U[sub q](su)(2)) and a new example of quantum noise. Lenczewski, Romuald // Journal of Mathematical Physics;May96, Vol. 37 Issue 5, p2260 

    Studies the quantum random walk for the Hopf algebra U[sub q](su(2)). Central limit theorem for sample sums of the algebra; Convergence of finite joint correlations for the sample sums; Framework for the general theory of quantum noise on graded bioalgebras.

  • The penalty method for random walks with uncertain energies. Ceperley, D.M.; Dewing, M. // Journal of Chemical Physics;5/22/1999, Vol. 110 Issue 20, p9812 

    Focuses on the generalization of the random walk algorithm to the situation where the energy is noisy and can only be estimated. Applications for a long range potentials and for mixed quantum-classical simulations; Ability to modify the acceptance probability by applying a penalty to the energy...

  • THE VARIOUS FACETS OF RANDOM WALK ENTROPY. Burda, Z.; Duda, J.; Luck, J. M.; Waclaw, B. // Acta Physica Polonica B;May2010, Vol. 41 Issue 5, p949 

    We review various features of the statistics of random paths on graphs. The relationship between path statistics and Quantum Mechanics (QM) leads to two canonical ways of defining random walk on a graph, which have different statistics and hence different entropies. Generic random walk (GRW) is...

  • Quantum Algorithms for Graph and Algebra Problems. Dörn, Sebastian // Recent Patents on Computer Science;Jun2009, Vol. 2 Issue 2, p124 

    Quantum algorithms have the potential to demonstrate that for some problems quantum computation is more efficient than classical computation. A goal of quantum computing is to determine for which problems quantum computers are faster than classical computers. In our survey we present recent...

  • Analysis of quantum walks with time-varying coin on d-dimensional lattices. Albertini, Francesca; D'Alessandro, Domenico // Journal of Mathematical Physics;Dec2009, Vol. 50 Issue 12, p122106 

    In this paper, we present a study of discrete time quantum walks whose underlying graph is a d-dimensional lattice. The dynamical behavior of these systems is of current interest because of their applications in quantum information theory as tools to design quantum algorithms. We assume that, at...

  • Quantum Stochastic Processes. Spring, William Joseph // AIP Conference Proceedings;4/13/2009, Vol. 1110 Issue 1, p443 

    We consider quantum analogues of n-parameter stochastic processes, associated integrals and martingale properties extending classical results obtained in [1, 2, 3], and quantum results in [4, 5, 6, 7, 8, 9, 10].

  • Quantum walk and potential application. Wang, J. B.; Douglas, B. L. // AIP Conference Proceedings;6/16/2010, Vol. 1246 Issue 1, p195 

    Quantum walk represents a generalised version of the well-known classical random walk. Regardless of their apparent connection, the dynamics of quantum walk is often non-intuitive and far deviate from its classical counterpart. However, despite such potentially superior efficiency in quantum...

  • Random-walk approximation to vacuum cocycles. Belton, Alexander C. R. // Journal of the London Mathematical Society;Apr2010, Vol. 81 Issue 2, p412 

    Quantum random walks are constructed on operator spaces with the aid of matrix-space lifting, a type of ampliation intermediate between those provided by spatial and ultraweak tensor products. Using a form of Wiener–Itô decomposition, a Donsker-type theorem is proved, showing that...

  • A hybrid classical-quantum clustering algorithm based on quantum walks. Li, Qiang; He, Yan; Jiang, Jing-ping // Quantum Information Processing;Feb2011, Vol. 10 Issue 1, p13 

    The enormous successes have been made by quantum algorithms during the last decade. In this paper, we combine the quantum walk (QW) with the problem of data clustering, and develop two clustering algorithms based on the one-dimensional discrete-time QW. Then, the position probability...

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