cirq-core 1.7.0.dev20250825174419__py3-none-any.whl → 1.7.0.dev20251203004401__py3-none-any.whl

cirq/experiments/z_phase_calibration_test.py

@@ -14,6 +14,9 @@
 
 from __future__ import annotations
 
+import multiprocessing
+from collections.abc import Iterator
+
 import numpy as np
 import pandas as pd
 import pytest
@@ -31,6 +34,15 @@ _ANGLES = ['theta', 'phi', 'chi', 'zeta', 'gamma']
 # fix random generator seed to ensure reproducibility and faster convergence
 _SEED = 276154030
 
+_POOL_NUM_PROCESSES = min(4, multiprocessing.cpu_count())
+
+
+@pytest.fixture
+def pool() -> Iterator[multiprocessing.pool.Pool]:
+    ctx = multiprocessing.get_context()
+    with ctx.Pool(_POOL_NUM_PROCESSES) as pool:
+        yield pool
+
 
 def _create_tests(n, with_options: bool = False):
     rng = np.random.default_rng(_SEED)
@@ -88,7 +100,7 @@ class _TestSimulator(cirq.Simulator):
 @pytest.mark.parametrize(
     ['angles', 'error', 'characterization_flags'], _create_tests(n=10, with_options=True)
 )
-def test_calibrate_z_phases(angles, error, characterization_flags) -> None:
+def test_calibrate_z_phases(pool, angles, error, characterization_flags) -> None:
 
     original_gate = cirq.PhasedFSimGate(**{k: v for k, v in zip(_ANGLES, angles)})
     actual_gate = cirq.PhasedFSimGate(**{k: v + e for k, v, e in zip(_ANGLES, angles, error)})
@@ -109,6 +121,7 @@ def test_calibrate_z_phases(angles, error, characterization_flags) -> None:
         n_circuits=10,
         cycle_depths=range(3, 10),
         random_state=_SEED,
+        num_workers_or_pool=pool,
     )[qubits]
 
     initial_unitary = cirq.unitary(original_gate)
@@ -127,7 +140,7 @@ def test_calibrate_z_phases(angles, error, characterization_flags) -> None:
 
 
 @pytest.mark.parametrize(['angles', 'error'], _create_tests(n=3))
-def test_calibrate_z_phases_no_options(angles, error) -> None:
+def test_calibrate_z_phases_no_options(pool, angles, error) -> None:
 
     original_gate = cirq.PhasedFSimGate(**{k: v for k, v in zip(_ANGLES, angles)})
     actual_gate = cirq.PhasedFSimGate(**{k: v + e for k, v, e in zip(_ANGLES, angles, error)})
@@ -144,6 +157,7 @@ def test_calibrate_z_phases_no_options(angles, error) -> None:
         n_circuits=10,
         cycle_depths=range(3, 10),
         random_state=_SEED,
+        num_workers_or_pool=pool,
     )[qubits]
 
     initial_unitary = cirq.unitary(original_gate)
@@ -162,7 +176,7 @@ def test_calibrate_z_phases_no_options(angles, error) -> None:
 
 
 @pytest.mark.parametrize(['angles', 'error'], _create_tests(n=3))
-def test_calibrate_z_phases_workflow_no_options(angles, error) -> None:
+def test_calibrate_z_phases_workflow_no_options(pool, angles, error) -> None:
 
     original_gate = cirq.PhasedFSimGate(**{k: v for k, v in zip(_ANGLES, angles)})
     actual_gate = cirq.PhasedFSimGate(**{k: v + e for k, v, e in zip(_ANGLES, angles, error)})
@@ -179,6 +193,7 @@ def test_calibrate_z_phases_workflow_no_options(angles, error) -> None:
         n_circuits=1,
         cycle_depths=(1, 2),
         random_state=_SEED,
+        num_workers_or_pool=pool,
     )
 
     for params in result.final_params.values():

cirq/interop/quirk/cells/__init__.py

@@ -36,5 +36,4 @@ from cirq.interop.quirk.cells.input_rotation_cells import (
     QuirkInputRotationOperation as QuirkInputRotationOperation,
 )
 
-import cirq.interop.quirk.cells.swap_cell
-import cirq.interop.quirk.cells.control_cells  # noqa: F401
+from cirq.interop.quirk.cells import control_cells as control_cells, swap_cell as swap_cell

cirq/interop/quirk/cells/all_cells.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import Iterator, TYPE_CHECKING
+from collections.abc import Iterator
+from typing import TYPE_CHECKING
 
 from cirq.interop.quirk.cells.arithmetic_cells import generate_all_arithmetic_cell_makers
 from cirq.interop.quirk.cells.control_cells import generate_all_control_cell_makers

cirq/interop/quirk/cells/arithmetic_cells.py

@@ -15,7 +15,8 @@
 from __future__ import annotations
 
 import inspect
-from typing import Any, Callable, cast, Iterable, Iterator, Sequence, TYPE_CHECKING
+from collections.abc import Callable, Iterable, Iterator, Sequence
+from typing import Any, cast, TYPE_CHECKING
 
 from cirq import ops, value
 from cirq.interop.quirk.cells.cell import Cell, CELL_SIZES, CellMaker

cirq/interop/quirk/cells/cell.py

@@ -15,7 +15,8 @@
 from __future__ import annotations
 
 import abc
-from typing import Any, Callable, Iterable, NamedTuple, Sequence, TYPE_CHECKING, Union
+from collections.abc import Callable, Iterable, Sequence
+from typing import Any, NamedTuple, TYPE_CHECKING, Union
 
 from cirq import devices, ops, value
 

cirq/interop/quirk/cells/composite_cell.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import Callable, cast, Iterable, Iterator, Sequence, TYPE_CHECKING, TypeVar
+from collections.abc import Callable, Iterable, Iterator, Sequence
+from typing import cast, TYPE_CHECKING, TypeVar
 
 from cirq import circuits
 from cirq.interop.quirk.cells.cell import Cell

cirq/interop/quirk/cells/composite_cell_test.py

@@ -14,7 +14,7 @@
 
 from __future__ import annotations
 
-from typing import Iterable
+from collections.abc import Iterable
 
 import pytest
 

cirq/interop/quirk/cells/control_cells.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import Any, Iterable, Iterator, TYPE_CHECKING
+from collections.abc import Iterable, Iterator
+from typing import Any, TYPE_CHECKING
 
 from cirq import ops, value
 from cirq.interop.quirk.cells.cell import Cell, CellMaker

cirq/interop/quirk/cells/frequency_space_cells.py

@@ -14,7 +14,7 @@
 
 from __future__ import annotations
 
-from typing import Callable, Iterator
+from collections.abc import Callable, Iterator
 
 import sympy
 

cirq/interop/quirk/cells/ignored_cells.py

@@ -14,7 +14,7 @@
 
 from __future__ import annotations
 
-from typing import Iterator
+from collections.abc import Iterator
 
 from cirq.interop.quirk.cells.cell import CELL_SIZES, CellMaker
 

cirq/interop/quirk/cells/input_cells.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import Callable, Iterable, Iterator, TYPE_CHECKING
+from collections.abc import Callable, Iterable, Iterator
+from typing import TYPE_CHECKING
 
 from cirq.interop.quirk.cells.cell import Cell, CELL_SIZES, CellMaker
 

cirq/interop/quirk/cells/input_rotation_cells.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import Any, Iterable, Iterator, Sequence
+from collections.abc import Iterable, Iterator, Sequence
+from typing import Any
 
 import numpy as np
 

cirq/interop/quirk/cells/measurement_cells.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import cast, Iterable, Iterator, TYPE_CHECKING
+from collections.abc import Iterable, Iterator
+from typing import cast, TYPE_CHECKING
 
 from cirq import ops
 from cirq.interop.quirk.cells.cell import CellMaker, ExplicitOperationsCell

cirq/interop/quirk/cells/parse.py

@@ -16,17 +16,8 @@ from __future__ import annotations
 
 import cmath
 import re
-from typing import (
-    Any,
-    Callable,
-    cast,
-    Iterable,
-    Iterator,
-    Mapping,
-    SupportsFloat,
-    TypeAlias,
-    TypeVar,
-)
+from collections.abc import Callable, Iterable, Iterator, Mapping
+from typing import Any, cast, SupportsFloat, TypeAlias, TypeVar
 
 import numpy as np
 import sympy

cirq/interop/quirk/cells/qubit_permutation_cells.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import Callable, Iterator, Sequence, TYPE_CHECKING
+from collections.abc import Callable, Iterator, Sequence
+from typing import TYPE_CHECKING
 
 from cirq import ops, value
 from cirq.interop.quirk.cells.cell import CELL_SIZES, CellMaker

cirq/interop/quirk/cells/scalar_cells.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import Iterator, TYPE_CHECKING
+from collections.abc import Iterator
+from typing import TYPE_CHECKING
 
 from cirq import ops
 from cirq.interop.quirk.cells.cell import CellMaker

cirq/interop/quirk/cells/single_qubit_rotation_cells.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import Callable, Iterator, TYPE_CHECKING
+from collections.abc import Callable, Iterator
+from typing import TYPE_CHECKING
 
 import sympy
 

cirq/interop/quirk/cells/swap_cell.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import Any, Iterable, Iterator, TYPE_CHECKING
+from collections.abc import Iterable, Iterator
+from typing import Any, TYPE_CHECKING
 
 from cirq import ops, value
 from cirq.interop.quirk.cells.cell import Cell, CellMaker

cirq/interop/quirk/cells/unsupported_cells.py

@@ -14,7 +14,7 @@
 
 from __future__ import annotations
 
-from typing import Iterator
+from collections.abc import Iterator
 
 from cirq.interop.quirk.cells.cell import CELL_SIZES, CellMaker
 

cirq/interop/quirk/url_to_circuit.py

@@ -16,7 +16,8 @@ from __future__ import annotations
 
 import json
 import urllib.parse
-from typing import Any, cast, Iterable, Mapping, Sequence, TYPE_CHECKING
+from collections.abc import Iterable, Mapping, Sequence
+from typing import Any, cast, TYPE_CHECKING
 
 import numpy as np
 

cirq/json_resolver_cache.py

@@ -21,8 +21,6 @@ from typing import NamedTuple, TYPE_CHECKING
 
 if TYPE_CHECKING:
     import cirq
-    import cirq.devices.unconstrained_device
-    import cirq.ops.pauli_gates
     from cirq.protocols.json_serialization import ObjectFactory
 
 

cirq/linalg/decompositions.py

@@ -18,7 +18,8 @@ from __future__ import annotations
 
 import cmath
 import math
-from typing import Any, Callable, cast, Iterable, TYPE_CHECKING, TypeVar
+from collections.abc import Callable, Iterable
+from typing import Any, cast, TYPE_CHECKING, TypeVar
 
 import matplotlib.pyplot as plt
 import numpy as np
@@ -243,7 +244,7 @@ def so4_to_magic_su2s(
 
 @value.value_equality(approximate=True)
 class AxisAngleDecomposition:
-    """Represents a unitary operation as an axis, angle, and global phase.
+    r"""Represents a unitary operation as an axis, angle, and global phase.
 
     The unitary $U$ is decomposed as follows:
 
@@ -472,6 +473,9 @@ class KakDecomposition:
             f'    global_phase={self.global_phase!r})'
         )
 
+    def _has_unitary_(self) -> bool:
+        return True
+
     def _unitary_(self) -> np.ndarray:
         """Returns the decomposition's two-qubit unitary matrix.
 

cirq/linalg/decompositions_test.py

@@ -259,6 +259,7 @@ def test_kak_plot_empty() -> None:
 )
 def test_kak_decomposition(target) -> None:
     kak = cirq.kak_decomposition(target)
+    assert cirq.has_unitary(kak)
     np.testing.assert_allclose(cirq.unitary(kak), target, atol=1e-8)
 
 

cirq/linalg/diagonalize.py

@@ -16,7 +16,7 @@
 
 from __future__ import annotations
 
-from typing import Callable
+from collections.abc import Callable
 
 import numpy as np
 

cirq/linalg/predicates.py

@@ -16,8 +16,9 @@
 
 from __future__ import annotations
 
+from collections.abc import Sequence
 from types import EllipsisType
-from typing import cast, Sequence
+from typing import cast
 
 import numpy as np
 

cirq/linalg/tolerance.py

@@ -17,7 +17,8 @@ tolerances."""
 
 from __future__ import annotations
 
-from typing import Iterable, TYPE_CHECKING
+from collections.abc import Iterable
+from typing import TYPE_CHECKING
 
 import numpy as np
 

cirq/linalg/transformations.py

@@ -18,8 +18,9 @@ from __future__ import annotations
 
 import dataclasses
 import functools
+from collections.abc import Sequence
 from types import EllipsisType
-from typing import Any, Sequence
+from typing import Any
 
 import numpy as np
 
@@ -82,7 +83,7 @@ def match_global_phase(a: np.ndarray, b: np.ndarray) -> tuple[np.ndarray, np.nda
         return np.copy(a), np.copy(b)
 
     # Find the entry with the largest magnitude in one of the matrices.
-    k = max(np.ndindex(*a.shape), key=lambda t: abs(b[t]))
+    k = max(np.ndindex(*a.shape), key=lambda t: abs(b[t].item()))
 
     def dephase(v):
         r = np.real(v)

cirq/ops/arithmetic_operation.py

@@ -17,7 +17,8 @@ from __future__ import annotations
 
 import abc
 import itertools
-from typing import cast, Iterable, Self, Sequence, TYPE_CHECKING
+from collections.abc import Iterable, Sequence
+from typing import cast, Self, TYPE_CHECKING
 
 import numpy as np
 
@@ -130,9 +131,9 @@ class ArithmeticGate(Gate, metaclass=abc.ABCMeta):
         1. The `apply` method is permitted to return values that have more bits
             than the registers they will be stored into. The extra bits are
             simply dropped. For example, if the value 5 is returned for a 2
-            qubit register then 5 % 2**2 = 1 will be used instead. Negative
+            qubit register then ``5 % 2**2 = 1`` will be used instead. Negative
             values are also permitted. For example, for a 3 qubit register the
-            value -2 becomes -2 % 2**3 = 6.
+            value -2 becomes ``-2 % 2**3 = 6``.
         2. When the value of the last `k` registers is not changed by the
             gate, the `apply` method is permitted to omit these values
             from the result. That is to say, when the length of the output is

cirq/ops/arithmetic_operation_test.py

@@ -14,7 +14,7 @@
 
 from __future__ import annotations
 
-from typing import Sequence
+from collections.abc import Sequence
 
 import numpy as np
 import pytest

cirq/ops/boolean_hamiltonian.py

@@ -27,7 +27,8 @@ from __future__ import annotations
 
 import functools
 import itertools
-from typing import Any, Generator, Sequence
+from collections.abc import Generator, Sequence
+from typing import Any
 
 import sympy.parsing.sympy_parser as sympy_parser
 
@@ -334,8 +335,8 @@ def _get_gates_from_hamiltonians(
 
         cnots = _simplify_cnots(cnots)
 
-        for gate in (cirq.CNOT(qubits[c], qubits[t]) for c, t in cnots):
-            yield gate
+        for c, t in cnots:
+            yield cirq.CNOT(qubits[c], qubits[t])
 
     sorted_hamiltonian_keys = sorted(
         hamiltonians.keys(), key=functools.cmp_to_key(_gray_code_comparator)

cirq/ops/classically_controlled_operation.py

@@ -14,7 +14,8 @@
 
 from __future__ import annotations
 
-from typing import AbstractSet, Any, cast, Mapping, Sequence, TYPE_CHECKING
+from collections.abc import Mapping, Sequence, Set
+from typing import Any, TYPE_CHECKING
 
 import sympy
 
@@ -150,7 +151,7 @@ class ClassicallyControlledOperation(raw_types.Operation):
     def _is_parameterized_(self) -> bool:
         return protocols.is_parameterized(self._sub_operation)
 
-    def _parameter_names_(self) -> AbstractSet[str]:
+    def _parameter_names_(self) -> Set[str]:
         return protocols.parameter_names(self._sub_operation)
 
     def _resolve_parameters_(
@@ -207,17 +208,13 @@ class ClassicallyControlledOperation(raw_types.Operation):
         conditions = [protocols.with_measurement_key_mapping(c, key_map) for c in self._conditions]
         sub_operation = protocols.with_measurement_key_mapping(self._sub_operation, key_map)
         sub_operation = self._sub_operation if sub_operation is NotImplemented else sub_operation
-        return cast(
-            ClassicallyControlledOperation, sub_operation.with_classical_controls(*conditions)
-        )
+        return sub_operation.with_classical_controls(*conditions)
 
     def _with_key_path_prefix_(self, prefix: tuple[str, ...]) -> ClassicallyControlledOperation:
         conditions = [protocols.with_key_path_prefix(c, prefix) for c in self._conditions]
         sub_operation = protocols.with_key_path_prefix(self._sub_operation, prefix)
         sub_operation = self._sub_operation if sub_operation is NotImplemented else sub_operation
-        return cast(
-            ClassicallyControlledOperation, sub_operation.with_classical_controls(*conditions)
-        )
+        return sub_operation.with_classical_controls(*conditions)
 
     def _with_rescoped_keys_(
         self, path: tuple[str, ...], bindable_keys: frozenset[cirq.MeasurementKey]
@@ -234,9 +231,12 @@ class ClassicallyControlledOperation(raw_types.Operation):
 
     def _qasm_(self, args: cirq.QasmArgs) -> str | None:
         args.validate_version('2.0', '3.0')
-        if len(self._conditions) > 1:
-            raise ValueError('QASM does not support multiple conditions.')
+        if args.version == "2.0" and len(self._conditions) > 1:
+            raise ValueError(
+                'QASM 2.0 does not support multiple conditions. Consider exporting with QASM 3.0.'
+            )
         subop_qasm = protocols.qasm(self._sub_operation, args=args)
         if not self._conditions:
             return subop_qasm
-        return f'if ({protocols.qasm(self._conditions[0], args=args)}) {subop_qasm}'
+        condition_qasm = " && ".join(protocols.qasm(c, args=args) for c in self._conditions)
+        return f'if ({condition_qasm}) {subop_qasm}'

cirq/ops/classically_controlled_operation_test.py

@@ -281,8 +281,32 @@ def test_qasm_multiple_conditions() -> None:
             sympy.Eq(sympy.Symbol('a'), 0), sympy.Eq(sympy.Symbol('b'), 0)
         ),
     )
-    with pytest.raises(ValueError, match='QASM does not support multiple conditions'):
-        _ = cirq.qasm(circuit)
+    with pytest.raises(
+        ValueError,
+        match='QASM 2.0 does not support multiple conditions. Consider exporting with QASM 3.0.',
+    ):
+        _ = cirq.qasm(circuit, args=cirq.QasmArgs(version='2.0'))
+
+    qasm = cirq.qasm(circuit, args=cirq.QasmArgs(version='3.0'))
+    assert (
+        qasm
+        == f"""// Generated from Cirq v{cirq.__version__}
+
+OPENQASM 3.0;
+include "stdgates.inc";
+
+
+// Qubits: [q(0), q(1)]
+qubit[2] q;
+bit[1] m_a;
+bit[1] m_b;
+
+
+m_a[0] = measure q[0];
+m_b[0] = measure q[0];
+if (m_a==0 && m_b==0) x q[1];
+"""
+    )
 
 
 @pytest.mark.parametrize('sim', ALL_SIMULATORS)

cirq/ops/clifford_gate.py

@@ -15,9 +15,10 @@
 from __future__ import annotations
 
 import functools
+from collections.abc import Sequence
 from dataclasses import dataclass
 from types import NotImplementedType
-from typing import Any, Sequence, TYPE_CHECKING
+from typing import Any, TYPE_CHECKING
 
 import numpy as np
 
@@ -639,7 +640,7 @@ class SingleQubitCliffordGate(CliffordGate):
             return None
         # Find the entry with the largest magnitude in the input unitary, to find
         # the global phase difference between the input unitary and the gate unitary.
-        k = max(np.ndindex(*u.shape), key=lambda t: abs(u[t]))
+        k = max(np.ndindex(*u.shape), key=lambda t: abs(u[t].item()))
         return gate, u[k] / protocols.unitary(gate)[k]
 
     def pauli_tuple(self, pauli: Pauli) -> tuple[Pauli, bool]:

cirq/ops/clifford_gate_test.py

@@ -48,8 +48,7 @@ def _assert_no_collision(gate) -> None:
 
 
 def _all_rotations():
-    for pauli, flip in itertools.product(_paulis, _bools):
-        yield (pauli, flip)
+    yield from itertools.product(_paulis, _bools)
 
 
 def _all_rotation_pairs():

cirq/ops/common_channels.py

@@ -17,7 +17,8 @@
 from __future__ import annotations
 
 import itertools
-from typing import Any, Iterable, Sequence, TYPE_CHECKING
+from collections.abc import Iterable, Sequence
+from typing import Any, TYPE_CHECKING
 
 import numpy as np
 

cirq/ops/common_gates.py

@@ -27,8 +27,9 @@ raised to a power (i.e. cirq.H**0.5). See the definition in EigenGate.
 
 from __future__ import annotations
 
+from collections.abc import Collection, Sequence
 from types import NotImplementedType
-from typing import Any, cast, Collection, Sequence
+from typing import Any, cast
 
 import numpy as np
 import sympy
@@ -391,7 +392,7 @@ class YPowGate(eigen_gate.EigenGate):
     Unlike `cirq.XPowGate` and `cirq.ZPowGate`, this gate has no generalization
     to qudits and hence does not take the dimension argument. Ignoring the
     global phase all generalized Pauli operators on a d-level system may be
-    written as X**a Z**b for a,b=0,1,...,d-1. For a qubit, there is only one
+    written as ``X**a Z**b`` for a,b=0,1,...,d-1. For a qubit, there is only one
     "mixed" operator: XZ, conventionally denoted -iY. However, when d > 2 there
     are (d-1)*(d-1) > 1 such "mixed" operators (still ignoring the global phase).
     Due to this ambiguity, qudit Y gate is not well defined. The "mixed" operators

cirq/ops/control_values.py

@@ -16,8 +16,9 @@ from __future__ import annotations
 
 import abc
 import itertools
+from collections.abc import Collection, Iterator, Sequence
 from functools import cached_property
-from typing import Any, Collection, Iterator, Sequence, TYPE_CHECKING
+from typing import Any, TYPE_CHECKING
 
 from cirq import protocols, value
 

cirq/ops/controlled_gate.py

@@ -14,8 +14,9 @@
 
 from __future__ import annotations
 
+from collections.abc import Collection, Sequence, Set
 from types import NotImplementedType
-from typing import AbstractSet, Any, Collection, Sequence, TYPE_CHECKING
+from typing import Any, TYPE_CHECKING
 
 import numpy as np
 
@@ -244,7 +245,7 @@ class ControlledGate(raw_types.Gate):
     def _is_parameterized_(self) -> bool:
         return protocols.is_parameterized(self.sub_gate)
 
-    def _parameter_names_(self) -> AbstractSet[str]:
+    def _parameter_names_(self) -> Set[str]:
         return protocols.parameter_names(self.sub_gate)
 
     def _resolve_parameters_(self, resolver: cirq.ParamResolver, recursive: bool) -> ControlledGate:

cirq/ops/controlled_gate_test.py

@@ -14,8 +14,9 @@
 
 from __future__ import annotations
 
+from collections.abc import Sequence
 from types import EllipsisType, NotImplementedType
-from typing import Any, cast, Sequence
+from typing import Any, cast
 
 import numpy as np
 import pytest