The Azimuth Project
Quantum techniques for stochastic mechanics (course) lecture 2 (Rev #4, changes)

Showing changes from revision #3 to #4: Added | Removed | Changed

Quantum Techniques for Stochastic Mechanics

  • Lecture 2 of 4

  • Link to course homepage

  • Quantum Techniques for Stochastic Mechanics, by Jacob Biamonte, QIC 890/891 Selected Advanced Topics in Quantum Information, The University of Waterloo, Waterloo Ontario, Canada, (Spring term 2012).

  • Given Aug 9th, 2012 in Waterloo Canada

Lecture Content

  • Review of lecture 1

  • Probabilities vs amplitudes (chapter 4)

  • Operators (creation and annihilation)

  • Amoeba field theory

  • Preamble to stochastic mechanics vs quantum mechanics

  • Note: the lecture content here is to be read along with the youtube video of the course. It should contain what was written on the board. Without the video, it might not make sense.

The master equation vs the rate equation

A stochastic petri net has

  • k k species
  • x i x_i is the concetration of the ith species

we want to know

ddtx i=??? \frac{d}{d t} x_i = ???

one for each 1ik 1\leq i \leq k.

  • The RHS: sum of terms, one term for each transition in the Petri net

For each transition we end up with a term like this

ddtx i=r(n im i)x 1 m 1x k m k \frac{d}{d t} x_i = r (n_i - m_i)x_1^{m_1}\cdots x_k^{m_k}
  • n i n_i is the number of times species x i x_i appears in the output
  • likewise for m i m_i but instead for input

We will use index free notation.

x=(x 1,,x k)[0,) x = (x_1,\ldots, x_k) \in [0, \infinity)

is the concentration vector and

  • input vector: m=(m 1,,m k)N k m = (m_1, \ldots, m_k) \in N^k

  • output vector: n=(n 1,,n k)N k n = (n_1, \ldots, n_k) \in N^k

  • notation: x m=x 1 m 1x k m k x^m = x_1^{m_1}\cdots x_k^{m_k}

then

ddt=r(nm)x m \frac{d}{d t} = r(n - m)x^m
  • T T is the set of transitions τT \tau \in T
  • r(τ) r(\tau) is the rate constant
ddtx= τTr(τ)[n(τ)m(τ)]x m(τ) \frac{d}{d t} x = \sum_{\tau \in T} r(\tau) [n(\tau) - m(\tau)]x^m(\tau)

Example

  • In birth, one rabbit comes in and two go out. This is a caricature of reality: these bunnies reproduce asexually, splitting in two like amoebas.

  • In predation, one wolf and one rabbit come in and two wolves go out. This is a caricature of how predators need to eat prey to reproduce.

  • In death, one wolf comes in and nothing goes out. Note that we are pretending rabbits don’t die unless they’re eaten by wolves.

  • R(t) R(t) rabbits

  • W(t) W(t) wolves

The rate equations of motion are

ddtR(t)=β(21)R(t)+γ(01)R(t)W(t) \frac{d}{d t} R(t) = \beta (2-1)R(t) + \gamma (0-1) R(t) W(t)
ddtW(t)=δ(01)W(t)+γ(21)R(t)W(t) \frac{d} {d t} W(t) = \delta (0-1) W(t) + \gamma (2-1) R(t) W(t)

The master equation

  • Let ψ n 1,,n k \psi_{n_1, \ldots, n_k} be the probability that we have n 1 n_1 of the first thing, n 2 n_2 of the second, etc.

  • The master equation says how these “things” change with time

  • It contains all possible “histories” of the possible interactions

Let n=(n 1,,n k)N k n = (n_1, \ldots, n_k) \in N^k and ψ n=ψ n 1,,ψ n k \psi_n = \psi_{n_1}, \ldots, \psi_{n_k} and then write a monomial

z n=z 1 n 1z k n k z^n = z^{n_1}_1\cdots z^{n_k}_k

and express any stochastic state as

Ψ= nN kψ nz n \Psi = \sum_{n\in N^k}\psi_n z^n

A state has

Ψ| z=1= nψ n=1 \Psi |_{z=1} = \sum_n\psi_n = 1
  • The simplest example is a monomial z 1 n 1z k n kz^{n_1}_1\cdots z^{n_k}_k where we are 100 percent sure that we have n 1 n_1 of the first species, etc. We call this a pure state.

The master equation provides a description of how Ψ \Psi changes with time.

ddtψ(t)=Hψ(t) \frac{d}{d t} \psi(t) = H \psi(t)
  • H H will be built from creation and annihilation operators

  • (annihilation) a iψ=ddz iψ a_i \psi = \frac{d}{d z_i} \psi

  • (creation) a i ψ=z iψ a_i^\dagger \psi = z_i \psi

  • r(τ) r(\tau) rate constant for transition τT \tau\in T

  • n(τ) n(\tau) output vector

  • m(τ) m(\tau) input vector

then

H= τTr(τ)[a n(τ)a m(τ)]a m(τ) H = \sum_{\tau\in T} r(\tau) [ a^{\dagger n(\tau)} - a^{\dagger m(\tau)}]a^{m(\tau)}

with

a m(τ)=a 1 m 1(τ)a k m k(τ) a^{m(\tau)} = a_1^{m_1(\tau)}\cdots a_k^{m_k(\tau)} a m(τ)=a 1 m 1(τ)a k m k(τ) a^{\dagger m(\tau)} = a_1^{\dagger m_1(\tau)}\cdots a_k^{\dagger m_k(\tau)}

How can we understand each term?

  • The first term a n(τ)a m(τ) a^{\dagger n(\tau)} a^{m(\tau)} describe how m i(τ) m_i(\tau) things of the ith species get annihilated and n i(τ)n_i(\tau) things of the ith get created

  • The second term a m(τ)a m(τ) a^{\dagger m(\tau)} a^{m(\tau)} says how the probability that nothing happens goes down as time passes.

Consider again

here

ψ= nψ nz n \psi = \sum_n \psi_n z^n

where

z n=z 1 n 1z 2 n 2 z^n = z_1^{n_1} z_2^{n_2}
  • n 1 n_1 rabbits
  • n 2 n_2 wolves

and so

ψ n=ψ n 1,n 2 \psi_n = \psi_{n_1, n_2}

is the probability of having n 1 n_1 rabbits and n 2 n_2 wolves. These probabilities evolve according to

ddtψ(t)=Hψ(t) \frac{d}{d t} \psi(t) = H \psi(t)
H=βB+γC+δD H = \beta B + \gamma C + \delta D
H= τTr(τ)[a n(τ)a m(τ)]a m(τ) H = \sum_{\tau\in T} r(\tau) [ a^{\dagger n(\tau)} - a^{\dagger m(\tau)}]a^{m(\tau)}

order the input and output vectors as (R,W) (R, W) then

  • m(τ 1)=(1,0) m(\tau_1) = (1,0)

  • m(τ 2)=(1,1) m(\tau_2) = (1,1)

  • m(τ 3)=(0,1) m(\tau_3) = (0,1)

  • n(τ 1)=(2,0) n(\tau_1) = (2,0)

  • n(τ 2)=(0,2) n(\tau_2) = (0,2)

  • n(τ 3)=(0,0) n(\tau_3) = (0,0)

B=r 1[a 1 a 1 a 1 ]a 1 B = r_1[ a_1^\dagger a_1^\dagger - a_1^\dagger] a_1
C=r 2[a 2 a 2 a 1 a 2 ]a 1a 2 C = r_2[ a_2^\dagger a_2^\dagger - a_1^\dagger a_2^\dagger]a_1a_2
D=r 3[1a 2 ]a 2 D = r_3[1-a_2^\dagger]a_2

Amoeba field theory

It shows a world with one state, amoeba with concentration A(t) A(t), and two transitions:

reproduction, where one amoeba turns into two. Let’s call the rate constant for this transition α\alpha.

competition, where two amoebas battle for resources and only one survives. Let’s call the rate constant for this transition β\beta.

Here

ddtA(t)=αAβA 2 \frac{d}{d t} A(t) = \alpha A - \beta A^2

which has solutions

equilibrium. The horizontal blue line corresponds to the case where the initial population P 0P_0 exactly equals the carrying capacity. In this case the population is constant.

dieoff. The three decaying curves above the horizontal blue line correspond to cases where initial population is higher than the carrying capacity. The population dies off over time and approaches the carrying capacity.

growth. The four increasing curves below the horizontal blue line represent cases where the initial population is lower than the carrying capacity. Now the population grows over time and approaches the carrying capacity.

References