-
Notifications
You must be signed in to change notification settings - Fork 7
Expand file tree
/
Copy pathsatmethod.py
More file actions
183 lines (133 loc) · 5.03 KB
/
Copy pathsatmethod.py
File metadata and controls
183 lines (133 loc) · 5.03 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
"""
Created on Fri Oct 25 14:46:36 2019
@author: yuqinchen
"""
from dynamics import SatSearchEfficient
import mcts
import math
from numpy import *
from scipy import linalg
import numpy as np
import random
from qutip import *
class system():
def satSystem(n_qubit,result):
N=2**n_qubit
sx=np.array([[0,1],[1,0]])
si=np.array([[1,0],[0,1]])
HB=np.kron(si,si)
for i in range(n_qubit-2):
HB=np.kron(si,HB)
HB=n_qubit*HB/2
for j in range(n_qubit):
if j==0:
B=sx
for i in range(n_qubit-1-j):
B=np.kron(si,B)
else:
for i in range(j):
if i==0:
B=si
else:
B=np.kron(si,B)
B=np.kron(sx,B)
for i in range(n_qubit-1-j):
B=np.kron(si,B)
HB=HB-B/2
HC= np.zeros((N,N))
for ii in result:
i=int(ii)
HC[i,i]=HC[i,i]+1
HP=HC
bb=[np.sqrt(1./2**n_qubit)]*2**n_qubit
sit=HP.tolist().index(min(HP.tolist()))
bp=[0]*2**n_qubit
bp[sit]=1
psi0 =Qobj(np.array(bb))
psif =Qobj(np.array(bp))
return HB,HP,psi0,psif
class method():
def linear(n_qubit,T,Mcut,HB,HP,psi0,psif):
pathdesign=SatSearchEfficient(n_qubit,T,Mcut,HB,HP,psi0,psif)
obs=np.array([0.,0., 0.,0., 0.])
energy,fidelity = pathdesign.evolution(obs)
return energy,fidelity
def StochasticDescent(n_qubit,T,Mcut,HB,HP,psi0,psif):
pathdesign=SatSearchEfficient(n_qubit,T,Mcut,HB,HP,psi0,psif)
delta=0.01#/4
iterNum=100
ncan=0
obs=np.random.rand(Mcut)*0. #0.02
list = [x/100 for x in range(-20, 20,1)]
for i in range (Mcut):
# # obs[i]=random.uniform(-0.2,0.2)
slice = random.sample(list, 1)
obs[i]=slice[0]
print(obs)
iter = 0
while True:
iter += 1
energy,fidelity = pathdesign.evolution(obs)
ncan=ncan+1
obs1=obs
fid=fidelity
num_converge = 0
for m in range(1, 1+Mcut):
#print('Updating parameter b{}'.format(m))
if obs[m-1]+ delta > 0.2 or obs[m-1] - delta < -0.2:
num_converge += 1
continue
obs[m-1] += delta #/m #高频的变化幅度大于低频
#print(delta/m )
#print(obs)
energy,fidelity = pathdesign.evolution(obs)
ncan=ncan+1
if fidelity > fid:
fid=fidelity
#print('b{}+delta'.format(m))
continue
else:
obs[m-1] -= 2*delta #/m
#print(delta/m )
#print(obs)
energy,fidelity = pathdesign.evolution(obs)
ncan=ncan+1
if fidelity > fid:
fid=fidelity
#print('b{}-delta'.format(m))
continue
else:
obs[m-1] += delta #/m
num_converge += 1
#print('keep invariant')
continue
if num_converge == Mcut:
#print('fidelity:', fid,energy)
break
if iter > iterNum:
print('WARNING: The algorithm does not converge')
break
#print("ss:",obs)
#print(iter)
print("iter:",iter,"ncan:",ncan)
return obs1, fid
def mcts(data,n_qubit,T,Mcut,HB,HP,psi0,psif,ncandidates):
pathdesign=SatSearchEfficient(n_qubit,T,Mcut,HB,HP,psi0,psif)
def get_reward(struct):
delta=0.1 ##update lenth
De=40 #20
Mcut=5 #5 ## frequence cut
obs=np.zeros((Mcut), dtype=np.float64)
for i in range(Mcut):
obs[i]=-0.2+struct[i]%De*0.01
energy,fidelity = pathdesign.evolution(obs)
cond=fidelity
return cond
myTree=mcts.Tree(data,T,no_positions=5, atom_types=list(range(40)), atom_const=None, get_reward=get_reward, positions_order=list(range(5)),
max_flag=True,expand_children=10, play_out=5, play_out_selection="best", space=None, candidate_pool_size=100,
ucb="mean")
res=myTree.search(display=True,no_candidates=ncandidates)
print (res.checked_candidates_size/50)
fidelity=res.optimal_fx
obs=res.optimal_candidate
return obs,fidelity