-
Notifications
You must be signed in to change notification settings - Fork 11
/
neural.py
178 lines (164 loc) · 7.66 KB
/
neural.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
from codes import ToricCode
import numpy as np
import keras
import keras.backend as K
from keras.models import Sequential
from keras.layers import Dense, Dropout, Activation
from keras.optimizers import Nadam
from keras.objectives import binary_crossentropy
from keras.layers.normalization import BatchNormalization
import tensorflow as tf
F = lambda _: K.cast(_, 'float32') # TODO XXX there must be a better way to calculate mean than this cast-first approach
class CodeCosts:
def __init__(self, L, code, Z, X, normcentererr_p=None):
if normcentererr_p:
raise NotImplementedError('Throughout the entire codebase, the normalization and centering of the error, might be wrong... Or to be more precise, it might just be plain stupid, given that we are using binary crossentropy as loss.')
self.L = L
code = code(L)
H = code.H(Z,X)
E = code.E(Z,X)
self.H = K.variable(value=H) # TODO should be sparse
self.E = K.variable(value=E) # TODO should be sparse
self.p = normcentererr_p
def exact_reversal(self, y_true, y_pred):
"Fraction exactly predicted qubit flips."
if self.p:
y_pred = undo_normcentererr(y_pred, self.p)
y_true = undo_normcentererr(y_true, self.p)
return K.mean(F(K.all(K.equal(y_true, K.round(y_pred)), axis=-1)))
def non_triv_stab_expanded(self, y_true, y_pred):
"Whether the stabilizer after correction is not trivial."
if self.p:
y_pred = undo_normcentererr(y_pred, self.p)
y_true = undo_normcentererr(y_true, self.p)
return K.any(K.dot(self.H, K.transpose((K.round(y_pred)+y_true)%2))%2, axis=0)
def logic_error_expanded(self, y_true, y_pred):
"Whether there is a logical error after correction."
if self.p:
y_pred = undo_normcentererr(y_pred, self.p)
y_true = undo_normcentererr(y_true, self.p)
return K.any(K.dot(self.E, K.transpose((K.round(y_pred)+y_true)%2))%2, axis=0)
def triv_stab(self, y_true, y_pred):
"Fraction trivial stabilizer after corrections."
return 1-K.mean(F(self.non_triv_stab_expanded(y_true, y_pred)))
def no_error(self, y_true, y_pred):
"Fraction no logical errors after corrections."
return 1-K.mean(F(self.logic_error_expanded(y_true, y_pred)))
def triv_no_error(self, y_true, y_pred):
"Fraction with trivial stabilizer and no error."
# TODO XXX Those casts (the F function) should not be there! This should be logical operations
triv_stab = 1 - F(self.non_triv_stab_expanded(y_true, y_pred))
no_err = 1 - F(self.logic_error_expanded(y_true, y_pred))
return K.mean(no_err*triv_stab)
def e_binary_crossentropy(self, y_true, y_pred):
if self.p:
y_pred = undo_normcentererr(y_pred, self.p)
y_true = undo_normcentererr(y_true, self.p)
return K.mean(K.binary_crossentropy(y_pred, y_true), axis=-1)
def s_binary_crossentropy(self, y_true, y_pred):
if self.p:
y_pred = undo_normcentererr(y_pred, self.p)
y_true = undo_normcentererr(y_true, self.p)
s_true = K.dot(y_true, K.transpose(self.H))%2
twopminusone = 2*y_pred-1
s_pred = ( 1 - tf.real(K.exp(K.dot(K.log(tf.cast(twopminusone, tf.complex64)), tf.cast(K.transpose(self.H), tf.complex64)))) ) / 2
return K.mean(K.binary_crossentropy(s_pred, s_true), axis=-1)
def se_binary_crossentropy(self, y_true, y_pred):
return 2./3.*self.e_binary_crossentropy(y_true, y_pred) + 1./3.*self.s_binary_crossentropy(y_true, y_pred)
def create_model(L, hidden_sizes=[4], hidden_act='tanh', act='sigmoid', loss='binary_crossentropy',
Z=True, X=False, learning_rate=0.002,
normcentererr_p=None, batchnorm=0):
in_dim = L**2 * (X+Z)
out_dim = 2*L**2 * (X+Z)
model = Sequential()
model.add(Dense(int(hidden_sizes[0]*out_dim), input_dim=in_dim, kernel_initializer='glorot_uniform'))
if batchnorm:
model.add(BatchNormalization(momentum=batchnorm))
model.add(Activation(hidden_act))
for s in hidden_sizes[1:]:
model.add(Dense(int(s*out_dim), kernel_initializer='glorot_uniform'))
if batchnorm:
model.add(BatchNormalization(momentum=batchnorm))
model.add(Activation(hidden_act))
model.add(Dense(out_dim, kernel_initializer='glorot_uniform'))
if batchnorm:
model.add(BatchNormalization(momentum=batchnorm))
model.add(Activation(act))
c = CodeCosts(L, ToricCode, Z, X, normcentererr_p)
losses = {'e_binary_crossentropy':c.e_binary_crossentropy,
's_binary_crossentropy':c.s_binary_crossentropy,
'se_binary_crossentropy':c.se_binary_crossentropy}
model.compile(loss=losses.get(loss,loss),
optimizer=Nadam(lr=learning_rate),
metrics=[c.triv_no_error, c.e_binary_crossentropy, c.s_binary_crossentropy]
)
return model
def makeflips(q, out_dimZ, out_dimX):
flips = np.zeros((out_dimZ+out_dimX,), dtype=np.dtype('b'))
rand = np.random.rand(out_dimZ or out_dimX) # if neither is zero they have to necessarily be the same (equal to the number of physical qubits)
both_flips = (2*q<=rand) & (rand<3*q)
if out_dimZ: # non-trivial Z stabilizer is caused by flips in the X basis
x_flips = rand< q
flips[:out_dimZ] ^= x_flips
flips[:out_dimZ] ^= both_flips
if out_dimX: # non-trivial X stabilizer is caused by flips in the Z basis
z_flips = (q<=rand) & (rand<2*q)
flips[out_dimZ:out_dimZ+out_dimX] ^= z_flips
flips[out_dimZ:out_dimZ+out_dimX] ^= both_flips
return flips
def nonzeroflips(q, out_dimZ, out_dimX):
flips = makeflips(q, out_dimZ, out_dimX)
while not np.any(flips):
flips = makeflips(q, out_dimZ, out_dimX)
return flips
def data_generator(H, out_dimZ, out_dimX, in_dim, p, batch_size=512, size=None,
normcenterstab=False, normcentererr=False):
c = 0
q = (1-p)/3
while True:
flips = np.empty((batch_size, out_dimZ+out_dimX), dtype=int) # TODO dtype? byte?
for i in range(batch_size):
flips[i,:] = nonzeroflips(q, out_dimZ, out_dimX)
stabs = np.dot(flips,H.T)%2
if normcenterstab:
stabs = do_normcenterstab(stabs, p)
if normcentererr:
flips = do_normcentererr(flips, p)
yield (stabs, flips)
c += 1
if size and c==size:
raise StopIteration
def do_normcenterstab(stabs, p):
avg = (1-p)*2/3
avg_stab = 4*avg*(1-avg)**3 + 4*avg**3*(1-avg)
var_stab = avg_stab-avg_stab**2
return (stabs - avg_stab)/var_stab**0.5
def undo_normcenterstab(stabs, p):
avg = (1-p)*2/3
avg_stab = 4*avg*(1-avg)**3 + 4*avg**3*(1-avg)
var_stab = avg_stab-avg_stab**2
return stabs*var_stab**0.5 + avg_stab
def do_normcentererr(flips, p):
avg = (1-p)*2/3
var = avg-avg**2
return (flips-avg)/var**0.5
def undo_normcentererr(flips, p):
avg = (1-p)*2/3
var = avg-avg**2
return flips*var**0.5 + avg
def smart_sample(H, stab, pred, sample, giveup):
'''Sample `pred` until `H@sample==stab`.
`sample` is modified in place. `giveup` attempts are done at most.
Returns the number of attempts.'''
npany = np.any
nprandomuniform = np.random.uniform
npsum = np.sum
npdot = np.dot
attempts = 1
mismatch = stab!=npdot(H,sample)%2
while npany(mismatch) and attempts < giveup:
propagated = npany(H[mismatch,:], axis=0)
sample[propagated] = pred[propagated]>nprandomuniform(size=npsum(propagated))
mismatch = stab!=npdot(H,sample)%2
attempts += 1
return attempts