-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathsimulator.py
More file actions
66 lines (58 loc) · 2.59 KB
/
Copy pathsimulator.py
File metadata and controls
66 lines (58 loc) · 2.59 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
import functools
import numpy as np
from scipy import sparse
identity = np.array([[1, 0], [0, 1]])
sigma_x = np.array([[0, 1], [1, 0]])
sigma_z = np.array([[1, 0], [0, -1]])
class IsingHamiltonianSimulator:
def __init__(self, anneal_schedule=None, time_steps=100, sparse_format="csr", sparse_dtype=np.float64):
self.anneal_schedule = self.default_anneal_schedule if anneal_schedule is None else anneal_schedule
self.time_steps = time_steps
self.sparse_format = sparse_format
self.sparse_dtype = sparse_dtype
@staticmethod
def default_anneal_schedule(s):
a = 1 - s
b = s
return a, b
def get_H_init(self, num_qubits):
size = 2**num_qubits
H_init = sparse.csr_array((size, size), dtype=self.sparse_dtype)
i_sparse = sparse.csc_array(identity, dtype=self.sparse_dtype)
x_sparse = sparse.csc_array(sigma_x, dtype=self.sparse_dtype)
for i in range(num_qubits):
terms = [i_sparse] * num_qubits
terms[i] = x_sparse
H_init -= functools.reduce(lambda A, B: sparse.kron(A, B, format=self.sparse_format), terms)
return H_init
def get_H_final(self, num_qubits, h, J, offset):
size = 2**num_qubits
diag = np.full(size, fill_value=offset, dtype=self.sparse_dtype)
i_diag = np.diag(identity)
z_diag = np.diag(sigma_z)
for i in range(num_qubits):
terms = [i_diag] * num_qubits
terms[i] = z_diag
diag += h[i] * functools.reduce(np.outer, terms).ravel()
for i in range(num_qubits):
for j in range(i + 1, num_qubits):
terms = [i_diag] * num_qubits
terms[i] = z_diag
terms[j] = z_diag
diag += J[i, j] * functools.reduce(np.outer, terms).ravel()
H_final = sparse.diags(diag, offsets=0, format=self.sparse_format)
return H_final
def run(self, bqm):
num_qubits = bqm.num_variables
linear, quadratic, offset = bqm.to_ising()
h = np.array([linear.get(i, 0) for i in range(num_qubits)])
J = np.array([[quadratic.get((i, j), 0) for i in range(num_qubits)] for j in range(num_qubits)])
H_init = self.get_H_init(num_qubits=num_qubits)
H_final = self.get_H_final(num_qubits=num_qubits, h=h, J=J, offset=offset)
time = np.linspace(start=0, stop=1, num=self.time_steps)
H_ising_list = []
for s in time:
a, b = self.anneal_schedule(s=s)
H_ising = -a * H_init + b * H_final
H_ising_list.append(H_ising)
return H_ising_list