This repository was archived by the owner on Mar 14, 2026. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 9
Expand file tree
/
Copy pathinnerexpr.jl
More file actions
270 lines (226 loc) · 8.08 KB
/
Copy pathinnerexpr.jl
File metadata and controls
270 lines (226 loc) · 8.08 KB
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
##############
# InnerLabel #
##############
immutable InnerProduct{N} <: Number
b::StateLabel{N}
k::StateLabel{N}
end
blabel(i::InnerProduct) = i.b
klabel(i::InnerProduct) = i.k
Base.repr(i::InnerProduct) = brstr(blabel(i))*ktstr(klabel(i))[2:end]
Base.show(io::IO, i::InnerProduct) = print(io, repr(i))
Base.:(==)(a::InnerProduct, b::InnerProduct) = blabel(a) == blabel(b) && klabel(a) == klabel(b)
Base.:(==)(::InnerProduct, ::Number) = false
Base.:(==)(::Number, ::InnerProduct) = false
Base.hash(i::InnerProduct) = hash(blabel(i), hash(klabel(i)))
Base.hash(i::InnerProduct, h::UInt64) = hash(hash(i), h)
Base.conj(i::InnerProduct) = InnerProduct(klabel(i), blabel(i))
##############
# inner_rule #
##############
# we can cheat here to avoid tempory StateLabel construction
# to evaluate KroneckerDelta inner products
eval_inner_rule(p::KroneckerDelta, b, k) = inner_rule(p, b, k)
eval_inner_rule(p::KroneckerDelta, b::StateLabel, k::StateLabel) = inner_rule(p, b, k)
eval_inner_rule(p::AbstractInner, b::StateLabel, k::StateLabel) = inner_rule(p, b, k)
eval_inner_rule(p::AbstractInner, b, k) = inner_rule(p, StateLabel(b), StateLabel(k))
inner_rule{P<:AbstractInner}(::P, b, k) = error("inner_rule(::$P, ::StateLabel, ::StateLabel) must be defined to evaluate inner products with type $P")
inner_rule(::UndefinedInner, b, k) = InnerExpr(InnerProduct(b, k))
inner_rule(::KroneckerDelta, b, k) = b == k ? 1 : 0
inner_rettype{P<:AbstractInner}(::P) = first(Base.return_types(inner_rule, (P, StateLabel, StateLabel)))
inner_rettype(::UndefinedInner) = InnerExpr
inner_rettype(::KroneckerDelta) = Int64
# very common operation for state/operator inner products
inner_mul(v,c,prodtype,b,k) = v * c * eval_inner_rule(prodtype, b, k)
##############
# InnerExpr #
##############
# A InnerExpr is a type that wraps arthimetic expressions
# performed with InnerExprs. The allows storage and
# delayed evaluation of expressions. For example, this
# expression:
#
# (< a | b >^2 + < c | d >^2 - 3.13+im) / 2
#
# is representable as a InnerExpr.
immutable InnerExpr <: Number
ex::Expr
end
InnerExpr(iex::InnerExpr) = InnerExpr(iex.ex)
InnerExpr{N<:Number}(n::N) = convert(InnerExpr, n)
Base.convert(::Type{InnerExpr}, iex::InnerExpr) = iex
Base.convert{N<:Number}(::Type{InnerExpr}, n::N) = InnerExpr(Expr(:call, +, n))
Base.:(==)(a::InnerExpr, b::InnerExpr) = a.ex == b.ex
same_num(a::Number, b::Number) = a == b
same_num(a::InnerExpr, b::InnerExpr) = a == b
same_num(iex::InnerExpr, i::InnerProduct) = iex == InnerExpr(i)
same_num(i::InnerProduct, iex::InnerExpr) = iex == i
same_num(iex::InnerExpr, n::Number) = iex == InnerExpr(n)
same_num(n::Number, iex::InnerExpr) = iex == n
Base.hash(iex::InnerExpr) = hash(iex.ex)
Base.hash(iex::InnerExpr, h::UInt64) = hash(hash(iex), h)
Base.one(::InnerExpr) = InnerExpr(1)
Base.zero(::InnerExpr) = InnerExpr(0)
Base.promote_rule{N<:Number}(::Type{InnerExpr}, ::Type{N}) = InnerExpr
Base.length(iex::InnerExpr) = length(iex.ex.args)
Base.getindex(iex::InnerExpr, i::Integer) = iex.ex.args[i]
##############
# inner_eval #
##############
inner_eval(f, iex::InnerExpr) = eval(inner_reduce!(f, copy(iex.ex)))
inner_eval(f, c) = c
inner_reduce!(f, iex::InnerExpr) = inner_reduce!(f, copy(iex.ex))
inner_reduce!(f::Function, i::InnerProduct) = f(blabel(i), klabel(i))
inner_reduce!(p::AbstractInner, i::InnerProduct) = inner_rule(p, blabel(i), klabel(i))
inner_reduce!(f, n) = n
function inner_reduce!(f, ex::Expr)
for i=1:length(ex.args)
ex.args[i] = inner_reduce!(f, ex.args[i])
end
return ex
end
######################
# Printing Functions #
######################
Base.show(io::IO, iex::InnerExpr) = print(io, repr(iex.ex)[2:end])
##################
# Exponentiation #
##################
function iexpr_exp(a, b)
if same_num(b, 1)
return InnerExpr(a)
elseif same_num(a, 0)
return InnerExpr(0)
elseif same_num(b, 0)
return InnerExpr(1)
else
return InnerExpr(:($(s)^$(n)))
end
end
Base.:^(a::InnerExpr, b::Integer) = iexpr_exp(a, b)
Base.:^(a::InnerExpr, b::Rational) = iexpr_exp(a, b)
Base.:^(a::InnerExpr, b::InnerExpr) = iexpr_exp(a, b)
Base.:^(a::InnerExpr, b::Number) = iexpr_exp(a, b)
#Base.:^(a::MathConst{:e}, b::InnerExpr) = iexpr_exp(a, b)
Base.:^(a::Number, b::InnerExpr) = iexpr_exp(a, b)
Base.exp(iex::InnerExpr) = InnerExpr(:(exp($(iex))))
Base.exp2(iex::InnerExpr) = InnerExpr(:(exp2($(iex))))
Base.sqrt(iex::InnerExpr) = InnerExpr(:(sqrt($(iex))))
Base.log(iex::InnerExpr) = length(iex)==2 && iex[1]==:exp ? iex[2] : InnerExpr(:(log($(iex))))
#Base.log(a::MathConst{:e}, b::InnerExpr) = InnerExpr(:(log($(a),$(b))))
Base.log(a::InnerExpr, b::InnerExpr) = InnerExpr(:(log($(a),$(b))))
Base.log(a::InnerExpr, b::Number) = InnerExpr(:(log($(a),$(b))))
Base.log(a::Number, b::InnerExpr) = InnerExpr(:(log($(a),$(b))))
Base.log2(iex::InnerExpr) = length(iex)==2 && iex[1]==:exp2 ? iex[2] : InnerExpr(:(log2($(iex))))
##################
# Multiplication #
##################
function iexpr_mul(a,b)
if same_num(b, 1)
return InnerExpr(a)
elseif same_num(a, 1)
return InnerExpr(b)
elseif same_num(b, 0) || same_num(a, 0)
return InnerExpr(0)
else
return InnerExpr(:($(a)*$(b)))
end
end
Base.:*(a::InnerExpr, b::InnerExpr) =iexpr_mul(a,b)
Base.:*(a::Bool, b::InnerExpr) = iexpr_mul(a,b)
Base.:*(a::InnerExpr, b::Bool) = iexpr_mul(a,b)
Base.:*(a::InnerExpr, b::Number) = iexpr_mul(a,b)
Base.:*(a::Number, b::InnerExpr) = iexpr_mul(a,b)
############
# Division #
############
function iexpr_div(a, b)
if same_num(a, b)
return InnerExpr(1)
elseif same_num(a, 0)
return InnerExpr(0)
elseif same_num(b, 0)
return InnerExpr(Inf)
elseif same_num(b, 1)
return InnerExpr(a)
else
return InnerExpr(:($(a)/$(b)))
end
end
Base.:/(a::InnerExpr, b::InnerExpr) = iexpr_div(a, b)
Base.:/(a::InnerExpr, b::Complex) = iexpr_div(a, b)
Base.:/(a::InnerExpr, b::Number) = iexpr_div(a, b)
Base.:/(a::Number, b::InnerExpr) = iexpr_div(a, b)
############
# Addition #
############
function iexpr_add(a, b)
if same_num(a, 0)
return InnerExpr(b)
elseif same_num(b, 0)
return InnerExpr(a)
else
return InnerExpr(:($(a)+$(b)))
end
end
Base.:+(a::InnerExpr, b::InnerExpr) = iexpr_add(a, b)
Base.:+(a::InnerExpr, b::Number) = iexpr_add(a, b)
Base.:+(a::Number, b::InnerExpr) = iexpr_add(a, b)
###############
# Subtraction #
###############
Base.:-(iex::InnerExpr) = length(iex)==2 && iex[1]==:- ? InnerExpr(iex[2]) : InnerExpr(:(-$(iex)))
function iexpr_subtract(a, b)
if same_num(a, b)
return InnerExpr(0)
elseif same_num(a, 0)
return InnerExpr(-b)
elseif same_num(b, 0)
return InnerExpr(a)
else
return InnerExpr(:($(a)-$(b)))
end
end
Base.:-(a::InnerExpr, b::InnerExpr) = iexpr_subtract(a, b)
Base.:-(a::InnerExpr, b::Number) = iexpr_subtract(a, b)
Base.:-(a::Number, b::InnerExpr) = iexpr_subtract(a, b)
##################
# Absolute Value #
##################
Base.abs(iex::InnerExpr) = length(iex)==2 && iex[1]==:abs ? iex : InnerExpr(:(abs($(iex))))
Base.abs2(iex::InnerExpr) = InnerExpr(:(abs2($iex)))
#####################
# Complex Conjugate #
#####################
Base.conj(iex::InnerExpr) = length(iex)==2 && iex[1]==:conj ? InnerExpr(iex[2]) : InnerExpr(:(conj($(iex))))
Base.ctranspose(iex::InnerExpr) = conj(iex)
##########################
# Elementwise Operations #
##########################
for op=(:*,:-,:+,:/,:^)
elop = Symbol(string(:.) * string(op))
@eval begin
($elop)(a::InnerExpr, b::InnerExpr) = ($op)(a,b)
($elop)(a::InnerExpr, b::Number) = ($op)(a,b)
($elop)(a::Number, b::InnerExpr) = ($op)(a,b)
end
end
######################
# Printing Functions #
######################
function Base.repr(iex::InnerExpr)
if iex[1]==+
if length(iex)==2
return repr(iex[2])
else
return repr(Expr(:call, iex.ex[2:end]...))[3:end-1]
end
else
return repr(iex.ex)[2:end]
end
end
Base.show(io::IO, iex::InnerExpr) = print(io, repr(iex))
export InnerExpr,
inner_eval,
inner_rule,
inner_rettype