The penalty method for random walks with uncertain energies

Ceperley, D.M.; Dewing, M.
May 1999
Journal of Chemical Physics;5/22/1999, Vol. 110 Issue 20, p9812
Academic Journal
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 difference.


Related Articles

  • 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...

  • Combining semiclassical time evolution and quantum Boltzmann operator to evaluate reactive flux correlation function for thermal rate constants of complex systems. Yamamoto, Takeshi; Wang, Haobin; Miller, William H. // Journal of Chemical Physics;5/1/2002, Vol. 116 Issue 17, p7335 

    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...

  • 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...

  • Quantum Algorithm for Modified Three-dimensional Random Walk Problem by Central Limit Theorem. Fujimura, Toru // Global Journal of Pure & Applied Mathematics;2012, Vol. 8 Issue 5, p501 

    A quantum algorithm for a modified three-dimensional random walk problem by the central limit theorem and its example are reported. When a random variable Vi [1 ≤ i ≤ n. i and n are integers.] becomes (1, 1, 1), (-1,-1,-1), (-1, 1, 1), (1,-1,-1), (-1,-1, 1), (1, 1,-1), (1,-1, 1) and...

  • Hitting time of quantum walks with perturbation. Chiang, Chen-Fu; Gomez, Guillermo // Quantum Information Processing;Jan2013, Vol. 12 Issue 1, p217 

    The hitting time is the required minimum time for a Markov chain-based walk (classical or quantum) to reach a target state in the state space. We investigate the effect of the perturbation on the hitting time of a quantum walk. We obtain an upper bound for the perturbed quantum walk hitting time...

  • Efficiency of open quantum walk implementation of dissipative quantum computing algorithms. Sinayskiy, Ilya; Petruccione, Francesco // Quantum Information Processing;Oct2012, Vol. 11 Issue 5, p1301 

    An open quantum walk formalism for dissipative quantum computing is presented. The approach is illustrated with the examples of the Toffoli gate and the Quantum Fourier Transform for 3 and 4 qubits. It is shown that the algorithms based on the open quantum walk formalism are more efficient than...

  • Quantum walks: a comprehensive review. Venegas-Andraca, Salvador // Quantum Information Processing;Oct2012, Vol. 11 Issue 5, p1015 

    Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a solid field of research of quantum computation full of...

  • 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.


Read the Article


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

Try another library?
Sign out of this library

Other Topics