-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathquasar_ast.py
More file actions
444 lines (309 loc) · 12.7 KB
/
quasar_ast.py
File metadata and controls
444 lines (309 loc) · 12.7 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
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
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
#
# Copyright (c) 2019- Beit, Beit.Tech, Beit.Inc
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in all
# copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
# SOFTWARE.
#
from abc import abstractmethod, ABC
from typing import Iterable, List, Optional, TypeVar, Union
from builtin_gates import BuiltinGate, X_GATE
#
##
#
T = TypeVar('T')
def to_list(obj: Union[T, List[T]]) -> List[T]:
if isinstance(obj, list):
return obj
else:
return [obj]
#
##
#
class IASTVisitable(ABC):
@abstractmethod
def accept(self, visitor: 'IASTVisitor') -> Optional['IASTNode']:
pass
#
##
#
class IASTNode(IASTVisitable):
def __init__(self) -> None:
self._target_qubit_id : int = -1
self._control_positive_qubit_ids : List[int] = []
self._control_negative_qubit_ids : List[int] = []
def __add__(self, other: Union['IASTNode', List['IASTNode'], 'Program']) -> 'Program':
if (isinstance(other, IASTNode)):
return Program([self] + [other])
elif (isinstance(other, list)):
return Program([self] + other)
elif (isinstance(other, Program)):
return Program([self] + other._nodes)
raise TypeError(f'Cannot construct Program from type {type(other)}')
def set_target_qubit_id(self, target_qubit_id: int) -> None:
self._target_qubit_id = target_qubit_id
def get_target_qubit_id(self) -> int:
return self._target_qubit_id
ProgramLike = Union[IASTNode, List[IASTNode], 'Program']
class Program(IASTVisitable):
_qubit_counter = 0
_cbit_counter = 0
def __init__(self, other: Optional[ProgramLike] = None) -> None:
self._nodes : List[IASTNode] = []
if isinstance(other, Program):
self._nodes = other._nodes or []
elif isinstance(other, IASTNode):
self._nodes = [other]
elif isinstance(other, list):
self._nodes = other or []
elif other is not None:
raise Exception(f'Unknown type {type(other)}')
def __add__(self, other: ProgramLike) -> 'Program':
return Program(self._nodes + Program(other)._nodes)
def __iadd__(self, other: ProgramLike) -> 'Program':
self._nodes.extend(Program(other)._nodes)
return self
def __getitem__(self, index: int) -> IASTNode:
return self._nodes[index]
def __len__(self) -> int:
return len(self._nodes)
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_program(self)
def Qubit(self, init=0) -> 'QubitNode':
qubit = QubitNode()
qubit.set_name(f'$$_qubit_{Program._qubit_counter}')
Program._qubit_counter += 1
self._nodes.append(QubitDeclarationNode(qubit))
if init == 1:
self._nodes.append(GateNode(X_GATE, qubit))
return qubit
def Qubits(self, inits: Iterable[int]) -> List['QubitNode']:
return [self.Qubit(init) for init in inits]
def CBit(self) -> 'CBitNode':
cbit = CBitNode()
cbit.set_name(f'$$_cbit_{Program._cbit_counter}')
Program._cbit_counter += 1
self._nodes.append(cbit)
return cbit
def CBits(self, size: int) -> List['CBitNode']:
return [self.CBit() for i in range(size)]
class QubitNode(IASTNode):
def __init__(self, id_=-1) -> None:
super().__init__()
super().set_target_qubit_id(id_)
def set_name(self, name: str) -> None:
self._name = name
def get_name(self) -> str:
return self._name
def get_id(self) -> int:
return super().get_target_qubit_id()
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_qubit(self)
class QubitDeclarationNode(IASTNode):
def __init__(self, qubit: QubitNode) -> None:
self._qubit = qubit
def get_qubit(self) -> QubitNode:
return self._qubit
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_qubit_declaraion(self)
class CBitNode(IASTNode):
def __init__(self, target_bit_id=-1) -> None:
super().__init__()
self._target_bit_id = target_bit_id
def set_name(self, name: str) -> None:
self._name = name
def get_name(self) -> str:
return self._name
def set_id(self, target_bit_id: int) -> None:
self._target_bit_id = target_bit_id
def get_id(self) -> int:
return self._target_bit_id
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_cvar(self)
class InvNode(IASTNode):
def __init__(self, node: ProgramLike) -> None:
super().__init__()
self._body : Program = Program(node)
def get_body(self) -> Program:
return self._body
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_inv(self)
class ConditionNode(IASTNode):
pass
class IfASTNode(IASTNode):
def __init__(self, condition: ConditionNode, then_body: ProgramLike) -> None:
super().__init__()
self._condition = condition
self._then_body = Program(then_body)
def get_condition(self) -> ConditionNode:
return self._condition
def get_then_body(self) -> Program:
return self._then_body
class IfThenElseNode(IfASTNode):
def __init__(self, condition: ConditionNode, then_body: ProgramLike, else_body: ProgramLike) -> None:
super().__init__(condition, then_body)
self._else_body = Program(else_body)
def get_else_body(self) -> Program:
return self._else_body
def set_control_positive_qubit_ids(self, control_positive_qubit_ids: List[int]) -> None:
self._control_positive_qubit_ids = control_positive_qubit_ids
def get_control_positive_qubit_ids(self) -> List[int]:
return self._control_positive_qubit_ids
def _set_control_negative_qubit_ids(self, control_negative_qubit_ids: List[int]) -> None:
self._control_negative_qubit_ids = control_negative_qubit_ids
def get_control_negative_qubit_ids(self) -> List[int]:
return self._control_negative_qubit_ids
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_if_then_else(self)
class IfThenNode(IfASTNode):
def __init__(self, condition: ConditionNode, then_body: ProgramLike) -> None:
super().__init__(condition, then_body)
def Else(self, else_body: ProgramLike) -> IfThenElseNode:
return IfThenElseNode(self._condition, self._then_body, else_body)
def set_control_positive_qubit_ids(self, control_positive_qubit_ids: List[int]) -> None:
self._control_positive_qubit_ids = control_positive_qubit_ids
def get_control_positive_qubit_ids(self) -> List[int]:
return self._control_positive_qubit_ids
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_if_then(self)
class IfFlipNode(IASTNode):
def __init__(self, condition: ConditionNode) -> None:
super().__init__()
self._condition = condition
def get_condition(self) -> ConditionNode:
return self._condition
def set_control_positive_qubit_ids(self, control_positive_qubit_ids: List[int]) -> None:
self._control_positive_qubit_ids = control_positive_qubit_ids
def get_control_positive_qubit_ids(self) -> List[int]:
return self._control_positive_qubit_ids
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_if_flip(self)
class IfNode(IASTNode):
def __init__(self, condition: ConditionNode) -> None:
super().__init__()
self._condition = condition
def Then(self, then_body: ProgramLike) -> IfThenNode:
return IfThenNode(self._condition, then_body)
def Flip(self) -> IfFlipNode:
return IfFlipNode(self._condition)
def get_control_negative_qubit_ids(self) -> List[int]:
raise NotImplementedError()
def accept(self, visitor: 'IASTVisitor') -> None:
raise NotImplementedError()
class GateNode(IASTNode):
""" This node represents an application of a builtin gate on a specified qubit. """
def __init__(self, gate: BuiltinGate, qubit: QubitNode, params: List[float] = None) -> None:
super().__init__()
self._gate = gate
self._params = params or []
self._target_qubit = qubit
assert len(self.params) == gate.num_params
@property
def gate(self) -> BuiltinGate:
return self._gate
@property
def params(self) -> List[float]:
return self._params
def get_target_qubit(self) -> QubitNode:
return self._target_qubit
def get_target_qubit_id(self) -> int:
return self._target_qubit.get_target_qubit_id()
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_gate(self)
class MatchNode(ConditionNode):
def __init__(self, control_qubits: Union[QubitNode, List[QubitNode]], mask: List[int]) -> None:
super().__init__()
self._control_qubits = to_list(control_qubits)
self._mask = mask
self._control_positive_qubit_ids : List[int] = []
self._control_negative_qubit_ids : List[int] = []
if (len(self.get_control_qubits()) != len(self.get_mask())):
raise Exception(
'Inside MATCH statement: Var ' +
' should have the same size as a mask length'
)
def get_mask(self) -> List[int]:
return self._mask
def get_control_qubits(self) -> List[QubitNode]:
return self._control_qubits
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_match(self)
class NotNode(ConditionNode):
def __init__(self, condition: ConditionNode) -> None:
super().__init__()
self._condition = condition
def get_condition(self) -> ConditionNode:
return self._condition
def set_target_qubit_id(self, target_qubit_id: int):
self._condition.set_target_qubit_id(target_qubit_id)
def get_target_qubit_id(self) -> int:
return self._condition.get_target_qubit_id()
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_not(self)
class MeasurementNode(IASTNode):
def __init__(self, qubit: QubitNode, bit: CBitNode) -> None:
super().__init__()
self._qubit = qubit
self._bit = bit
def get_qubit(self) -> QubitNode:
return self._qubit
def get_bit(self) -> CBitNode:
return self._bit
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_measure(self)
class ResetNode(IASTNode):
def __init__(self, qubit: QubitNode) -> None:
super().__init__()
self._qubit = qubit
def get_qubit(self) -> QubitNode:
return self._qubit
def accept(self, visitor: 'IASTVisitor') -> None:
visitor.on_reset(self)
#
##
#
class IASTVisitor:
def on_program(self, program: Program) -> None:
for node in program._nodes:
node.accept(self)
def on_qubit_declaraion(self, declaration: QubitDeclarationNode) -> None:
pass
def on_qubit(self, qubit: QubitNode) -> None:
pass
def on_cvar(self, bit: CBitNode) -> None:
pass
def on_inv(self, inv: InvNode) -> None:
inv.get_body().accept(self)
def on_if_then_else(self, if_then_else: IfThenElseNode) -> None:
if_then_else.get_condition().accept(self)
if_then_else.get_then_body().accept(self)
if_then_else.get_else_body().accept(self)
def on_if_then(self, if_then) -> None:
if_then.get_condition().accept(self)
if_then.get_then_body().accept(self)
def on_if_flip(self, if_flip: IfFlipNode) -> None:
if_flip.get_condition().accept(self)
def on_gate(self, node: GateNode) -> None:
pass
def on_match(self, match: MatchNode) -> None:
pass
def on_not(self, not_: NotNode) -> None:
not_.get_condition().accept(self)
def on_measure(self, measure: MeasurementNode) -> None:
pass
def on_reset(self, reset: ResetNode) -> None:
pass