-
Notifications
You must be signed in to change notification settings - Fork 34
/
operators.jl
362 lines (283 loc) · 15.1 KB
/
operators.jl
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
import Base: ==, +, -, *, /, ^, length, one, exp, conj, conj!, transpose
import LinearAlgebra: tr, ishermitian
import SparseArrays: sparse
"""
Abstract base class for all operators.
All deriving operator classes have to define the fields
`basis_l` and `basis_r` defining the left and right side bases.
For fast time evolution also at least the function
`mul!(result::Ket,op::AbstractOperator,x::Ket,alpha,beta)` should be
implemented. Many other generic multiplication functions can be defined in
terms of this function and are provided automatically.
"""
abstract type AbstractOperator{BL<:Basis,BR<:Basis} end
"""
Abstract type for operators with a data field.
This is an abstract type for operators that have a direct matrix representation
stored in their `.data` field.
"""
abstract type DataOperator{BL<:Basis,BR<:Basis} <: AbstractOperator{BL,BR} end
# Common error messages
arithmetic_unary_error(funcname, x::AbstractOperator) = throw(ArgumentError("$funcname is not defined for this type of operator: $(typeof(x)).\nTry to convert to another operator type first with e.g. dense() or sparse()."))
arithmetic_binary_error(funcname, a::AbstractOperator, b::AbstractOperator) = throw(ArgumentError("$funcname is not defined for this combination of types of operators: $(typeof(a)), $(typeof(b)).\nTry to convert to a common operator type first with e.g. dense() or sparse()."))
addnumbererror() = throw(ArgumentError("Can't add or subtract a number and an operator. You probably want 'op + identityoperator(op)*x'."))
length(a::AbstractOperator) = length(a.basis_l)::Int*length(a.basis_r)::Int
basis(a::AbstractOperator) = (check_samebases(a); a.basis_l)
# Ensure scalar broadcasting
Base.broadcastable(x::AbstractOperator) = Ref(x)
# Arithmetic operations
+(a::AbstractOperator, b::AbstractOperator) = arithmetic_binary_error("Addition", a, b)
+(a::Number, b::AbstractOperator) = addnumbererror()
+(a::AbstractOperator, b::Number) = addnumbererror()
-(a::AbstractOperator) = arithmetic_unary_error("Negation", a)
-(a::AbstractOperator, b::AbstractOperator) = arithmetic_binary_error("Subtraction", a, b)
-(a::Number, b::AbstractOperator) = addnumbererror()
-(a::AbstractOperator, b::Number) = addnumbererror()
*(a::AbstractOperator, b::AbstractOperator) = arithmetic_binary_error("Multiplication", a, b)
^(a::AbstractOperator, b::Int) = Base.power_by_squaring(a, b)
dagger(a::AbstractOperator) = arithmetic_unary_error("Hermitian conjugate", a)
Base.adjoint(a::AbstractOperator) = dagger(a)
conj(a::AbstractOperator) = arithmetic_unary_error("Complex conjugate", a)
conj!(a::AbstractOperator) = conj(a::AbstractOperator)
# dense(a::AbstractOperator) = arithmetic_unary_error("Conversion to dense", a)
transpose(a::AbstractOperator) = arithmetic_unary_error("Transpose", a)
"""
ishermitian(op::AbstractOperator)
Check if an operator is Hermitian.
"""
ishermitian(op::AbstractOperator) = arithmetic_unary_error(ishermitian, op)
"""
tensor(x::AbstractOperator, y::AbstractOperator, z::AbstractOperator...)
Tensor product ``\\hat{x}⊗\\hat{y}⊗\\hat{z}⊗…`` of the given operators.
"""
tensor(a::AbstractOperator, b::AbstractOperator) = arithmetic_binary_error("Tensor product", a, b)
tensor(op::AbstractOperator) = op
tensor(operators::AbstractOperator...) = reduce(tensor, operators)
"""
embed(basis1[, basis2], indices::Vector, operators::Vector)
Tensor product of operators where missing indices are filled up with identity operators.
"""
function embed(basis_l::CompositeBasis, basis_r::CompositeBasis,
indices::Vector, operators::Vector{T}) where T<:AbstractOperator
@assert check_embed_indices(indices)
N = length(basis_l.bases)
@assert length(basis_r.bases) == N
@assert length(indices) == length(operators)
# Embed all single-subspace operators.
idxop_sb = [x for x in zip(indices, operators) if typeof(x[1]) <: Int]
indices_sb = [x[1] for x in idxop_sb]
ops_sb = [x[2] for x in idxop_sb]
for (idxsb, opsb) in zip(indices_sb, ops_sb)
(opsb.basis_l == basis_l.bases[idxsb]) || throw(IncompatibleBases())
(opsb.basis_r == basis_r.bases[idxsb]) || throw(IncompatibleBases())
end
embed_op = tensor([i ∈ indices_sb ? ops_sb[indexin(i, indices_sb)[1]] : identityoperator(T, basis_l.bases[i], basis_r.bases[i]) for i=1:N]...)
# Embed all joint-subspace operators.
idxop_comp = [x for x in zip(indices, operators) if typeof(x[1]) <: Array]
for (idxs, op) in idxop_comp
embed_op *= embed(basis_l, basis_r, idxs, op)
end
return embed_op
end
"""
embed(basis1[, basis2], indices::Vector, operators::Vector)
Embed operator acting on a joint Hilbert space where missing indices are filled up with identity operators.
"""
function embed(basis_l::CompositeBasis, basis_r::CompositeBasis,
indices::Vector{Int}, op::T) where T<:AbstractOperator
N = length(basis_l.bases)
@assert length(basis_r.bases) == N
reduce(tensor, basis_l.bases[indices]) == op.basis_l || throw(IncompatibleBases())
reduce(tensor, basis_r.bases[indices]) == op.basis_r || throw(IncompatibleBases())
index_order = [idx for idx in 1:length(basis_l.bases) if idx ∉ indices]
all_operators = AbstractOperator[identityoperator(T, basis_l.bases[i], basis_r.bases[i]) for i in index_order]
for idx in indices
pushfirst!(index_order, idx)
end
push!(all_operators, op)
check_indices(N, indices)
# Create the operator.
permuted_op = tensor(all_operators...)
# Create a copy to fill with correctly-ordered objects (basis and data).
unpermuted_op = copy(permuted_op)
# Create the correctly ordered basis.
unpermuted_op.basis_l = basis_l
unpermuted_op.basis_r = basis_r
# Reorient the matrix to act in the correctly ordered basis.
# Get the dimensions necessary for index permuting.
dims_l = [b.shape[1] for b in basis_l.bases]
dims_r = [b.shape[1] for b in basis_r.bases]
# Get the order of indices to use in the first reshape. Julia indices go in
# reverse order.
expand_order = index_order[end:-1:1]
# Get the dimensions associated with those indices.
expand_dims_l = dims_l[expand_order]
expand_dims_r = dims_r[expand_order]
# Prepare the permutation to the correctly ordered basis.
perm_order_l = [indexin(idx, expand_order)[1] for idx in 1:length(dims_l)]
perm_order_r = [indexin(idx, expand_order)[1] for idx in 1:length(dims_r)]
# Perform the index expansion, the permutation, and the index collapse.
M = (reshape(permuted_op.data, tuple([expand_dims_l; expand_dims_r]...)) |>
x -> permutedims(x, [perm_order_l; perm_order_r .+ length(dims_l)]) |>
x -> sparse(reshape(x, (prod(dims_l), prod(dims_r)))))
unpermuted_op.data = M
return unpermuted_op
end
embed(basis_l::CompositeBasis, basis_r::CompositeBasis, index::Int, op::AbstractOperator) = embed(basis_l, basis_r, Int[index], [op])
embed(basis::CompositeBasis, index::Int, op::AbstractOperator) = embed(basis, basis, Int[index], [op])
embed(basis::CompositeBasis, indices::Vector, operators::Vector{T}) where {T<:AbstractOperator} = embed(basis, basis, indices, operators)
embed(basis::CompositeBasis, indices::Vector{Int}, op::AbstractOperator) = embed(basis, basis, indices, op)
"""
embed(basis1[, basis2], operators::Dict)
`operators` is a dictionary `Dict{Vector{Int}, AbstractOperator}`. The integer vector
specifies in which subsystems the corresponding operator is defined.
"""
function embed(basis_l::CompositeBasis, basis_r::CompositeBasis,
operators::Dict{Vector{Int}, T}) where T<:AbstractOperator
@assert length(basis_l.bases) == length(basis_r.bases)
N = length(basis_l.bases)
if length(operators) == 0
return identityoperator(T, basis_l, basis_r)
end
indices, operator_list = zip(operators...)
operator_list = [operator_list...;]
indices_flat = [indices...;]
start_indices_flat = [i[1] for i in indices]
complement_indices_flat = Int[i for i=1:N if i ∉ indices_flat]
operators_flat = T[]
if all([minimum(I):maximum(I);]==I for I in indices)
for i in 1:N
if i in complement_indices_flat
push!(operators_flat, identityoperator(T, basis_l.bases[i], basis_r.bases[i]))
elseif i in start_indices_flat
push!(operators_flat, operator_list[indexin(i, start_indices_flat)[1]])
end
end
return tensor(operators_flat...)
else
complement_operators = [identityoperator(T, basis_l.bases[i], basis_r.bases[i]) for i in complement_indices_flat]
op = tensor([operator_list; complement_operators]...)
perm = sortperm([indices_flat; complement_indices_flat])
return permutesystems(op, perm)
end
end
embed(basis_l::CompositeBasis, basis_r::CompositeBasis, operators::Dict{Int, T}; kwargs...) where {T<:AbstractOperator} = embed(basis_l, basis_r, Dict([i]=>op_i for (i, op_i) in operators); kwargs...)
embed(basis::CompositeBasis, operators::Dict{Int, T}; kwargs...) where {T<:AbstractOperator} = embed(basis, basis, operators; kwargs...)
embed(basis::CompositeBasis, operators::Dict{Vector{Int}, T}; kwargs...) where {T<:AbstractOperator} = embed(basis, basis, operators; kwargs...)
"""
tr(x::AbstractOperator)
Trace of the given operator.
"""
tr(x::AbstractOperator) = arithmetic_unary_error("Trace", x)
ptrace(a::AbstractOperator, index::Vector{Int}) = arithmetic_unary_error("Partial trace", a)
"""
normalize(op)
Return the normalized operator so that its `tr(op)` is one.
"""
normalize(op::AbstractOperator) = op/tr(op)
"""
normalize!(op)
In-place normalization of the given operator so that its `tr(x)` is one.
"""
normalize!(op::AbstractOperator) = throw(ArgumentError("normalize! is not defined for this type of operator: $(typeof(op)).\n You may have to fall back to the non-inplace version 'normalize()'."))
"""
expect(op, state)
Expectation value of the given operator `op` for the specified `state`.
`state` can either be a (density) operator or a ket.
"""
expect(op::AbstractOperator{B,B}, state::Ket{B}) where B<:Basis = state.data' * (op * state).data
expect(op::AbstractOperator{B1,B2}, state::AbstractOperator{B2,B2}) where {B1<:Basis,B2<:Basis} = tr(op*state)
"""
expect(index, op, state)
If an `index` is given, it assumes that `op` is defined in the subsystem specified by this number.
"""
function expect(indices::Vector{Int}, op::AbstractOperator{B1,B2}, state::AbstractOperator{B3,B3}) where {B1<:Basis,B2<:Basis,B3<:CompositeBasis}
N = length(state.basis_l.shape)
indices_ = complement(N, indices)
expect(op, ptrace(state, indices_))
end
function expect(indices::Vector{Int}, op::AbstractOperator{B,B}, state::Ket{B2}) where {B<:Basis,B2<:CompositeBasis}
N = length(state.basis.shape)
indices_ = complement(N, indices)
expect(op, ptrace(state, indices_))
end
expect(index::Int, op::AbstractOperator, state) = expect([index], op, state)
expect(op::AbstractOperator, states::Vector) = [expect(op, state) for state=states]
expect(indices::Vector{Int}, op::AbstractOperator, states::Vector) = [expect(indices, op, state) for state=states]
"""
variance(op, state)
Variance of the given operator `op` for the specified `state`.
`state` can either be a (density) operator or a ket.
"""
function variance(op::AbstractOperator{B,B}, state::Ket{B}) where B<:Basis
x = op*state
state.data'*(op*x).data - (state.data'*x.data)^2
end
function variance(op::AbstractOperator{B,B}, state::AbstractOperator{B,B}) where B<:Basis
expect(op*op, state) - expect(op, state)^2
end
"""
variance(index, op, state)
If an `index` is given, it assumes that `op` is defined in the subsystem specified by this number
"""
function variance(indices::Vector{Int}, op::AbstractOperator{B,B}, state::AbstractOperator{BC,BC}) where {B<:Basis,BC<:CompositeBasis}
N = length(state.basis_l.shape)
indices_ = complement(N, indices)
variance(op, ptrace(state, indices_))
end
function variance(indices::Vector{Int}, op::AbstractOperator{B,B}, state::Ket{BC}) where {B<:Basis,BC<:CompositeBasis}
N = length(state.basis.shape)
indices_ = complement(N, indices)
variance(op, ptrace(state, indices_))
end
variance(index::Int, op::AbstractOperator, state) = variance([index], op, state)
variance(op::AbstractOperator, states::Vector) = [variance(op, state) for state=states]
variance(indices::Vector{Int}, op::AbstractOperator, states::Vector) = [variance(indices, op, state) for state=states]
"""
exp(op::AbstractOperator)
Operator exponential.
"""
exp(op::AbstractOperator) = throw(ArgumentError("exp() is not defined for this type of operator: $(typeof(op)).\nTry to convert to dense operator first with dense()."))
permutesystems(a::AbstractOperator, perm::Vector{Int}) = arithmetic_unary_error("Permutations of subsystems", a)
"""
identityoperator(a::Basis[, b::Basis])
Return an identityoperator in the given bases.
"""
identityoperator(::Type{T}, b1::Basis, b2::Basis) where {T<:AbstractOperator} = throw(ArgumentError("Identity operator not defined for operator type $T."))
identityoperator(::Type{T}, b::Basis) where {T<:AbstractOperator} = identityoperator(T, b, b)
identityoperator(op::T) where {T<:AbstractOperator} = identityoperator(T, op.basis_l, op.basis_r)
one(b::Basis) = identityoperator(b)
one(op::AbstractOperator) = identityoperator(op)
# Helper functions to check validity of arguments
function check_ptrace_arguments(a::AbstractOperator, indices::Vector{Int})
if !isa(a.basis_l, CompositeBasis) || !isa(a.basis_r, CompositeBasis)
throw(ArgumentError("Partial trace can only be applied onto operators with composite bases."))
end
rank = length(a.basis_l.shape)
if rank != length(a.basis_r.shape)
throw(ArgumentError("Partial trace can only be applied onto operators wich have the same number of subsystems in the left basis and right basis."))
end
if rank == length(indices)
throw(ArgumentError("Partial trace can't be used to trace out all subsystems - use tr() instead."))
end
check_indices(length(a.basis_l.shape), indices)
for i=indices
if a.basis_l.shape[i] != a.basis_r.shape[i]
throw(ArgumentError("Partial trace can only be applied onto subsystems that have the same left and right dimension."))
end
end
end
function check_ptrace_arguments(a::StateVector, indices::Vector{Int})
if length(basis(a).shape) == length(indices)
throw(ArgumentError("Partial trace can't be used to trace out all subsystems - use tr() instead."))
end
check_indices(length(basis(a).shape), indices)
end
samebases(a::AbstractOperator) = samebases(a.basis_l, a.basis_r)::Bool
samebases(a::AbstractOperator, b::AbstractOperator) = samebases(a.basis_l, b.basis_l)::Bool && samebases(a.basis_r, b.basis_r)::Bool
check_samebases(a::AbstractOperator) = check_samebases(a.basis_l, a.basis_r)
multiplicable(a::AbstractOperator, b::Ket) = multiplicable(a.basis_r, b.basis)
multiplicable(a::Bra, b::AbstractOperator) = multiplicable(a.basis, b.basis_l)
multiplicable(a::AbstractOperator, b::AbstractOperator) = multiplicable(a.basis_r, b.basis_l)
Base.size(op::AbstractOperator) = prod(length(op.basis_l),length(op.basis_r))
Base.size(op::AbstractOperator, i::Int) = (i==1 ? length(op.basis_l) : length(op.basis_r))