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

Journal of Modern Optics

Simulations of Quantum Trajectories Using Markov Chains

W. L. Power

Published Apr 1, 1995• 2 citations
Publisher

Abstract

Stochastic simulations of quantum trajectories have been proposed as an alternative to density matrix calculations for some open quantum systems. In this paper it is shown that Monte Carlo wavefunction simulations of open atomic systems produce quantum trajectories in a discrete Markov process. This process can be simulated with a discrete Markov chain, and this is demonstrated for several example systems. Statistical properties for these atomic systems are produced more rapidly and with greater accuracy using this method than by calculating an ensemble of individual trajectories.

DOI
10.1080/713824408

Related papers

Markov Chains Approximations of jump-Diffusion Quantum Trajectories

Clément Pellegrini

"Quantum trajectories" are solutions of stochastic differential equations also called Belavkin or Stochastic Schrödinger Equations. They describe random phenomena in quantum measurement theory. Two types of such equations are usually considered, one is driven by a one-dimensional Brownian motion and the other is driven by a counting process. In this article, we present a way to obtain more advanced models which use jump-diffusion stochastic differential equations. Such models come from solutions of martingale problems for infinitesimal generators. These generators are obtained from the limit of generators of classical Markov chains which describe discrete models of quantum trajectories. Furthermore, stochastic models of jump-diffusion equations are physically justified by proving that their solutions can be obtained as the limit of the discrete trajectories.

arXiv:0803.2593•Mar 18, 2008•3 citations

Discrete Quantum Markov Chains

Ulrich Faigle, Alexander Schönhuth

A framework for finite-dimensional quantum Markov chains on Hilbert spaces is introduced. Quantum Markov chains generalize both classical Markov chains with possibly hidden states and existing models of quantum walks on finite graphs. Quantum Markov chains are based on Markov operations that may be applied to quantum systems and include quantum measurements, for example. It is proved that quantum Markov chains are asymptotically stationary and hence possess ergodic and entropic properties. With a quantum Markov chain one may associate a quantum Markov process, which is a stochastic process in the classical sense. Generalized Markov chains allow a representation with respect to a generalized Markov source model with definite (but possibly hidden) states relative to which observables give rise to classical stochastic processes. It is demonstrated that this model allows for observables to violate Bell’s inequality.

•Nov 4, 2010•3 citations

Quantum trajectories generalized

F. E. van Dorsselaer, Gerard Nienhuis

By definition, an ensemble of quantum trajectories reproduces the density matrix of an open system after ensemble averaging. We present a general class of stochastic Schrodinger equations for quantum trajectories which unifies and extends existing methods. Various quantum jump and state-diffusion methods are recognized as opposite limiting cases. The inherent freedom of choice can be used to significantly reduce the calculation time in specific cases. Examples of this are methods with adaptive noise, for which a specific observable becomes noise free to first order. Linear stochastic equations can also be constructed, which allow analytical solutions. As an illustration, the decoherence of Schrodinger cat states of a cavity mode is discussed.

Journal of Optics B Quantum and Semiclassical Optics•May 11, 2000•7 citations

Introduction to stochastic methods

Richard M. Martin, Lucia Reining, David M. Ceperley

… a general method, suitable for electronic computing machines, of calculating the properties of any substance which may be considered as composed of interacting individual molecules. N. Metropolis et al. , 1953 Summary Quantum Monte Carlo methods have been very useful in providing exact results, or, at least, exact constraints on properties of electronic systems, in particular for the homogeneous electron gas. The results are, in many cases, more accurate than those from other quantum many-body methods, and provide unique capabilities and insights. In this chapter we introduce the general properties of stochastic methods and motivate their use on the quantum many-body problem. In particular, we discuss Markov chains and the computation of error estimates. The methods that we introduce in the next four chapters are quite different from those in Parts II and III: stochastic or quantum Monte Carlo methods. In stochastic methods, instead of solving deterministically for properties of the quantum many-body system, one sets up a random walk that samples for the properties. Historically the most important role of QMC for the electronic structure field has been to provide input into the other methods, most notably the QMC calculation of the HEG [109], used for the exchange– correlation functional in DFT. A second important role has been as benchmarks for other methods such asGW. There are systems for which QMC is uniquely suited, for example the Wigner transition in the low-density electron gas, see Sec. 3.1. In this chapter we introduce general properties of simulations, in particular Markov chains, and error estimates. In the following chapters we will apply this theory to three general classes of quantum Monte Carlo algorithms, namely variational (Ch. 23), projector (Ch. 24), and path-integral Monte Carlo (Ch. 25); Ch. 18 already introduced the QMC calculation of the impurity Green's function used in the dynamical mean-field method.We note that there are a variety of other QMC methods not covered in this book. Simulations First let us define what we mean by a simulation, since the word has other meanings in applied science. The dimensionality of phase space (i.e., the Hilbert space for a quantum system) is large or infinite. Even a classical system requires the positions and momenta of all particles, and, hence, the phase space for N classical particles has dimensionality 6 N .

Cambridge University Press eBooks•May 31, 2016•1 citation

Semi-Markov processes in open quantum systems. II. Counting statistics with resetting

Fei Liu

A semi-Markov process method for obtaining general counting statistics for open quantum systems is extended to the scenario of resetting. The simultaneous presence of random resets and wave function collapses means that the quantum jump trajectories are no longer semi-Markov. However, focusing on trajectories and using simple probability formulas, general counting statistics can still be constructed from reset-free statistics. An exact tilted matrix equation is also obtained. The inputs of these methods are the survival distributions and waiting-time density distributions instead of quantum operators. In addition, a continuous-time cloning algorithm is introduced to simulate the large-deviation properties of open quantum systems. Several quantum optics systems are used to demonstrate these results.

arXiv:2308.02214•Physical review. E•Dec 1, 2023•2 citations

Stochastic Schrödinger Equations and Conditional States: A General Non-Markovian Quantum Electron Transport Simulator for THz Electronics

Devashish Pandey, Enrique Colomés, Guillermo Albareda +1 more

A prominent tool to study the dynamics of open quantum systems is the reduced density matrix. Yet, approaching open quantum systems by means of state vectors has well known computational advantages. In this respect, the physical meaning of the so-called conditional states in Markovian and non-Markovian scenarios has been a topic of recent debate in the construction of stochastic Schrödinger equations. We shed light on this discussion by acknowledging the Bohmian conditional wavefunction (linked to the corresponding Bohmian trajectory) as the proper mathematical object to represent, in terms of state vectors, an arbitrary subset of degrees of freedom. As an example of the practical utility of these states, we present a time-dependent quantum Monte Carlo algorithm to describe electron transport in open quantum systems under general (Markovian or non-Markovian) conditions. By making the most of trajectory-based and wavefunction methods, the resulting simulation technique extends to the quantum regime, the computational capabilities that the Monte Carlo solution of the Boltzmann transport equation offers for semi-classical electron devices.

arXiv:1910.13214•Entropy•Nov 25, 2019•8 citations
Stochastic simulations of quantum trajectories have been proposed as an alternative to density matrix calculations for some open quantum systems. In this paper it is shown that Monte Carlo wavefunction simulations of open atomic systems produce quantum trajectories in a discrete Markov process. This process can be simulated with a discrete Markov chain, and this is demonstrated for several example systems. Statistical properties for these atomic systems are produced more rapidly and with greater accuracy using this method than by calculating an ensemble of individual trajectories.
"Quantum trajectories" are solutions of stochastic differential equations also called Belavkin or Stochastic Schrödinger Equations. They describe random phenomena in quantum measurement theory. Two types of such equations are usually considered, one is driven by a one-dimensional Brownian motion and the other is driven by a counting process. In this article, we present a way to obtain more advanced models which use jump-diffusion stochastic differential equations. Such models come from solutions of martingale problems for infinitesimal generators. These generators are obtained from the limit of generators of classical Markov chains which describe discrete models of quantum trajectories. Furthermore, stochastic models of jump-diffusion equations are physically justified by proving that their solutions can be obtained as the limit of the discrete trajectories.
A framework for finite-dimensional quantum Markov chains on Hilbert spaces is introduced. Quantum Markov chains generalize both classical Markov chains with possibly hidden states and existing models of quantum walks on finite graphs. Quantum Markov chains are based on Markov operations that may be applied to quantum systems and include quantum measurements, for example. It is proved that quantum Markov chains are asymptotically stationary and hence possess ergodic and entropic properties. With a quantum Markov chain one may associate a quantum Markov process, which is a stochastic process in the classical sense. Generalized Markov chains allow a representation with respect to a generalized Markov source model with definite (but possibly hidden) states relative to which observables give rise to classical stochastic processes. It is demonstrated that this model allows for observables to violate Bell’s inequality.
By definition, an ensemble of quantum trajectories reproduces the density matrix of an open system after ensemble averaging. We present a general class of stochastic Schrodinger equations for quantum trajectories which unifies and extends existing methods. Various quantum jump and state-diffusion methods are recognized as opposite limiting cases. The inherent freedom of choice can be used to significantly reduce the calculation time in specific cases. Examples of this are methods with adaptive noise, for which a specific observable becomes noise free to first order. Linear stochastic equations can also be constructed, which allow analytical solutions. As an illustration, the decoherence of Schrodinger cat states of a cavity mode is discussed.
… a general method, suitable for electronic computing machines, of calculating the properties of any substance which may be considered as composed of interacting individual molecules. N. Metropolis et al. , 1953 Summary Quantum Monte Carlo methods have been very useful in providing exact results, or, at least, exact constraints on properties of electronic systems, in particular for the homogeneous electron gas. The results are, in many cases, more accurate than those from other quantum many-body methods, and provide unique capabilities and insights. In this chapter we introduce the general properties of stochastic methods and motivate their use on the quantum many-body problem. In particular, we discuss Markov chains and the computation of error estimates. The methods that we introduce in the next four chapters are quite different from those in Parts II and III: stochastic or quantum Monte Carlo methods. In stochastic methods, instead of solving deterministically for properties of the quantum many-body system, one sets up a random walk that samples for the properties. Historically the most important role of QMC for the electronic structure field has been to provide input into the other methods, most notably the QMC calculation of the HEG [109], used for the exchange– correlation functional in DFT. A second important role has been as benchmarks for other methods such asGW. There are systems for which QMC is uniquely suited, for example the Wigner transition in the low-density electron gas, see Sec. 3.1. In this chapter we introduce general properties of simulations, in particular Markov chains, and error estimates. In the following chapters we will apply this theory to three general classes of quantum Monte Carlo algorithms, namely variational (Ch. 23), projector (Ch. 24), and path-integral Monte Carlo (Ch. 25); Ch. 18 already introduced the QMC calculation of the impurity Green's function used in the dynamical mean-field method.We note that there are a variety of other QMC methods not covered in this book. Simulations First let us define what we mean by a simulation, since the word has other meanings in applied science. The dimensionality of phase space (i.e., the Hilbert space for a quantum system) is large or infinite. Even a classical system requires the positions and momenta of all particles, and, hence, the phase space for N classical particles has dimensionality 6 N .
A semi-Markov process method for obtaining general counting statistics for open quantum systems is extended to the scenario of resetting. The simultaneous presence of random resets and wave function collapses means that the quantum jump trajectories are no longer semi-Markov. However, focusing on trajectories and using simple probability formulas, general counting statistics can still be constructed from reset-free statistics. An exact tilted matrix equation is also obtained. The inputs of these methods are the survival distributions and waiting-time density distributions instead of quantum operators. In addition, a continuous-time cloning algorithm is introduced to simulate the large-deviation properties of open quantum systems. Several quantum optics systems are used to demonstrate these results.
A prominent tool to study the dynamics of open quantum systems is the reduced density matrix. Yet, approaching open quantum systems by means of state vectors has well known computational advantages. In this respect, the physical meaning of the so-called conditional states in Markovian and non-Markovian scenarios has been a topic of recent debate in the construction of stochastic Schrödinger equations. We shed light on this discussion by acknowledging the Bohmian conditional wavefunction (linked to the corresponding Bohmian trajectory) as the proper mathematical object to represent, in terms of state vectors, an arbitrary subset of degrees of freedom. As an example of the practical utility of these states, we present a time-dependent quantum Monte Carlo algorithm to describe electron transport in open quantum systems under general (Markovian or non-Markovian) conditions. By making the most of trajectory-based and wavefunction methods, the resulting simulation technique extends to the quantum regime, the computational capabilities that the Monte Carlo solution of the Boltzmann transport equation offers for semi-classical electron devices.