Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Physica A Statistical Mechanics and its Applications

A quantum Langevin model

Lorena Romero-Salazar, R. M. Velasco

Published Jan 1, 1997• 2 citations
Publisher
DOI
10.1016/s0378-4371(96)00306-8

Related papers

The Langevin method and Hubbard-like models

Mark Gross, Herbert W. Hamber

Physica C Superconductivity•Dec 1, 1989•0 citations

The quantum Langevin equation from the independent-oscillator model

G. W. Ford

Lecture notes in mathematics•Jan 1, 1988•1 citation

Benchmarking quantum annealing dynamics: The spin-vector Langevin model

David Subires, Fernando J. Gómez-Ruiz, A. Ruiz +2 more

The classical spin-vector Monte Carlo (SVMC) model is a reference benchmark for the performance of a quantum annealer. Yet, as a Monte Carlo method, SVMC is unsuited for an accurate description of the annealing dynamics in real-time. We introduce the spin-vector Langevin (SVL) model as an alternative benchmark in which the time evolution is described by Langevin dynamics. The SVL model is shown to provide a more stringent test than the SVMC model for the identification of quantum signatures in the performance of quantum annealing devices, as we illustrate by describing the Kibble-Zurek scaling associated with the dynamics of symmetry breaking in the transverse field Ising model, recently probed using D-Wave machines. Specifically, we show that D-Wave data are reproduced by the SVL model.

arXiv:2109.09750•Physical Review Research•May 9, 2022•20 citations

Quantum Langevin Equations

Crispin W. Gardiner, P. Zoller

Springer series in synergetics•Jan 1, 2000•0 citations

Conditions for the validity of the quantum Langevin equation

J. Frenkel, John C. Taylor

From microscopic models, a Langevin equation can, in general, be derived only as an approximation. Two possible conditions to validate this approximation are studied. One is, for a linear Langevin equation, that the frequency of the Fourier transform should be close to the natural frequency of the system. The other is by the assumption of "slow" variables. We test this method by comparison with an exactly soluble model and point out its limitations. We base our discussion on two approaches. The first is a direct, elementary treatment of Senitzky. The second is via a generalized Langevin equation as an intermediate step.

arXiv:1109.4840•Physical Review E•Jan 19, 2012•3 citations

Quantum Langevin Equations

Crispin W. Gardiner

Springer series in synergetics•Jan 1, 1991•3 citations
The classical spin-vector Monte Carlo (SVMC) model is a reference benchmark for the performance of a quantum annealer. Yet, as a Monte Carlo method, SVMC is unsuited for an accurate description of the annealing dynamics in real-time. We introduce the spin-vector Langevin (SVL) model as an alternative benchmark in which the time evolution is described by Langevin dynamics. The SVL model is shown to provide a more stringent test than the SVMC model for the identification of quantum signatures in the performance of quantum annealing devices, as we illustrate by describing the Kibble-Zurek scaling associated with the dynamics of symmetry breaking in the transverse field Ising model, recently probed using D-Wave machines. Specifically, we show that D-Wave data are reproduced by the SVL model.
From microscopic models, a Langevin equation can, in general, be derived only as an approximation. Two possible conditions to validate this approximation are studied. One is, for a linear Langevin equation, that the frequency of the Fourier transform should be close to the natural frequency of the system. The other is by the assumption of "slow" variables. We test this method by comparison with an exactly soluble model and point out its limitations. We base our discussion on two approaches. The first is a direct, elementary treatment of Senitzky. The second is via a generalized Langevin equation as an intermediate step.