Professional Documents
Culture Documents
Dynamical Maps and Memory Kernels: Dariusz Chru Ci Ski
Dynamical Maps and Memory Kernels: Dariusz Chru Ci Ski
Dariusz Chru±ci«ski
Nicolaus Copernicus University, Toru«, POLAND
Quantum evolution
Λt : S(H) −→ S(H)
ρt = Λt [ρ] ; t≥0
H = H∗
L[ρ] = −i[H, ρ]
d
Λt = LΛt ; Λ0 = 1l
dt
Markovian semigroup
d
Λt = LΛt ; Λ0 = 1l −→ Λt = etL ; t ≥ 0
dt
H ∗ = H ; Φ arbitrary CP
Dynamical maps and memory kernels 7 / 40
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
d
Λt = LΛt
dt
Dynamical maps and memory kernels 9 / 40
d
Λt = Lt Λt
dt
Λt −→ Lt = Λ̇t Λ−1
t
Dynamical maps and memory kernels 9 / 40
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
Ht , Gt hermitian ; Φt , Ψt hermiticity-preserving
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
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
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]
ρ11 λ(t)ρ12
Λt [ρ] =
λ(t)ρ21 ρ22
Z t
If γ(t) satises Γ(t) := γ(τ )dτ < ∞ for nite t
0
Λt is CP ⇐⇒ λ(t) ∈ [−1, 1]
ρ11 λ(t)ρ12
Λt [ρ] =
λ(t)ρ21 ρ22
Z t
If γ(t) satises Γ(t) := γ(τ )dτ < ∞ for nite t
0
Λt is CP ⇐⇒ λ(t) ∈ [−1, 1]
k(t) = 1 (t ≥ 0) (regular)
k(t) = 1 (t ≥ 0) (regular)
k(t) = 1 (t ≥ 0) (regular)
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
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
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
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
1
f (t) =
t+a
1
f (t) =
t+a
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
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
1
L[ρ] = −i[H, ρ] + B[ρ] − {B ∗ [I], ρ}
2
1
X = B ∗ [I] ≥ 0
2
L=B−Z
i
Z[ρ] = i(Cρ − ρC † ) ; C = H − X
2
Dynamical maps and memory kernels 25 / 40
1
L[ρ] = −i[H, ρ] + B[ρ] − {B ∗ [I], ρ}
2
1
X = B ∗ [I] ≥ 0
2
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
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
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 + . . .)
Kt = Bt − Zt
1
Q
es = B
es N
es ; N
es =
s+Z
es
Dynamical maps and memory kernels 29 / 40
Λ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
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
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
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
Properties 2
Reduced pair
Properties 3
Gauge transformations
Nt0 = Ft Nt ; Q0t = Ft Qt ,
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
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
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
References