|
| 1 | +# Copyright 2018 The Cirq Developers |
| 2 | +# |
| 3 | +# Licensed under the Apache License, Version 2.0 (the "License"); |
| 4 | +# you may not use this file except in compliance with the License. |
| 5 | +# You may obtain a copy of the License at |
| 6 | +# |
| 7 | +# https://www.apache.org/licenses/LICENSE-2.0 |
| 8 | +# |
| 9 | +# Unless required by applicable law or agreed to in writing, software |
| 10 | +# distributed under the License is distributed on an "AS IS" BASIS, |
| 11 | +# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| 12 | +# See the License for the specific language governing permissions and |
| 13 | +# limitations under the License. |
| 14 | +from typing import Collection, cast, Optional, Sequence, Union |
| 15 | + |
| 16 | +import copy |
| 17 | +import itertools |
| 18 | + |
| 19 | + |
| 20 | +def flatten(sequence): |
| 21 | + def _flatten_aux(sequence): |
| 22 | + if isinstance(sequence, int): |
| 23 | + yield sequence |
| 24 | + else: |
| 25 | + for item in sequence: |
| 26 | + yield from _flatten_aux(item) |
| 27 | + |
| 28 | + return tuple(_flatten_aux(sequence)) |
| 29 | + |
| 30 | + |
| 31 | +class ControlValues: |
| 32 | + def __init__(self, control_values: Sequence[Union[int, Collection[int], 'ControlValues']]): |
| 33 | + if len(control_values) == 0: |
| 34 | + self.nxt = None |
| 35 | + self.vals = None |
| 36 | + self.num_variables = 0 |
| 37 | + self.itr = None |
| 38 | + return |
| 39 | + self.itr = None |
| 40 | + self.nxt = None |
| 41 | + self.vals = control_values[0] |
| 42 | + self.num_variables = 0 |
| 43 | + |
| 44 | + if len(control_values) > 1: |
| 45 | + self.nxt = ControlValues(control_values[1:]) |
| 46 | + |
| 47 | + if isinstance(self.vals, int): |
| 48 | + self.vals = ((self.vals,),) |
| 49 | + |
| 50 | + if isinstance(self.vals[0], int): |
| 51 | + self.vals = tuple(tuple(val) for val in self.vals) |
| 52 | + |
| 53 | + if isinstance(control_values[0], ControlValues): |
| 54 | + aux = control_values[0].copy().And(self.nxt) |
| 55 | + self.vals, self.num_variables, self.nxt = aux.vals, aux.num_variables, aux.nxt |
| 56 | + else: |
| 57 | + self.vals = cast(Tuple[Tuple[int, ...], ...], self.vals) |
| 58 | + self.num_variables = len(self.vals[0]) |
| 59 | + |
| 60 | + def And(self, other): # pylint: disable=invalid-name |
| 61 | + # Cartesian product of all combinations in self x other |
| 62 | + if other is None: |
| 63 | + return |
| 64 | + if not isinstance(other, ControlValues): |
| 65 | + raise ValueError |
| 66 | + other = other.copy() |
| 67 | + cur = self |
| 68 | + while cur.nxt: |
| 69 | + cur = cur.nxt |
| 70 | + cur.nxt = other |
| 71 | + |
| 72 | + def __call__(self): |
| 73 | + return self.__iter__() |
| 74 | + |
| 75 | + def __iter__(self): |
| 76 | + nxt = self.nxt if self.nxt else lambda: [()] |
| 77 | + if self.num_variables: |
| 78 | + self.itr = itertools.product(self.vals, nxt()) |
| 79 | + else: |
| 80 | + self.itr = itertools.product(*()) |
| 81 | + return self.itr |
| 82 | + |
| 83 | + def __next__(self): |
| 84 | + for val in self.itr: |
| 85 | + yield val |
| 86 | + |
| 87 | + def copy(self): |
| 88 | + new_copy = ControlValues( |
| 89 | + [ |
| 90 | + copy.deepcopy(self.vals), |
| 91 | + ] |
| 92 | + ) |
| 93 | + new_copy.nxt = None |
| 94 | + if self.nxt: |
| 95 | + new_copy.nxt = self.nxt.copy() |
| 96 | + return new_copy |
| 97 | + |
| 98 | + def __len__(self): |
| 99 | + cur = self |
| 100 | + num_variables = 0 |
| 101 | + while cur is not None: |
| 102 | + num_variables += cur.num_variables |
| 103 | + cur = cur.nxt |
| 104 | + return num_variables |
| 105 | + |
| 106 | + def __getitem__(self, key): |
| 107 | + if isinstance(key, slice): |
| 108 | + if key != slice(None, -1, None): |
| 109 | + raise TypeError('Unsupported slicing') |
| 110 | + return self.copy().pop() |
| 111 | + key = int(key) |
| 112 | + num_variables = len(self) |
| 113 | + if not 0 <= key < num_variables: |
| 114 | + key = key % num_variables |
| 115 | + if key < 0: |
| 116 | + key += num_variables |
| 117 | + cur = self |
| 118 | + while cur.num_variables <= key: |
| 119 | + key -= cur.num_variables |
| 120 | + cur = cur.nxt |
| 121 | + return cur |
| 122 | + |
| 123 | + def __eq__(self, other): |
| 124 | + if other is None: |
| 125 | + return False |
| 126 | + if not isinstance(other, ControlValues): |
| 127 | + return self == ControlValues(other) |
| 128 | + self_values = set(flatten(A) for A in self) |
| 129 | + other_values = set(flatten(B) for B in other) |
| 130 | + return self_values == other_values |
| 131 | + |
| 132 | + def identifier(self, companions: Sequence[Union[int, 'cirq.Qid']]): |
| 133 | + companions = tuple(companions) |
| 134 | + controls = [] |
| 135 | + cur = self |
| 136 | + while cur is not None: |
| 137 | + controls.append((cur.vals, companions[: cur.num_variables])) |
| 138 | + companions = companions[cur.num_variables :] |
| 139 | + cur = cur.nxt |
| 140 | + return tuple(controls) |
| 141 | + |
| 142 | + def check_dimentionality( |
| 143 | + self, |
| 144 | + qid_shape: Optional[Sequence[int]] = None, |
| 145 | + controls: Optional[Sequence['cirq.Qid']] = None, |
| 146 | + offset=0, |
| 147 | + ): |
| 148 | + if self.num_variables == 0: |
| 149 | + return |
| 150 | + if qid_shape is None or len(qid_shape) == 0: |
| 151 | + qid_shape = [q.dimension for q in controls[: self.num_variables]] |
| 152 | + for product in self.vals: |
| 153 | + product = flatten(product) |
| 154 | + for i in range(self.num_variables): |
| 155 | + if not 0 <= product[i] < qid_shape[i]: |
| 156 | + message = ( |
| 157 | + 'Control values <{!r}> outside of range ' 'for control qubit number <{!r}>.' |
| 158 | + ).format(product[i], i + offset) |
| 159 | + if controls is not None: |
| 160 | + message = ( |
| 161 | + 'Control values <{product[i]!r}> outside of range' |
| 162 | + ' for qubit <{controls[i]!r}>.' |
| 163 | + ) |
| 164 | + raise ValueError(message) |
| 165 | + |
| 166 | + if self.nxt is not None: |
| 167 | + self.nxt.check_dimentionality( |
| 168 | + qid_shape=qid_shape[self.num_variables :], |
| 169 | + controls=controls[self.num_variables :] if controls else None, |
| 170 | + offset=offset + self.num_variables, |
| 171 | + ) |
| 172 | + |
| 173 | + def are_same_value(self, value: int = 1): |
| 174 | + for product in self.vals: |
| 175 | + product = flatten(product) |
| 176 | + if not all(v == value for v in product): |
| 177 | + return False |
| 178 | + if self.nxt is not None: |
| 179 | + return self.nxt.are_same_value(value) |
| 180 | + return True |
| 181 | + |
| 182 | + def arrangements(self): |
| 183 | + _arrangements = [] |
| 184 | + cur = self |
| 185 | + while cur is not None: |
| 186 | + if cur.num_variables == 1: |
| 187 | + _arrangements.append(flatten(cur.vals)) |
| 188 | + else: |
| 189 | + _arrangements.append(flatten(product) for product in cur.vals) |
| 190 | + cur = cur.nxt |
| 191 | + return _arrangements |
| 192 | + |
| 193 | + def pop(self): |
| 194 | + if self.nxt is None: |
| 195 | + return None |
| 196 | + cur = self |
| 197 | + while cur.nxt.nxt is not None: |
| 198 | + cur = cur.nxt |
| 199 | + cur.nxt = None |
| 200 | + return self |
| 201 | + |
| 202 | + |
| 203 | +class FreeVars(ControlValues): |
| 204 | + pass |
| 205 | + |
| 206 | + |
| 207 | +class ConstrainedVars(ControlValues): |
| 208 | + def __init__(self, control_values): |
| 209 | + sum_of_product = (tuple(zip(*control_values)),) |
| 210 | + super().__init__(sum_of_product) |
0 commit comments