/dports/science/py-cirq-core/Cirq-0.13.1/cirq-core/cirq/ops/ |
H A D | pauli_string_phasor_test.py | 76 cirq.PauliStringPhasor(cirq.PauliString({a: cirq.X})), 103 s = cirq.PauliString({a: cirq.X}) 122 ps_before = cirq.PauliString({q0: cirq.X, q1: cirq.Y}, -1) 123 ps_after = cirq.PauliString({q0: cirq.Z, q1: cirq.Y}, -1) 158 i = cirq.PauliString({}) 218 op = cirq.PauliStringPhasor(cirq.PauliString({})) 308 pauli_string = cirq.PauliString( 333 ps = cirq.PauliString({q0: cirq.Y}) 339 ps = cirq.PauliString({q0: cirq.Y}, -1) 349 cirq.PauliStringPhasor(cirq.PauliString({q0: cirq.Z})), [all …]
|
H A D | pauli_string_test.py | 80 assert cirq.PauliString({}, +1).equal_up_to_coefficient(cirq.PauliString({}, +1)) 81 assert cirq.PauliString({}, -1).equal_up_to_coefficient(cirq.PauliString({}, -1)) 211 assert cirq.PauliString([op]) == cirq.PauliString({q0: pauli}) 226 assert cirq.PauliString([[[cirq.I(a)]]]) == cirq.PauliString() 228 assert cirq.PauliString(1, 2, 3, cirq.X(a), cirq.Y(a)) == cirq.PauliString( 232 assert cirq.PauliString(cirq.X(a), cirq.X(a)) == cirq.PauliString() 233 assert cirq.PauliString(cirq.X(a), cirq.X(b)) == cirq.PauliString( 237 assert cirq.PauliString(0) == cirq.PauliString(coefficient=0) 470 assert cirq.X(a) * cirq.PauliString({a: cirq.X}) == cirq.PauliString() 471 assert cirq.PauliString({a: cirq.X}) * cirq.X(a) == cirq.PauliString() [all …]
|
H A D | linear_combinations.py | 41 from cirq.ops.pauli_string import PauliString, _validate_qubit_mapping 402 def from_pauli_strings(cls, terms: Union[PauliString, List[PauliString]]) -> 'PauliSum': argument 403 if isinstance(terms, PauliString): 433 PauliString({}, 0.5), 445 pauli_sum = cls.from_pauli_strings(PauliString({}, 1.0)) 452 pauli_sum = cls.from_pauli_strings(PauliString({}, 0.0)) 634 elif isinstance(other, PauliString): 646 other = PauliString(other) 662 if isinstance(other, PauliString): 687 elif isinstance(other, PauliString): [all …]
|
H A D | pauli_string.py | 109 class PauliString(raw_types.Operation, Generic[TKey]): class 193 return PauliString 248 return PauliString( 273 return PauliString( 286 return PauliString( 350 return PauliString( 686 if not isinstance(other, PauliString): 706 return PauliString( 993 gate_operation.GateOperation, PauliString 1022 def _as_pauli_string(self) -> PauliString: [all …]
|
H A D | measure_util.py | 33 pauli_observable: pauli_string.PauliString, argument 50 if not isinstance(pauli_observable, pauli_string.PauliString): 60 pauli_basis: pauli_string.PauliString, key_func: Callable[[raw_types.Qid], str] = str argument 77 if not isinstance(pauli_basis, pauli_string.PauliString):
|
/dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/ops/ |
H A D | pauli_string_phasor_test.py | 76 cirq.PauliStringPhasor(cirq.PauliString({a: cirq.X})), 103 s = cirq.PauliString({a: cirq.X}) 122 ps_before = cirq.PauliString({q0: cirq.X, q1: cirq.Y}, -1) 123 ps_after = cirq.PauliString({q0: cirq.Z, q1: cirq.Y}, -1) 158 i = cirq.PauliString({}) 218 op = cirq.PauliStringPhasor(cirq.PauliString({})) 308 pauli_string = cirq.PauliString( 333 ps = cirq.PauliString({q0: cirq.Y}) 339 ps = cirq.PauliString({q0: cirq.Y}, -1) 349 cirq.PauliStringPhasor(cirq.PauliString({q0: cirq.Z})), [all …]
|
H A D | pauli_string_test.py | 80 assert cirq.PauliString({}, +1).equal_up_to_coefficient(cirq.PauliString({}, +1)) 81 assert cirq.PauliString({}, -1).equal_up_to_coefficient(cirq.PauliString({}, -1)) 211 assert cirq.PauliString([op]) == cirq.PauliString({q0: pauli}) 226 assert cirq.PauliString([[[cirq.I(a)]]]) == cirq.PauliString() 228 assert cirq.PauliString(1, 2, 3, cirq.X(a), cirq.Y(a)) == cirq.PauliString( 232 assert cirq.PauliString(cirq.X(a), cirq.X(a)) == cirq.PauliString() 233 assert cirq.PauliString(cirq.X(a), cirq.X(b)) == cirq.PauliString( 237 assert cirq.PauliString(0) == cirq.PauliString(coefficient=0) 470 assert cirq.X(a) * cirq.PauliString({a: cirq.X}) == cirq.PauliString() 471 assert cirq.PauliString({a: cirq.X}) * cirq.X(a) == cirq.PauliString() [all …]
|
H A D | linear_combinations.py | 39 from cirq.ops.pauli_string import PauliString, _validate_qubit_mapping 396 def from_pauli_strings(cls, terms: Union[PauliString, List[PauliString]]) -> 'PauliSum': argument 397 if isinstance(terms, PauliString): 425 PauliString({}, 0.5), 437 pauli_sum = cls.from_pauli_strings(PauliString({}, 1.0)) 444 pauli_sum = cls.from_pauli_strings(PauliString({}, 0.0)) 621 elif isinstance(other, PauliString): 633 other = PauliString(other) 649 if isinstance(other, PauliString): 674 elif isinstance(other, PauliString): [all …]
|
H A D | pauli_string.py | 109 class PauliString(raw_types.Operation, Generic[TKey]): class 190 return PauliString 245 return PauliString( 270 return PauliString( 283 return PauliString( 347 return PauliString( 677 if not isinstance(other, PauliString): 697 return PauliString( 978 gate_operation.GateOperation, PauliString 1007 def _as_pauli_string(self) -> PauliString: [all …]
|
/dports/science/py-cirq-pasqal/Cirq-0.13.1/cirq-core/cirq/ops/ |
H A D | pauli_string_phasor_test.py | 76 cirq.PauliStringPhasor(cirq.PauliString({a: cirq.X})), 103 s = cirq.PauliString({a: cirq.X}) 122 ps_before = cirq.PauliString({q0: cirq.X, q1: cirq.Y}, -1) 123 ps_after = cirq.PauliString({q0: cirq.Z, q1: cirq.Y}, -1) 158 i = cirq.PauliString({}) 218 op = cirq.PauliStringPhasor(cirq.PauliString({})) 308 pauli_string = cirq.PauliString( 333 ps = cirq.PauliString({q0: cirq.Y}) 339 ps = cirq.PauliString({q0: cirq.Y}, -1) 349 cirq.PauliStringPhasor(cirq.PauliString({q0: cirq.Z})), [all …]
|
H A D | pauli_string_test.py | 80 assert cirq.PauliString({}, +1).equal_up_to_coefficient(cirq.PauliString({}, +1)) 81 assert cirq.PauliString({}, -1).equal_up_to_coefficient(cirq.PauliString({}, -1)) 211 assert cirq.PauliString([op]) == cirq.PauliString({q0: pauli}) 226 assert cirq.PauliString([[[cirq.I(a)]]]) == cirq.PauliString() 228 assert cirq.PauliString(1, 2, 3, cirq.X(a), cirq.Y(a)) == cirq.PauliString( 232 assert cirq.PauliString(cirq.X(a), cirq.X(a)) == cirq.PauliString() 233 assert cirq.PauliString(cirq.X(a), cirq.X(b)) == cirq.PauliString( 237 assert cirq.PauliString(0) == cirq.PauliString(coefficient=0) 470 assert cirq.X(a) * cirq.PauliString({a: cirq.X}) == cirq.PauliString() 471 assert cirq.PauliString({a: cirq.X}) * cirq.X(a) == cirq.PauliString() [all …]
|
H A D | linear_combinations.py | 41 from cirq.ops.pauli_string import PauliString, _validate_qubit_mapping 402 def from_pauli_strings(cls, terms: Union[PauliString, List[PauliString]]) -> 'PauliSum': argument 403 if isinstance(terms, PauliString): 433 PauliString({}, 0.5), 445 pauli_sum = cls.from_pauli_strings(PauliString({}, 1.0)) 452 pauli_sum = cls.from_pauli_strings(PauliString({}, 0.0)) 634 elif isinstance(other, PauliString): 646 other = PauliString(other) 662 if isinstance(other, PauliString): 687 elif isinstance(other, PauliString): [all …]
|
H A D | pauli_string.py | 109 class PauliString(raw_types.Operation, Generic[TKey]): class 193 return PauliString 248 return PauliString( 273 return PauliString( 286 return PauliString( 350 return PauliString( 686 if not isinstance(other, PauliString): 706 return PauliString( 993 gate_operation.GateOperation, PauliString 1022 def _as_pauli_string(self) -> PauliString: [all …]
|
H A D | measure_util.py | 33 pauli_observable: pauli_string.PauliString, argument 50 if not isinstance(pauli_observable, pauli_string.PauliString): 60 pauli_basis: pauli_string.PauliString, key_func: Callable[[raw_types.Qid], str] = str argument 77 if not isinstance(pauli_basis, pauli_string.PauliString):
|
/dports/science/py-cirq-google/Cirq-0.13.0/cirq-core/cirq/ops/ |
H A D | pauli_string_phasor_test.py | 76 cirq.PauliStringPhasor(cirq.PauliString({a: cirq.X})), 103 s = cirq.PauliString({a: cirq.X}) 122 ps_before = cirq.PauliString({q0: cirq.X, q1: cirq.Y}, -1) 123 ps_after = cirq.PauliString({q0: cirq.Z, q1: cirq.Y}, -1) 158 i = cirq.PauliString({}) 218 op = cirq.PauliStringPhasor(cirq.PauliString({})) 308 pauli_string = cirq.PauliString( 333 ps = cirq.PauliString({q0: cirq.Y}) 339 ps = cirq.PauliString({q0: cirq.Y}, -1) 349 cirq.PauliStringPhasor(cirq.PauliString({q0: cirq.Z})), [all …]
|
H A D | pauli_string_test.py | 80 assert cirq.PauliString({}, +1).equal_up_to_coefficient(cirq.PauliString({}, +1)) 81 assert cirq.PauliString({}, -1).equal_up_to_coefficient(cirq.PauliString({}, -1)) 211 assert cirq.PauliString([op]) == cirq.PauliString({q0: pauli}) 226 assert cirq.PauliString([[[cirq.I(a)]]]) == cirq.PauliString() 228 assert cirq.PauliString(1, 2, 3, cirq.X(a), cirq.Y(a)) == cirq.PauliString( 232 assert cirq.PauliString(cirq.X(a), cirq.X(a)) == cirq.PauliString() 233 assert cirq.PauliString(cirq.X(a), cirq.X(b)) == cirq.PauliString( 237 assert cirq.PauliString(0) == cirq.PauliString(coefficient=0) 470 assert cirq.X(a) * cirq.PauliString({a: cirq.X}) == cirq.PauliString() 471 assert cirq.PauliString({a: cirq.X}) * cirq.X(a) == cirq.PauliString() [all …]
|
H A D | linear_combinations.py | 41 from cirq.ops.pauli_string import PauliString, _validate_qubit_mapping 402 def from_pauli_strings(cls, terms: Union[PauliString, List[PauliString]]) -> 'PauliSum': argument 403 if isinstance(terms, PauliString): 433 PauliString({}, 0.5), 445 pauli_sum = cls.from_pauli_strings(PauliString({}, 1.0)) 452 pauli_sum = cls.from_pauli_strings(PauliString({}, 0.0)) 634 elif isinstance(other, PauliString): 646 other = PauliString(other) 662 if isinstance(other, PauliString): 687 elif isinstance(other, PauliString): [all …]
|
H A D | pauli_string.py | 109 class PauliString(raw_types.Operation, Generic[TKey]): class 193 return PauliString 248 return PauliString( 273 return PauliString( 286 return PauliString( 350 return PauliString( 686 if not isinstance(other, PauliString): 706 return PauliString( 993 gate_operation.GateOperation, PauliString 1022 def _as_pauli_string(self) -> PauliString: [all …]
|
H A D | measure_util.py | 33 pauli_observable: pauli_string.PauliString, argument 50 if not isinstance(pauli_observable, pauli_string.PauliString): 60 pauli_basis: pauli_string.PauliString, key_func: Callable[[raw_types.Qid], str] = str argument 77 if not isinstance(pauli_basis, pauli_string.PauliString):
|
/dports/science/py-cirq-ionq/Cirq-0.13.1/cirq-core/cirq/ops/ |
H A D | pauli_string_phasor_test.py | 76 cirq.PauliStringPhasor(cirq.PauliString({a: cirq.X})), 103 s = cirq.PauliString({a: cirq.X}) 122 ps_before = cirq.PauliString({q0: cirq.X, q1: cirq.Y}, -1) 123 ps_after = cirq.PauliString({q0: cirq.Z, q1: cirq.Y}, -1) 158 i = cirq.PauliString({}) 218 op = cirq.PauliStringPhasor(cirq.PauliString({})) 308 pauli_string = cirq.PauliString( 333 ps = cirq.PauliString({q0: cirq.Y}) 339 ps = cirq.PauliString({q0: cirq.Y}, -1) 349 cirq.PauliStringPhasor(cirq.PauliString({q0: cirq.Z})), [all …]
|
H A D | pauli_string_test.py | 80 assert cirq.PauliString({}, +1).equal_up_to_coefficient(cirq.PauliString({}, +1)) 81 assert cirq.PauliString({}, -1).equal_up_to_coefficient(cirq.PauliString({}, -1)) 211 assert cirq.PauliString([op]) == cirq.PauliString({q0: pauli}) 226 assert cirq.PauliString([[[cirq.I(a)]]]) == cirq.PauliString() 228 assert cirq.PauliString(1, 2, 3, cirq.X(a), cirq.Y(a)) == cirq.PauliString( 232 assert cirq.PauliString(cirq.X(a), cirq.X(a)) == cirq.PauliString() 233 assert cirq.PauliString(cirq.X(a), cirq.X(b)) == cirq.PauliString( 237 assert cirq.PauliString(0) == cirq.PauliString(coefficient=0) 470 assert cirq.X(a) * cirq.PauliString({a: cirq.X}) == cirq.PauliString() 471 assert cirq.PauliString({a: cirq.X}) * cirq.X(a) == cirq.PauliString() [all …]
|
H A D | linear_combinations.py | 41 from cirq.ops.pauli_string import PauliString, _validate_qubit_mapping 402 def from_pauli_strings(cls, terms: Union[PauliString, List[PauliString]]) -> 'PauliSum': argument 403 if isinstance(terms, PauliString): 433 PauliString({}, 0.5), 445 pauli_sum = cls.from_pauli_strings(PauliString({}, 1.0)) 452 pauli_sum = cls.from_pauli_strings(PauliString({}, 0.0)) 634 elif isinstance(other, PauliString): 646 other = PauliString(other) 662 if isinstance(other, PauliString): 687 elif isinstance(other, PauliString): [all …]
|
H A D | pauli_string.py | 109 class PauliString(raw_types.Operation, Generic[TKey]): class 193 return PauliString 248 return PauliString( 273 return PauliString( 286 return PauliString( 350 return PauliString( 686 if not isinstance(other, PauliString): 706 return PauliString( 993 gate_operation.GateOperation, PauliString 1022 def _as_pauli_string(self) -> PauliString: [all …]
|
H A D | measure_util.py | 33 pauli_observable: pauli_string.PauliString, argument 50 if not isinstance(pauli_observable, pauli_string.PauliString): 60 pauli_basis: pauli_string.PauliString, key_func: Callable[[raw_types.Qid], str] = str argument 77 if not isinstance(pauli_basis, pauli_string.PauliString):
|
/dports/science/py-cirq-aqt/Cirq-0.12.0/cirq-core/cirq/work/ |
H A D | observable_settings.py | 39 observable: ops.PauliString 63 def _max_weight_observable(observables: Iterable[ops.PauliString]) -> Union[None, ops.PauliString]: argument 87 return ops.PauliString(qubit_pauli_map)
|