Download as pdf or txt
Download as pdf or txt
You are on page 1of 55

Dynamical maps and memory kernels 1 / 40

Dynamical maps and memory kernels

Dariusz Chru±ci«ski
Nicolaus Copernicus University, Toru«, POLAND

Mathematical Aspects of Quantum Information

NIMS, Daejeon, February 2016


Dynamical maps and memory kernels 2 / 40
Dynamical maps and memory kernels 3 / 40

Quantum evolution

dimH = n ; S(H)  space of quantum states (density matrices)

Λt : S(H) −→ S(H)

ρt = Λt [ρ] ; t≥0

Λt is completely positive and trace-preserving (CPTP)


Λ0 = 1l

(quantum) dynamical map


Dynamical maps and memory kernels 4 / 40

Physics likes equations of motions

We look for the linear equation for Λt


Dynamical maps and memory kernels 5 / 40

Basic example  unitary evolution

H = H∗

L[ρ] = −i[H, ρ]

d
Λt = LΛt ; Λ0 = 1l
dt

Λt [ρ] = Ut ρUt∗ ; Ut = e−iHt ; t ∈ R


Dynamical maps and memory kernels 6 / 40

Markovian semigroup

d
Λt = LΛt ; Λ0 = 1l −→ Λt = etL ; t ≥ 0
dt

What is the most general L ?

Theorem (GKSL (1976))


Λt = etL is CPTP i
 
1 ∗
L[ρ] = −i[H, ρ] + Φ[ρ] − {Φ [I], ρ}
2

H ∗ = H ; Φ  arbitrary CP
Dynamical maps and memory kernels 7 / 40

Quantum Open Systems

S + E −→ HS ⊗ HE

Ut = e−iHt

t = 0 → ρ⊗ω
h i
ρt := Λt [ρ] = TrE Ut ρ ⊗ ωUt†
Dynamical maps and memory kernels 8 / 40

Nakajima-Zwanzig equation

h i
ρt := Λt [ρ] = TrE Ut ρ ⊗ ωUt†

Z t
d
Λt = Kt−τ Λτ dτ
dt 0

One obtains a Markovian semigroup etL only in the very special


regime K(t) −→ δ(t)L

d
Λt = LΛt
dt
Dynamical maps and memory kernels 9 / 40

Local vs. non-local

non-local master equation (Nakajima-Zwanzig equation)


Z t
d
Λt = Kt−τ Λτ dτ
dt 0

local in time master equation

d
Λt = Lt Λt
dt

Λt −→ Lt = Λ̇t Λ−1
t
Dynamical maps and memory kernels 9 / 40

Local vs. non-local

non-local master equation (Nakajima-Zwanzig equation)


Z t
d
Λt = Kt−τ Λτ dτ
dt 0

local in time master equation

d
Λt = Lt Λt
dt

Λt −→ Lt = Λ̇t Λ−1
t
Dynamical maps and memory kernels 10 / 40

local generator
 
1
Lt [ρ] = −i[Ht , ρ] + Φt [ρ] − {Φ∗t [I], ρ}
2

non-local (memory kernel) generator


 
1
Kt [ρ] = −i[Gt , ρ] + Ψt [ρ] − {Ψ∗t [I], ρ}
2

Ht , Gt  hermitian ; Φt , Ψt  hermiticity-preserving

These structures guarantee that Λt is hermiticity- and trace-preserving

What about complete positivity?


Dynamical maps and memory kernels 11 / 40

What is known:

 
1
Lt [ρ] = −i[Ht , ρ] + Φt [ρ] − {Φ∗t [I], ρ}
2
Z t 
Λt = T exp Lτ dτ
0

Φt CP =⇒ Λt CPTP
Dynamical maps and memory kernels 12 / 40

What is known:

 
1 ∗
Kt [ρ] = −i[Gt , ρ] + Ψt [ρ] − {Ψt [I], ρ}
2

NO general results were known!

only so-called semi-Markov classical evolution was characterized

I provide sucient conditions during this talk


Dynamical maps and memory kernels 13 / 40

Example: qubit dephasing

1
Lt [ρ] = γ(t)[σ3 ρσ3 − ρ]
2
 
ρ11 λ(t)ρ12
Λt [ρ] =
λ(t)ρ21 ρ22

CP ⇐⇒ |λ(t)| ≤ 1

 Z t 
λ̇(t) = −γ(t)λ(t) ; λ(0) = 1 −→ λ(t) = exp − γ(τ )dτ
0
Dynamical maps and memory kernels 14 / 40

Example: qubit dephasing

1
Kt [ρ] = k(t)[σ3 ρσ3 − ρ]
2

Z t
λ̇(t) = − k(t − τ )λ(τ )dτ ; λ(0) = 1 −→ λ(t) =???
0
Dynamical maps and memory kernels 15 / 40

Z ∞
Laplace: λ(t) → λ(s)
e = e−st λ(t)dt
0
Z t
λ̇(t) = − k(t − τ )λ(τ )dτ ; λ(0) = 1
0

e − 1 = −e 1
sλ(s) k(s)λ(s)
e −→ λ(s)
e =
s+e
k(s)

λ(s)
e −→ λ(t)

CP ⇐⇒ λ(t) ∈ [−1, 1]

NO simple condition for k(t)


Dynamical maps and memory kernels 16 / 40

 
ρ11 λ(t)ρ12
Λt [ρ] =
λ(t)ρ21 ρ22
Z t
If γ(t) satises Γ(t) := γ(τ )dτ < ∞ for nite t
0

time-local −→ λ(t) = e−Γ(t) ≥ 0

Λt is CP ⇐⇒ λ(t) ∈ [−1, 1]

λ(t) 0 =⇒ γ(t) is singular


Dynamical maps and memory kernels 16 / 40

 
ρ11 λ(t)ρ12
Λt [ρ] =
λ(t)ρ21 ρ22
Z t
If γ(t) satises Γ(t) := γ(τ )dτ < ∞ for nite t
0

time-local −→ λ(t) = e−Γ(t) ≥ 0

Λt is CP ⇐⇒ λ(t) ∈ [−1, 1]

λ(t) 0 =⇒ γ(t) is singular


Dynamical maps and memory kernels 17 / 40

Example: let λ(t) = cos t; (non-Markovian evolution  next talk)


 
ρ11 ρ12 cos t
Λt [ρ] =
ρ21 cos t ρ22

γ(t) = tan t (singular)

k(t) = 1 (t ≥ 0) (regular)

non-trivial & singular Lt ←→ simple & regular Kt


Dynamical maps and memory kernels 17 / 40

Example: let λ(t) = cos t; (non-Markovian evolution  next talk)


 
ρ11 ρ12 cos t
Λt [ρ] =
ρ21 cos t ρ22

γ(t) = tan t (singular)

k(t) = 1 (t ≥ 0) (regular)

non-trivial & singular Lt ←→ simple & regular Kt


Dynamical maps and memory kernels 17 / 40

Example: let λ(t) = cos t; (non-Markovian evolution  next talk)


 
ρ11 ρ12 cos t
Λt [ρ] =
ρ21 cos t ρ22

γ(t) = tan t (singular)

k(t) = 1 (t ≥ 0) (regular)

non-trivial & singular Lt ←→ simple & regular Kt


Dynamical maps and memory kernels 18 / 40
Dynamical maps and memory kernels 19 / 40

Laplace transform domain

Z t
d
Λt = Kt−τ Λτ dτ
dt 0

e s − 1l = K
sΛ esΛ
es

1
Λ
es = −→ Λt =???
s−K
es
1
semigroup −→ Λ
es = −→ Λt = etL
s−L

Λt CP
what about Λ
es ?
Dynamical maps and memory kernels 19 / 40

Laplace transform domain

Z t
d
Λt = Kt−τ Λτ dτ
dt 0

e s − 1l = K
sΛ esΛ
es

1
Λ
es = −→ Λt =???
s−K
es
1
semigroup −→ Λ
es = −→ Λt = etL
s−L

Λt CP
what about Λ
es ?
Dynamical maps and memory kernels 20 / 40

Completely monotone functions

A function f : [0, ∞) → R is completely monotone (CM) if

dn
(−1)n f (s) ≥ 0, n = 0, 1, 2, . . .
dsn

Theorem (Bernstein)
A function f : [0, ∞) → R is CM i it is a Laplace transform of a
positive function g(t) ≥ 0
Z∞
f (s) = e−st g(t)dt
0
Dynamical maps and memory kernels 20 / 40

Completely monotone functions

A function f : [0, ∞) → R is completely monotone (CM) if

dn
(−1)n f (s) ≥ 0, n = 0, 1, 2, . . .
dsn

Theorem (Bernstein)
A function f : [0, ∞) → R is CM i it is a Laplace transform of a
positive function g(t) ≥ 0
Z∞
f (s) = e−st g(t)dt
0
Dynamical maps and memory kernels 21 / 40

Completely monotone functions  examples

1
f (t) =
t+a

f (t) = e−at ; a > 0

If f and g are CM, then f · g  CM


Dynamical maps and memory kernels 21 / 40

Completely monotone functions  examples

1
f (t) =
t+a

f (t) = e−at ; a > 0

If f and g are CM, then f · g  CM


Dynamical maps and memory kernels 22 / 40

Quantum Bernstein theorem

Z t
d
Λt = Kt−τ Λτ dτ
dt 0

Λt  CP

e s − 1l = K
sΛ esΛ
es

dn e
(−1)n Λs  CP n = 0, 1, 2, . . . CM-CP
dsn
Dynamical maps and memory kernels 22 / 40

Quantum Bernstein theorem

Z t
d
Λt = Kt−τ Λτ dτ
dt 0

Λt  CP

e s − 1l = K
sΛ esΛ
es

dn e
(−1)n Λs  CP n = 0, 1, 2, . . . CM-CP
dsn
Dynamical maps and memory kernels 23 / 40

How to construct a legitimate Kt ?


Dynamical maps and memory kernels 24 / 40
Dynamical maps and memory kernels 25 / 40

Markovian semigroup  quantum jumps representation

 
1
L[ρ] = −i[H, ρ] + B[ρ] − {B ∗ [I], ρ}
2
1
X = B ∗ [I] ≥ 0
2

L[ρ] = B[ρ] − [i(Hρ − ρH) + (Xρ + ρX)]

L=B−Z

i
Z[ρ] = i(Cρ − ρC † ) ; C = H − X
2
Dynamical maps and memory kernels 25 / 40

Markovian semigroup  quantum jumps representation

 
1
L[ρ] = −i[H, ρ] + B[ρ] − {B ∗ [I], ρ}
2
1
X = B ∗ [I] ≥ 0
2

L[ρ] = B[ρ] − [i(Hρ − ρH) + (Xρ + ρX)]

L=B−Z

i
Z[ρ] = i(Cρ − ρC † ) ; C = H − X
2
Dynamical maps and memory kernels 26 / 40

L=B−Z

Λ̇t = LΛt ; Λ0 = 1l

†t
Ṅt = −ZNt ; N0 = 1l −→ Nt [ρ] = e−iCt ρeiC

1 1
N
es = ; Λ
es =
s+Z s−B+Z

Λ
es = N
es + N
es B Λ
es

1
Λ
es = N
es (1l + Q
es + Q
es Q
e s + . . .) = N
es
1−Q
es

Qt := BNt
Dynamical maps and memory kernels 26 / 40

L=B−Z

Λ̇t = LΛt ; Λ0 = 1l

†t
Ṅt = −ZNt ; N0 = 1l −→ Nt [ρ] = e−iCt ρeiC

1 1
N
es = ; Λ
es =
s+Z s−B+Z

Λ
es = N
es + N
es B Λ
es

1
Λ
es = N
es (1l + Q
es + Q
es Q
e s + . . .) = N
es
1−Q
es

Qt := BNt
Dynamical maps and memory kernels 27 / 40

Λ
es = N
es (1l + Q
es + Q
es Q
e s + . . .)

Λt = Nt + Nt ∗ (Qt + Qt ∗ Qt + Qt ∗ Qt ∗ Qt + . . .)

Nt , Qt = BNt CP

quantum jump representation

Z t
Λt = Nt + dt1 Nt−t1 BNt1 + . . .
0
= Nt + Nt ∗ BNt + Nt ∗ BNt ∗ BNt + . . .
Dynamical maps and memory kernels 28 / 40

L −→ Kt

†t
L = B−Z → Ṅt = −ZNt ; N0 = 1l −→ Nt [ρ] = e−iCt ρeiC

Λt = Nt + Nt ∗ (Qt + Qt ∗ Qt + Qt ∗ Qt ∗ Qt + . . .) ; Qt := BNt

Z t
Kt = Bt −Zt → Ṅt = − Zt−τ Nτ dτ ; N0 = 1l −→ Nt  CP
0

Λt = Nt +Nt ∗(Qt +Qt ∗Qt +Qt ∗Qt ∗Qt +. . .) ; Qt := Bt ∗Nt  CP


Dynamical maps and memory kernels 28 / 40

L −→ Kt

†t
L = B−Z → Ṅt = −ZNt ; N0 = 1l −→ Nt [ρ] = e−iCt ρeiC

Λt = Nt + Nt ∗ (Qt + Qt ∗ Qt + Qt ∗ Qt ∗ Qt + . . .) ; Qt := BNt

Z t
Kt = Bt −Zt → Ṅt = − Zt−τ Nτ dτ ; N0 = 1l −→ Nt  CP
0

Λt = Nt +Nt ∗(Qt +Qt ∗Qt +Qt ∗Qt ∗Qt +. . .) ; Qt := Bt ∗Nt  CP


Dynamical maps and memory kernels 29 / 40

We call {Nt , Qt } a legitimate pair i


Nt , Qt are CP, and N0 = 1l
Tr[(Qt + Ṅt )ρ] = 0,
||Q
e s || ≤ 1

Λt = Nt + Nt ∗ (Qt + Qt ∗ Qt + Qt ∗ Qt ∗ Qt + . . .)

Kt = Bt − Zt

1
Q
es = B
es N
es ; N
es =
s+Z
es
Dynamical maps and memory kernels 29 / 40

We call {Nt , Qt } a legitimate pair i


Nt , Qt are CP, and N0 = 1l
Tr[(Qt + Ṅt )ρ] = 0,
||Q
e s || ≤ 1

Λt = Nt + Nt ∗ (Qt + Qt ∗ Qt + Qt ∗ Qt ∗ Qt + . . .)

K t = Bt − Zt

1
Q
es = B
es N
es ; N
es =
s+Z
es
Dynamical maps and memory kernels 30 / 40

Example:

 Z t 
Nt = 1 − f (τ )dτ 1l
0
Z ∞
f (t) ≥ 0 ; f (τ )dτ ≤ 1
0

Qt = f (t)B ; B CPTP =⇒ ||Q


e s ||1 = |fe(s)| ≤ 1

Kt = k(t)(B − 1l)

sfe(s)
k(s) =
e
1 − f (s)

γ
f (t) = γe−γt −→ fe(s) = −→ e
k(s) = γ −→ k(t) = γδ(t)
s+γ
Dynamical maps and memory kernels 30 / 40

Example:

 Z t 
Nt = 1 − f (τ )dτ 1l
0
Z ∞
f (t) ≥ 0 ; f (τ )dτ ≤ 1
0

Qt = f (t)B ; B CPTP =⇒ ||Q


e s ||1 = |fe(s)| ≤ 1

Kt = k(t)(B − 1l)

sfe(s)
k(s) =
e
1 − f (s)

γ
f (t) = γe−γt −→ fe(s) = −→ e
k(s) = γ −→ k(t) = γδ(t)
s+γ
Dynamical maps and memory kernels 30 / 40

Example:

 Z t 
Nt = 1 − f (τ )dτ 1l
0
Z ∞
f (t) ≥ 0 ; f (τ )dτ ≤ 1
0

Qt = f (t)B ; B CPTP =⇒ ||Q


e s ||1 = |fe(s)| ≤ 1

Kt = k(t)(B − 1l)

sfe(s)
k(s) =
e
1 − f (s)

γ
f (t) = γe−γt −→ fe(s) = −→ e
k(s) = γ −→ k(t) = γδ(t)
s+γ
Dynamical maps and memory kernels 31 / 40

Qubit dephasing

Kt = k(t)(B − 1l)

B[ρ] = σ3 ρσ3

sfe(s)
k(s) =
e
1 − f (s)
Z ∞
f (t) ≥ 0 ; f (τ )dτ ≤ 1
0
Dynamical maps and memory kernels 32 / 40

Kt = k(t)(B − 1l)

B2 = B CPTP projector

 Z t  Z t
Λt = 1− f (τ )dτ 1l + f (τ )dτ B
0 0
Z t
0≤ f (τ )dτ ≤ 1
0
but f (t) needs not be positive!
Dynamical maps and memory kernels 33 / 40

Properties  1

Convexity

(k) (k)
If {Nt , Qt } are legitimate pairs then a convex combination
(k) (k)
X X
Nt = pk Nt ; Qt = p k Qt
k k

provide a legitimate pair.


Dynamical maps and memory kernels 34 / 40

Properties  2

Reduced pair

Suppose that {Nt , Qt } denes a legitimate pair for the evolution in


H ⊗ HE . Then for arbitrary state ω in HE

Nt [ρ] = TrE (Nt [ρ ⊗ ω]), Qt [ρ] = TrE (Qt [ρ ⊗ ω]),

provide a legitimate pair for the reduced evolution in H.


Dynamical maps and memory kernels 35 / 40

Properties  3

Gauge transformations

If {Nt , Qt } is a legitimate pair and Ft is a dynamical map, then

Nt0 = Ft Nt ; Q0t = Ft Qt ,

provide a legitimate pair as well.


Dynamical maps and memory kernels 36 / 40

Properties  4

CP shift

If
R t{Nt , Qt } is a legitimate pair and Gt is a linear map such that
0 Gτ dτ is CP, then
Z t
Nt0 = Nt + Gτ dτ ; Q0t = Qt − Gt ,
0

dene a legitimate pair provided Q0t is CP.


Z t
Nt + Qτ dτ CPTP
0
Dynamical maps and memory kernels 36 / 40

Properties  4

CP shift

If
R t{Nt , Qt } is a legitimate pair and Gt is a linear map such that
0 Gτ dτ is CP, then
Z t
Nt0 = Nt + Gτ dτ ; Q0t = Qt − Gt ,
0

dene a legitimate pair provided Q0t is CP.


Z t
Nt + Qτ dτ CPTP
0
Dynamical maps and memory kernels 37 / 40

New equation  collision models

Z t
d
Λt = Kt−τ Λτ dτ
dt 0

{Nt , Qt }

Z t
d d
Λt = Kt−τ Λτ dτ + Nt
dt 0 dt

e s = sN
K es Q es−1
es N
Dynamical maps and memory kernels 38 / 40

Summary

I provided a relation between time-local and non-local


approaches
I provided a construction for a family of legitimate kernels in
terms of legitimate pairs
all known examples t this class
this class denes a natural generalization of classical
semi-Markov evolution
the necessary condition is still missing
see the next talk for INTERESTING results on non-Markovian
quantum evolution!
Dynamical maps and memory kernels 39 / 40

References

D.C. and A. Kossakowski, PRL, 104, 070406 (2010)


D.C. and A. Kossakowski, EPL, 97, 20005 (2012)
D.C. and A. Kossakowski, PRL, 111, 050402 (2013)
D.C. and S. Maniscalco, PRL, 112, 120404 (2014)
D.C. and A. Kossakowski, arXiv:1602.01642
J. Bae and D.C, arXiv:1601.05522
Dynamical maps and memory kernels 40 / 40

You might also like