/
noise_adaptive_layout.py
259 lines (233 loc) · 11.2 KB
/
noise_adaptive_layout.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
# -*- coding: utf-8 -*-
# This code is part of Qiskit.
#
# (C) Copyright IBM 2017, 2019.
#
# This code is licensed under the Apache License, Version 2.0. You may
# obtain a copy of this license in the LICENSE.txt file in the root directory
# of this source tree or at http://www.apache.org/licenses/LICENSE-2.0.
#
# Any modifications or derivative works of this code must retain this
# copyright notice, and modified files need to carry a notice indicating
# that they have been altered from the originals.
"""Choose a noise-adaptive Layout based on current calibration data for the backend."""
import math
import networkx as nx
from qiskit.transpiler.layout import Layout
from qiskit.transpiler.basepasses import AnalysisPass
from qiskit.transpiler.exceptions import TranspilerError
class NoiseAdaptiveLayout(AnalysisPass):
"""Choose a noise-adaptive Layout based on current calibration data for the backend.
This pass associates a physical qubit (int) to each virtual qubit
of the circuit (Qubit), using calibration data.
The pass implements the qubit mapping method from:
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
Prakash Murali, Jonathan M. Baker, Ali Javadi-Abhari, Frederic T. Chong, Margaret R. Martonosi
ASPLOS 2019 (arXiv:1901.11054).
Methods:
Ordering of edges:
Map qubits edge-by-edge in the order of decreasing frequency of occurrence in the program dag.
Initialization:
If an edge exists with both endpoints unmapped,
pick the best available hardware cx to execute this edge.
Iterative step:
When an edge exists with one endpoint unmapped,
map that endpoint to a location which allows
maximum reliability for CNOTs with previously mapped qubits.
In the end if there are unmapped qubits (which don't
participate in any CNOT), map them to any available
hardware qubit.
Notes:
even though a `layout` is not strictly a property of the DAG,
in the transpiler architecture it is best passed around between passes
by being set in `property_set`.
"""
def __init__(self, backend_prop):
"""NoiseAdaptiveLayout initializer.
Args:
backend_prop (BackendProperties): backend properties object
Raises:
TranspilerError: if invalid options
"""
super().__init__()
self.backend_prop = backend_prop
self.swap_graph = nx.DiGraph()
self.cx_reliability = {}
self.readout_reliability = {}
self.available_hw_qubits = []
self.gate_list = []
self.gate_reliability = {}
self.swap_paths = {}
self.swap_reliabs = {}
self.prog_graph = nx.Graph()
self.qarg_to_id = {}
self.pending_program_edges = []
self.prog2hw = {}
def _initialize_backend_prop(self):
"""Extract readout and CNOT errors and compute swap costs."""
backend_prop = self.backend_prop
for ginfo in backend_prop.gates:
if ginfo.gate == 'cx':
for item in ginfo.parameters:
if item.name == 'gate_error':
g_reliab = 1.0 - item.value
break
g_reliab = 1.0
swap_reliab = pow(g_reliab, 3)
# convert swap reliability to edge weight
# for the Floyd-Warshall shortest weighted paths algorithm
swap_cost = -math.log(swap_reliab) if swap_reliab != 0 else math.inf
self.swap_graph.add_edge(ginfo.qubits[0], ginfo.qubits[1], weight=swap_cost)
self.swap_graph.add_edge(ginfo.qubits[1], ginfo.qubits[0], weight=swap_cost)
self.cx_reliability[(ginfo.qubits[0], ginfo.qubits[1])] = g_reliab
self.gate_list.append((ginfo.qubits[0], ginfo.qubits[1]))
idx = 0
for q in backend_prop.qubits:
for nduv in q:
if nduv.name == 'readout_error':
self.readout_reliability[idx] = 1.0 - nduv.value
self.available_hw_qubits.append(idx)
idx += 1
for edge in self.cx_reliability:
self.gate_reliability[edge] = self.cx_reliability[edge] * \
self.readout_reliability[edge[0]] * \
self.readout_reliability[edge[1]]
self.swap_paths, swap_reliabs_temp = nx.algorithms.shortest_paths.dense.\
floyd_warshall_predecessor_and_distance(self.swap_graph, weight='weight')
for i in swap_reliabs_temp:
self.swap_reliabs[i] = {}
for j in swap_reliabs_temp[i]:
if (i, j) in self.cx_reliability:
self.swap_reliabs[i][j] = self.cx_reliability[(i, j)]
elif (j, i) in self.cx_reliability:
self.swap_reliabs[i][j] = self.cx_reliability[(j, i)]
else:
best_reliab = 0.0
for n in self.swap_graph.neighbors(j):
if (n, j) in self.cx_reliability:
reliab = math.exp(-swap_reliabs_temp[i][n])*self.cx_reliability[(n, j)]
else:
reliab = math.exp(-swap_reliabs_temp[i][n])*self.cx_reliability[(j, n)]
if reliab > best_reliab:
best_reliab = reliab
self.swap_reliabs[i][j] = best_reliab
def _qarg_to_id(self, qubit):
"""Convert qarg with name and value to an integer id."""
return self.qarg_to_id[qubit.register.name + str(qubit.index)]
def _create_program_graph(self, dag):
"""Program graph has virtual qubits as nodes.
Two nodes have an edge if the corresponding virtual qubits
participate in a 2-qubit gate. The edge is weighted by the
number of CNOTs between the pair.
"""
idx = 0
for q in dag.qubits:
self.qarg_to_id[q.register.name + str(q.index)] = idx
idx += 1
for gate in dag.two_qubit_ops():
qid1 = self._qarg_to_id(gate.qargs[0])
qid2 = self._qarg_to_id(gate.qargs[1])
min_q = min(qid1, qid2)
max_q = max(qid1, qid2)
edge_weight = 1
if self.prog_graph.has_edge(min_q, max_q):
edge_weight = self.prog_graph[min_q][max_q]['weight'] + 1
self.prog_graph.add_edge(min_q, max_q, weight=edge_weight)
return idx
def _select_next_edge(self):
"""Select the next edge.
If there is an edge with one endpoint mapped, return it.
Else return in the first edge
"""
for edge in self.pending_program_edges:
q1_mapped = edge[0] in self.prog2hw
q2_mapped = edge[1] in self.prog2hw
assert not (q1_mapped and q2_mapped)
if q1_mapped or q2_mapped:
return edge
return self.pending_program_edges[0]
def _select_best_remaining_cx(self):
"""Select best remaining CNOT in the hardware for the next program edge."""
candidates = []
for gate in self.gate_list:
chk1 = gate[0] in self.available_hw_qubits
chk2 = gate[1] in self.available_hw_qubits
if chk1 and chk2:
candidates.append(gate)
best_reliab = 0
best_item = None
for item in candidates:
if self.gate_reliability[item] > best_reliab:
best_reliab = self.gate_reliability[item]
best_item = item
return best_item
def _select_best_remaining_qubit(self, prog_qubit):
"""Select the best remaining hardware qubit for the next program qubit."""
reliab_store = {}
for hw_qubit in self.available_hw_qubits:
reliab = 1
for n in self.prog_graph.neighbors(prog_qubit):
if n in self.prog2hw:
reliab *= self.swap_reliabs[self.prog2hw[n]][hw_qubit]
reliab *= self.readout_reliability[hw_qubit]
reliab_store[hw_qubit] = reliab
max_reliab = 0
best_hw_qubit = None
for hw_qubit in reliab_store:
if reliab_store[hw_qubit] > max_reliab:
max_reliab = reliab_store[hw_qubit]
best_hw_qubit = hw_qubit
return best_hw_qubit
def run(self, dag):
"""Run the NoiseAdaptiveLayout pass on `dag`."""
self._initialize_backend_prop()
num_qubits = self._create_program_graph(dag)
if num_qubits > len(self.swap_graph):
raise TranspilerError('Number of qubits greater than device.')
# sort by weight, then edge name for determinism (since networkx on python 3.5 returns
# different order of edges)
self.pending_program_edges = sorted(self.prog_graph.edges(data=True),
key=lambda x: [x[2]['weight'], -x[0], -x[1]],
reverse=True)
while self.pending_program_edges:
edge = self._select_next_edge()
q1_mapped = edge[0] in self.prog2hw
q2_mapped = edge[1] in self.prog2hw
if (not q1_mapped) and (not q2_mapped):
best_hw_edge = self._select_best_remaining_cx()
if best_hw_edge is None:
raise TranspilerError("CNOT({}, {}) could not be placed "
"in selected device.".format(edge[0], edge[1]))
self.prog2hw[edge[0]] = best_hw_edge[0]
self.prog2hw[edge[1]] = best_hw_edge[1]
self.available_hw_qubits.remove(best_hw_edge[0])
self.available_hw_qubits.remove(best_hw_edge[1])
elif not q1_mapped:
best_hw_qubit = self._select_best_remaining_qubit(edge[0])
if best_hw_qubit is None:
raise TranspilerError(
"CNOT({}, {}) could not be placed in selected device. "
"No qubit near qr[{}] available".format(edge[0], edge[1], edge[0]))
self.prog2hw[edge[0]] = best_hw_qubit
self.available_hw_qubits.remove(best_hw_qubit)
else:
best_hw_qubit = self._select_best_remaining_qubit(edge[1])
if best_hw_qubit is None:
raise TranspilerError(
"CNOT({}, {}) could not be placed in selected device. "
"No qubit near qr[{}] available".format(edge[0], edge[1], edge[1]))
self.prog2hw[edge[1]] = best_hw_qubit
self.available_hw_qubits.remove(best_hw_qubit)
new_edges = [x for x in self.pending_program_edges
if not (x[0] in self.prog2hw and x[1] in self.prog2hw)]
self.pending_program_edges = new_edges
for qid in self.qarg_to_id.values():
if qid not in self.prog2hw:
self.prog2hw[qid] = self.available_hw_qubits[0]
self.available_hw_qubits.remove(self.prog2hw[qid])
layout = Layout()
for q in dag.qubits:
pid = self._qarg_to_id(q)
hwid = self.prog2hw[pid]
layout[q] = hwid
self.property_set['layout'] = layout