-
Notifications
You must be signed in to change notification settings - Fork 0
/
Qmapping.py
290 lines (247 loc) · 8.21 KB
/
Qmapping.py
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
import numpy as np
import matplotlib.pyplot as plt
from matplotlib import cm
import cmath
from numpy import random
from numpy.random import normal
from qutip import expect , Qobj
import qutip
import math
from qutip import Qobj,basis
from qutip import sigmax , sigmaz , sigmay
from qutip import tensor
######################################################################################################
################################## useful operators and parameters ###################################
######################################################################################################
C6 = 5.42e-24
desire_rabi = 8*np.pi *1e6
sigx = sigmax()
sigz = sigmaz()
sigy = sigmay()
iid = qutip.qeye(2)
rr = Qobj([[0,0],[0,1]])
ee = Qobj([[1,0],[0,0]])
cnot=tensor(ee, iid)+ tensor(rr, sigx)
######################################################################################################
################################## quantum circuits and evolutioons ##################################
######################################################################################################
def Rz(theta):
return Qobj([[1,0],[0,cmath.exp(1j*theta)]])
def gst(d):
b = [basis(2,0) for i in range(d)]
return tensor(b)
def form_op(tg,operator , d) :
r = iid
if 0 in tg :
r = operator
for i in range(1,d):
if i in tg :
r = tensor(r , operator)
else :
r = tensor(r , iid)
return r
def dynamics(d,error=None):
# if error:
# er=normal(loc=1.0, scale=error[1], size=1)
# h = form_op([0] , sigx , d)
# for i in range(1,d) :
# h += form_op([i],sigx ,d)
# else:
h = form_op([0] , sigx , d)
for i in range(1,d) :
h += form_op([i],sigx ,d)
return h
def Hadama(d):
h = 1/(2)**0.5*form_op([0] , Qobj([[1,1],[1,-1]]) , d)
for i in range(1,d) :
h = 1/(2)**0.5*form_op([i],Qobj([[1,1],[1,-1]]) ,d) *h
return h
def EncodingP(d,data,op):
if op=="z":
h = ee * cmath.exp(-1j*data[0]) + rr * cmath.exp(1j*data[0])
for i in range(1,d) :
h = tensor(h, ee * cmath.exp(-1j*data[i]) + rr * cmath.exp(1j*data[i]))
return h
elif op=="x":
h = iid * math.cos(data[0]) - sigx * 1j*math.sin(data[0])
for i in range(1,d) :
h = tensor(h,iid * math.cos(data[i]) - sigx *1j* math.sin(data[i]))
return h
def Entangle(config , d, operator_list, error=None ):
e0 = 0
for idx ,x in enumerate(config) :
for idy ,y in enumerate(x[idx::],start=idx) :
if idx != idy:
h += y * operator_list[idx][idy]
else:
if error:
e0=normal(0.0, error[0])
try :
h += (y+e0) * operator_list[idx][idy]
except :
h = (y+e0) * operator_list[idx][idy]
return h
def CnotGate(d):
d-=1
h = form_op([0] , cnot , d)
for i in range(1,d) :
h = form_op([i],cnot ,d) * h
return h
def ZZGate(config,d):
d-=1
h = form_op([0] , cnot*tensor(iid,Rz(config[0]))*cnot , d)
for i in range(1,d) :
h = form_op([i],cnot*tensor(iid,Rz(config[i]))*cnot ,d) * h
return h
def HMap(config , d, Ruby,operator_list, error=None) :
return Ruby*dynamics(d) + Entangle(config , d,operator_list ,error)
def evolution(H,t) :
return (-1j * H * t).expm()
def k_value(left , right) :
# print(left.dag() * right)
kk = (left.dag() * right)
return (kk * kk.conjugate()).real
CXH = tensor((iid - sigz) , (iid - sigx))
(-np.pi * 0.25 * 1j *CXH).expm()
def noisy_cnot(d):
AAA=[]
d-=1
for i in range(d) :
aa=(CXH * normal(np.pi * 0.25 , 0.065) * -1j).expm()
h = form_op([i] , aa , d)
AAA.append(h)
return AAA
# (-np.pi * 0.25 * 1j *CXH).expm()
def EvCnot(AAA,state):
for i in AAA:
state = i*state
return state
def get_config(pos):
config = np.zeros([len(pos),len(pos)])
for idx , r in enumerate(pos) :
for idy , _r in enumerate(pos) :
if idx != idy :
v = C6/((r - _r)**6)
# since we set the value of V/U
v = v /desire_rabi
config[idx][idy] = v
return config
# chain
def noisy_pos(r, error):
pos_x = []
for _r in r :
if error:
pos_x.append(_r + normal(0,error[2]* 1e-6))
else:
pos_x.append(_r)
return pos_x
def evolve(H,state,t) :
# rs = qutip.sesolve(H ,state,[0,t] )
rs = qutip.sesolve(H ,state,np.linspace(0,t,50) )
return rs.states[-1]
def Qmap(pos , d,t,Data ,Ruby,op,operator_list, tier,mode="quera",error=None):
if tier<=0 :
print('Error! tier need to be larger than 0')
return
rs = []
rs = [[] for _ in range (tier)]
if mode == "ZZ":
d+=1
right_gst = gst(d)
if error:
if mode == "quera":
dy=Ruby*dynamics(d)
for da in Data:
EP=EncodingP(d,da,op)
state= EP * right_gst
for i in range(tier):
pos_n = noisy_pos (pos,error = error) #error quera
config = get_config(pos_n)
e1=normal(loc=1.0, scale=error[1])
h = e1*dy +Entangle(config , d,operator_list, error)
# ev=evolution(h,t)
# state= ev * state
state=evolve(h,state,t)
state= EP * state
rs[i].append(state)
elif mode == "cnot":
for da in Data:
EP=EncodingP(d,da,op)
state= EP * right_gst
for i in range(tier):
Noise = noisy_cnot(d)
state= EvCnot(Noise,state)
state= EP * state
rs[i].append(state)
else:
config = get_config(pos)
if mode == "quera":
h = HMap(config ,d ,Ruby,operator_list)
ev=evolution(h,t)
elif mode == "cnot":
ev = CnotGate(d)
if mode == "ZZ":
Ha=Hadama(d)
for da in Data:
EP=ZZGate(da,d)*Ha
state= EP * right_gst
for i in range(tier):
state= EP * state
rs.append(state)
else:
for da in Data:
EP=EncodingP(d,da,op)
state= EP * right_gst
for i in range(tier):
state= ev * state
state= EP * state
rs[i].append(state)
return rs
######################################################################################
################################## kernal Functions ##################################
######################################################################################
def get_q_kernel(state1 , state2 , status = "train" ):
k_matrix = []
for i ,s in enumerate(state1) :
_k = []
for j , st in enumerate(state2) :
if i >= j or status == "test":
_k.append(k_value(s,st))
else :
_k.append(0)
k_matrix.append(_k)
if status == "train" :
for idy , km in enumerate(k_matrix) :
for idx , k in enumerate(km) :
if k == 0 :
k_matrix[idy][idx] = k_matrix[idx][idy]
return np.array(k_matrix)
# kernel transformation, visualization
def diagnal(target , diag):
for k in range(0,len(target)) :
target[k][k] = diag
return target
def rescale(target):
_min = np.min(target)
_max = np.max(target)
delta = _max - _min
for i in range(0,len(target)) :
for j in range(0,len(target[0])) :
target[i][j] = (target[i][j] - _min) / delta
return target
def show_kmatrix(test=[], train = [],name = ""):
fig, axs = plt.subplots(1, 2, figsize=(10, 5))
# if test != [] :
a1=axs[0].imshow(np.asmatrix(test),
interpolation='nearest', origin='upper', cmap='Blues')
plt.colorbar(a1)
axs[0].set_title("testing kernel matrix")
# if train != [] :
a2=axs[1].imshow(np.asmatrix(train),
interpolation='nearest', origin='upper', cmap='Blues')
plt.colorbar(a2)
axs[1].set_title("training kernel matrix")
if name == "" :
plt.show()
else :
plt.savefig(name)