-
Notifications
You must be signed in to change notification settings - Fork 1
/
Step.py
47 lines (36 loc) · 1.3 KB
/
Step.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
class Step:
def __init__(self, n):
self.gates = []
for i in range(n):
self.gates.append(I())
self.gates = np.array(self.gates)
def size(self):
return len(self.gates)
def addGate(self, gate):
if issubclass(g.__class__,C):
cq = gate.control_qubit
tq = gate.target_qubit
self.gates[cq] = gate
self.gates[tq] = gate
else:
self.gates[gate.qubit_index] = gate
def kroneckerize(self):
return kronekerize(0, 1)
def kronekerize(i, last):
g = self.gates[i]
# TODO END CONDITION
# if i == self.size()-1:
# return last
if issubclass(g.__class__,C):
if i == g.control_qubit:
# control qubit == 0 case:
self.gates[g.target_qubit]
a = kronekerize(i+1, np.kron(np.array([[1,0],[0,0]]), last))
# control qubit == 1 case:
b = kronekerize(i+1, np.kron(np.array([[0,0],[0,1]]), last))
return a + b
else:
else:
return kronekerize(i+1, np.kron(g.matrix, last))
def __repr__(self):
return str(s.gates)