cirq-core 1.6.0.dev20250521011052__py3-none-any.whl → 1.6.0.dev20250522221502__py3-none-any.whl

cirq/_version.py

@@ -28,4 +28,4 @@ if sys.version_info < (3, 11, 0):  # pragma: no cover
         'of cirq (e.g. "python -m pip install cirq==1.5.0")'
     )
 
-__version__ = "1.6.0.dev20250521011052"
+__version__ = "1.6.0.dev20250522221502"

cirq/_version_test.py

@@ -3,4 +3,4 @@ import cirq
 
 
 def test_version() -> None:
-    assert cirq.__version__ == "1.6.0.dev20250521011052"
+    assert cirq.__version__ == "1.6.0.dev20250522221502"

cirq/circuits/circuit.py

@@ -918,7 +918,7 @@ class AbstractCircuit(abc.ABC):
     def all_qubits(self) -> frozenset[cirq.Qid]:
         """Returns the qubits acted upon by Operations in this circuit.
 
-        Returns: FrozenSet of `cirq.Qid` objects acted on by all operations
+        Returns: frozenset of `cirq.Qid` objects acted on by all operations
             in this circuit.
         """
         return frozenset(q for m in self.moments for q in m.qubits)
@@ -966,7 +966,7 @@ class AbstractCircuit(abc.ABC):
     def _measurement_key_objs_(self) -> frozenset[cirq.MeasurementKey]:
         """Returns the set of all measurement keys in this circuit.
 
-        Returns: FrozenSet of `cirq.MeasurementKey` objects that are
+        Returns: frozenset of `cirq.MeasurementKey` objects that are
             in this circuit.
         """
         return self.all_measurement_key_objs()
@@ -974,7 +974,7 @@ class AbstractCircuit(abc.ABC):
     def all_measurement_key_names(self) -> frozenset[str]:
         """Returns the set of all measurement key names in this circuit.
 
-        Returns: FrozenSet of strings that are the measurement key
+        Returns: frozenset of strings that are the measurement key
             names in this circuit.
         """
         return frozenset(

cirq/circuits/circuit_operation_test.py

@@ -15,7 +15,6 @@
 from __future__ import annotations
 
 import unittest.mock as mock
-from typing import Optional
 
 import numpy as np
 import pytest
@@ -294,7 +293,7 @@ def test_repeat(add_measurements: bool, use_default_ids_for_initial_rep: bool) -
             _ = op_base.repeat(initial_repetitions)
         initial_repetitions = abs(initial_repetitions)
 
-    op_with_reps: Optional[cirq.CircuitOperation] = None
+    op_with_reps: cirq.CircuitOperation | None = None
     rep_ids = []
     if use_default_ids_for_initial_rep:
         rep_ids = ['0', '1', '2']

cirq/contrib/acquaintance/devices.py

@@ -15,7 +15,7 @@
 from __future__ import annotations
 
 import abc
-from typing import TYPE_CHECKING, Union
+from typing import TYPE_CHECKING
 
 from cirq import circuits, devices, ops
 from cirq.contrib.acquaintance.bipartite import BipartiteSwapNetworkGate
@@ -42,7 +42,7 @@ class AcquaintanceDevice(devices.Device, metaclass=abc.ABCMeta):
             )
 
 
-def get_acquaintance_size(obj: Union[circuits.Circuit, ops.Operation]) -> int:
+def get_acquaintance_size(obj: circuits.Circuit | ops.Operation) -> int:
     """The maximum number of qubits to be acquainted with each other."""
     if isinstance(obj, circuits.Circuit):
         return max(tuple(get_acquaintance_size(op) for op in obj.all_operations()) or (0,))

cirq/contrib/acquaintance/inspection_utils.py

@@ -14,7 +14,7 @@
 
 from __future__ import annotations
 
-from typing import FrozenSet, Iterator, Sequence, Set, TYPE_CHECKING
+from typing import Iterator, Sequence, TYPE_CHECKING
 
 from cirq import devices
 from cirq.contrib import circuitdag
@@ -66,7 +66,7 @@ def get_acquaintance_dag(strategy: cirq.Circuit, initial_mapping: LogicalMapping
 
 def get_logical_acquaintance_opportunities(
     strategy: cirq.Circuit, initial_mapping: LogicalMapping
-) -> Set[FrozenSet[LogicalIndex]]:
+) -> set[frozenset[LogicalIndex]]:
     acquaintance_dag = get_acquaintance_dag(strategy, initial_mapping)
     logical_acquaintance_opportunities = set()
     for op in acquaintance_dag.all_operations():

cirq/contrib/qasm_import/_lexer.py

@@ -15,7 +15,6 @@
 from __future__ import annotations
 
 import re
-from typing import Optional
 
 import ply.lex as lex
 
@@ -117,5 +116,5 @@ class QasmLexer:
     def input(self, qasm):
         self.lex.input(qasm)
 
-    def token(self) -> Optional[lex.Token]:
+    def token(self) -> lex.Token | None:
         return self.lex.token()

cirq/contrib/routing/router.py

@@ -14,7 +14,7 @@
 
 from __future__ import annotations
 
-from typing import Callable, Optional, TYPE_CHECKING
+from typing import Callable, TYPE_CHECKING
 
 from cirq import circuits, protocols
 from cirq.contrib.routing.greedy import route_circuit_greedily
@@ -31,8 +31,8 @@ def route_circuit(
     circuit: circuits.Circuit,
     device_graph: nx.Graph,
     *,
-    algo_name: Optional[str] = None,
-    router: Optional[Callable[..., SwapNetwork]] = None,
+    algo_name: str | None = None,
+    router: Callable[..., SwapNetwork] | None = None,
     **kwargs,
 ) -> SwapNetwork:
     """Routes a circuit on a given device.

cirq/devices/device.py

@@ -15,7 +15,7 @@
 from __future__ import annotations
 
 import abc
-from typing import FrozenSet, Iterable, Optional, TYPE_CHECKING
+from typing import Iterable, TYPE_CHECKING
 
 import networkx as nx
 
@@ -59,7 +59,7 @@ class Device(metaclass=abc.ABCMeta):
     """
 
     @property
-    def metadata(self) -> Optional[DeviceMetadata]:
+    def metadata(self) -> DeviceMetadata | None:
         """Returns the associated Metadata with the device if applicable.
 
         Returns:
@@ -116,11 +116,11 @@ class DeviceMetadata:
                 directional coupling, undirected edges indicate bi-directional
                 coupling.
         """
-        self._qubits_set: FrozenSet[cirq.Qid] = frozenset(qubits)
+        self._qubits_set: frozenset[cirq.Qid] = frozenset(qubits)
         self._nx_graph = nx_graph
 
     @property
-    def qubit_set(self) -> FrozenSet[cirq.Qid]:
+    def qubit_set(self) -> frozenset[cirq.Qid]:
         """Returns the set of qubits on the device.
 
         Returns:

cirq/experiments/fidelity_estimation.py

@@ -16,7 +16,7 @@
 
 from __future__ import annotations
 
-from typing import Callable, Mapping, Optional, Sequence, TYPE_CHECKING
+from typing import Callable, Mapping, Sequence, TYPE_CHECKING
 
 import numpy as np
 
@@ -141,7 +141,7 @@ def xeb_fidelity(
     circuit: cirq.Circuit,
     bitstrings: Sequence[int],
     qubit_order: QubitOrderOrList = QubitOrder.DEFAULT,
-    amplitudes: Optional[Mapping[int, complex]] = None,
+    amplitudes: Mapping[int, complex] | None = None,
     estimator: Callable[[int, Sequence[float]], float] = linear_xeb_fidelity_from_probabilities,
 ) -> float:
     """Estimates XEB fidelity from one circuit using user-supplied estimator.
@@ -206,7 +206,7 @@ def linear_xeb_fidelity(
     circuit: cirq.Circuit,
     bitstrings: Sequence[int],
     qubit_order: QubitOrderOrList = QubitOrder.DEFAULT,
-    amplitudes: Optional[Mapping[int, complex]] = None,
+    amplitudes: Mapping[int, complex] | None = None,
 ) -> float:
     """Estimates XEB fidelity from one circuit using linear estimator."""
     return xeb_fidelity(
@@ -222,7 +222,7 @@ def log_xeb_fidelity(
     circuit: cirq.Circuit,
     bitstrings: Sequence[int],
     qubit_order: QubitOrderOrList = QubitOrder.DEFAULT,
-    amplitudes: Optional[Mapping[int, complex]] = None,
+    amplitudes: Mapping[int, complex] | None = None,
 ) -> float:
     """Estimates XEB fidelity from one circuit using logarithmic estimator."""
     return xeb_fidelity(

cirq/experiments/t1_decay_experiment.py

@@ -15,7 +15,7 @@
 from __future__ import annotations
 
 import warnings
-from typing import Any, cast, Optional, Sequence, TYPE_CHECKING
+from typing import Any, cast, Sequence, TYPE_CHECKING
 
 import numpy as np
 import pandas as pd
@@ -146,7 +146,7 @@ class T1DecayResult:
             return np.nan
 
     def plot(
-        self, ax: Optional[plt.Axes] = None, include_fit: bool = False, **plot_kwargs: Any
+        self, ax: plt.Axes | None = None, include_fit: bool = False, **plot_kwargs: Any
     ) -> plt.Axes:
         """Plots the excited state probability vs the amount of delay.
 

cirq/experiments/xeb_fitting.py

@@ -506,7 +506,7 @@ def characterize_phased_fsim_parameters_with_xeb(
     )
     return XEBCharacterizationResult(
         optimization_results={pair: optimization_result},
-        final_params={pair: final_params},  # type: ignore[dict-item]
+        final_params={pair: final_params},
         fidelities_df=fidelities_df,
     )
 

cirq/interop/quirk/cells/measurement_cells.py

@@ -14,7 +14,7 @@
 
 from __future__ import annotations
 
-from typing import cast, Iterable, Iterator, Optional, TYPE_CHECKING
+from typing import cast, Iterable, Iterator, TYPE_CHECKING
 
 from cirq import ops
 from cirq.interop.quirk.cells.cell import CellMaker, ExplicitOperationsCell
@@ -30,7 +30,7 @@ def generate_all_measurement_cell_makers() -> Iterator[CellMaker]:
     yield _measurement("XDetector", basis_change=ops.Y**0.5)
 
 
-def _measurement(identifier: str, basis_change: Optional[cirq.Gate] = None) -> CellMaker:
+def _measurement(identifier: str, basis_change: cirq.Gate | None = None) -> CellMaker:
     return CellMaker(
         identifier=identifier,
         size=1,

cirq/linalg/combinators.py

@@ -17,7 +17,7 @@
 from __future__ import annotations
 
 import functools
-from typing import TYPE_CHECKING, Union
+from typing import TYPE_CHECKING
 
 import numpy as np
 
@@ -27,7 +27,7 @@ if TYPE_CHECKING:
     from numpy.typing import ArrayLike, DTypeLike
 
 
-def kron(*factors: Union[np.ndarray, complex], shape_len: int = 2) -> np.ndarray:
+def kron(*factors: np.ndarray | complex, shape_len: int = 2) -> np.ndarray:
     """Computes the kronecker product of a sequence of values.
 
     A *args version of lambda args: functools.reduce(np.kron, args).
@@ -58,7 +58,7 @@ document(
 )
 
 
-def kron_with_controls(*factors: Union[np.ndarray, complex]) -> np.ndarray:
+def kron_with_controls(*factors: np.ndarray | complex) -> np.ndarray:
     """Computes the kronecker product of a sequence of values and control tags.
 
     Use `cirq.CONTROL_TAG` to represent controls. Any entry of the output

cirq/linalg/decompositions.py

@@ -116,7 +116,7 @@ def unitary_eig(
             was unitary.
 
     Returns:
-        A Tuple of
+        A tuple of
             eigvals: The eigenvalues of `matrix`.
             V: The unitary matrix with the eigenvectors as columns.
 

cirq/linalg/predicates.py

@@ -17,7 +17,7 @@
 from __future__ import annotations
 
 from types import EllipsisType
-from typing import cast, Sequence, Union
+from typing import cast, Sequence
 
 import numpy as np
 
@@ -302,7 +302,7 @@ def slice_for_qubits_equal_to(
     out_size = (
         cast(int, num_qubits) if out_size_specified else max(target_qubit_axes, default=-1) + 1
     )
-    result = cast(list[Union[slice, int, EllipsisType]], [slice(None)] * out_size)
+    result = cast(list[slice | int | EllipsisType], [slice(None)] * out_size)
     if not out_size_specified:
         result.append(Ellipsis)
     if qid_shape is None:

cirq/linalg/tolerance.py

@@ -17,7 +17,7 @@ tolerances."""
 
 from __future__ import annotations
 
-from typing import Iterable, TYPE_CHECKING, Union
+from typing import Iterable, TYPE_CHECKING
 
 import numpy as np
 
@@ -36,7 +36,7 @@ def all_near_zero(a: ArrayLike, *, atol: float = 1e-8) -> bool:
 
 
 def all_near_zero_mod(
-    a: Union[float, Iterable[float], np.ndarray], period: float, *, atol: float = 1e-8
+    a: float | Iterable[float] | np.ndarray, period: float, *, atol: float = 1e-8
 ) -> bool:
     """Checks if the tensor's elements are all near multiples of the period.
 

cirq/ops/arithmetic_operation.py

@@ -44,21 +44,21 @@ class ArithmeticGate(Gate, metaclass=abc.ABCMeta):
     >>> class Add(cirq.ArithmeticGate):
     ...     def __init__(
     ...         self,
-    ...         target_register: '[int, Sequence[int]]',
-    ...         input_register: 'Union[int, Sequence[int]]',
+    ...         target_register: int | Sequence[int],
+    ...         input_register: int | Sequence[int],
     ...     ):
     ...         self.target_register = target_register
     ...         self.input_register = input_register
     ...
-    ...     def registers(self) -> 'Sequence[Union[int, Sequence[int]]]':
+    ...     def registers(self) -> Sequence[int | Sequence[int]]:
     ...         return self.target_register, self.input_register
     ...
     ...     def with_registers(
-    ...         self, *new_registers: 'Union[int, Sequence[int]]'
+    ...         self, *new_registers: int | Sequence[int]
     ...     ) -> 'Add':
     ...         return Add(*new_registers)
     ...
-    ...     def apply(self, *register_values: int) -> 'Union[int, Iterable[int]]':
+    ...     def apply(self, *register_values: int) -> int | Iterable[int]:
     ...         return sum(register_values)
     >>> cirq.unitary(
     ...     Add(target_register=[2, 2],

cirq/ops/arithmetic_operation_test.py

@@ -14,7 +14,7 @@
 
 from __future__ import annotations
 
-from typing import Sequence, Union
+from typing import Sequence
 
 import numpy as np
 import pytest
@@ -89,9 +89,7 @@ def test_the_tests() -> None:
 def test_arithmetic_gate_apply_unitary() -> None:
     class Add(cirq.ArithmeticGate):
         def __init__(
-            self,
-            target_register: Union[int, Sequence[int]],
-            input_register: Union[int, Sequence[int]],
+            self, target_register: int | Sequence[int], input_register: int | Sequence[int]
         ):
             self.target_register = target_register
             self.input_register = input_register

cirq/ops/common_gate_families.py

@@ -16,7 +16,7 @@
 
 from __future__ import annotations
 
-from typing import Any, cast, Optional, Type, Union
+from typing import Any, cast
 
 from cirq import protocols
 from cirq.ops import eigen_gate, gateset, parallel_gate, raw_types
@@ -25,7 +25,7 @@ from cirq.ops import eigen_gate, gateset, parallel_gate, raw_types
 class AnyUnitaryGateFamily(gateset.GateFamily):
     """GateFamily which accepts any N-Qubit unitary gate."""
 
-    def __init__(self, num_qubits: Optional[int] = None) -> None:
+    def __init__(self, num_qubits: int | None = None) -> None:
         """Init AnyUnitaryGateFamily
 
         Args:
@@ -65,7 +65,7 @@ class AnyUnitaryGateFamily(gateset.GateFamily):
 class AnyIntegerPowerGateFamily(gateset.GateFamily):
     """GateFamily which accepts instances of a given `cirq.EigenGate`, raised to integer power."""
 
-    def __init__(self, gate: Type[eigen_gate.EigenGate]) -> None:
+    def __init__(self, gate: type[eigen_gate.EigenGate]) -> None:
         """Init AnyIntegerPowerGateFamily
 
         Args:
@@ -129,11 +129,11 @@ class ParallelGateFamily(gateset.GateFamily):
 
     def __init__(
         self,
-        gate: Union[Type[raw_types.Gate], raw_types.Gate],
+        gate: type[raw_types.Gate] | raw_types.Gate,
         *,
-        name: Optional[str] = None,
-        description: Optional[str] = None,
-        max_parallel_allowed: Optional[int] = None,
+        name: str | None = None,
+        description: str | None = None,
+        max_parallel_allowed: int | None = None,
     ) -> None:
         """Inits ParallelGateFamily
 

cirq/ops/controlled_gate_test.py

@@ -15,7 +15,7 @@
 from __future__ import annotations
 
 from types import EllipsisType, NotImplementedType
-from typing import Any, cast, Sequence, Union
+from typing import Any, cast, Sequence
 
 import numpy as np
 import pytest
@@ -47,7 +47,7 @@ class GateAllocatingNewSpaceForResult(cirq.testing.SingleQubitGate):
     def _apply_unitary_(self, args: cirq.ApplyUnitaryArgs) -> np.ndarray | NotImplementedType:
         assert len(args.axes) == 1
         a = args.axes[0]
-        seed = cast(tuple[Union[int, slice, EllipsisType], ...], (slice(None),))
+        seed = cast(tuple[int | slice | EllipsisType, ...], (slice(None),))
         zero = seed * a + (0, Ellipsis)
         one = seed * a + (1, Ellipsis)
         result = np.zeros(args.target_tensor.shape, args.target_tensor.dtype)

cirq/ops/controlled_operation_test.py

@@ -17,7 +17,7 @@ from __future__ import annotations
 import itertools
 import re
 from types import EllipsisType, NotImplementedType
-from typing import cast, Union
+from typing import cast
 
 import numpy as np
 import pytest
@@ -50,7 +50,7 @@ class GateAllocatingNewSpaceForResult(cirq.testing.SingleQubitGate):
     def _apply_unitary_(self, args: cirq.ApplyUnitaryArgs) -> np.ndarray | NotImplementedType:
         assert len(args.axes) == 1
         a = args.axes[0]
-        seed = cast(tuple[Union[int, slice, EllipsisType], ...], (slice(None),))
+        seed = cast(tuple[int | slice | EllipsisType, ...], (slice(None),))
         zero = seed * a + (0, Ellipsis)
         one = seed * a + (1, Ellipsis)
         result = np.zeros(args.target_tensor.shape, args.target_tensor.dtype)

cirq/ops/linear_combinations_test.py

@@ -15,7 +15,6 @@
 from __future__ import annotations
 
 import collections
-from typing import Union
 
 import numpy as np
 import pytest
@@ -230,12 +229,12 @@ def test_parameterized_linear_combination_of_gates(
 
 
 def get_matrix(
-    operator: Union[
-        cirq.Gate,
-        cirq.GateOperation,
-        cirq.LinearCombinationOfGates,
-        cirq.LinearCombinationOfOperations,
-    ],
+    operator: (
+        cirq.Gate
+        | cirq.GateOperation
+        | cirq.LinearCombinationOfGates
+        | cirq.LinearCombinationOfOperations
+    ),
 ) -> np.ndarray:
     if isinstance(operator, (cirq.LinearCombinationOfGates, cirq.LinearCombinationOfOperations)):
         return operator.matrix()
@@ -243,8 +242,8 @@ def get_matrix(
 
 
 def assert_linear_combinations_are_equal(
-    actual: Union[cirq.LinearCombinationOfGates, cirq.LinearCombinationOfOperations],
-    expected: Union[cirq.LinearCombinationOfGates, cirq.LinearCombinationOfOperations],
+    actual: cirq.LinearCombinationOfGates | cirq.LinearCombinationOfOperations,
+    expected: cirq.LinearCombinationOfGates | cirq.LinearCombinationOfOperations,
 ) -> None:
     if not actual and not expected:
         assert len(actual) == 0

cirq/ops/op_tree.py

@@ -40,7 +40,7 @@ document(
     - A list of operations (a `list[cirq.Operation]`).
     - A list of lists of operations (a `list[list[cirq.Operation]]`).
     - A list mixing operations and generators of operations
-        (a `list[Union[cirq.Operation, Iterator[cirq.Operation]]]`).
+        (a `list[cirq.Operation | Iterator[cirq.Operation]]`).
     - Generally anything that can be iterated, and its items iterated, and
         so forth recursively until a bottom layer of operations is found.
     """,

cirq/ops/qid_util.py

@@ -14,7 +14,7 @@
 
 from __future__ import annotations
 
-from typing import overload, TYPE_CHECKING, Union
+from typing import overload, TYPE_CHECKING
 
 if TYPE_CHECKING:
     import cirq
@@ -32,7 +32,7 @@ def q(__row: int, __col: int) -> cirq.GridQubit: ...
 def q(__name: str) -> cirq.NamedQubit: ...
 
 
-def q(*args: Union[int, str]) -> Union[cirq.LineQubit, cirq.GridQubit, cirq.NamedQubit]:
+def q(*args: int | str) -> cirq.LineQubit | cirq.GridQubit | cirq.NamedQubit:
     """Constructs a qubit id of the appropriate type based on args.
 
     This is shorthand for constructing qubit ids of common types:

cirq/ops/qubit_order_or_list.py

@@ -20,12 +20,12 @@ mypy.
 
 from __future__ import annotations
 
-from typing import Iterable, Union
+from typing import Iterable
 
 from cirq._doc import document
 from cirq.ops import qubit_order, raw_types
 
-QubitOrderOrList = Union[qubit_order.QubitOrder, Iterable[raw_types.Qid]]
+QubitOrderOrList = qubit_order.QubitOrder | Iterable[raw_types.Qid]
 document(
     QubitOrderOrList,
     """Specifies a qubit ordering.

cirq/ops/raw_types.py

@@ -449,7 +449,7 @@ class Gate(metaclass=value.ABCMetaImplementAnyOneOf):
 
     @value.alternative(requires='_num_qubits_', implementation=_default_shape_from_num_qubits)
     def _qid_shape_(self) -> tuple[int, ...]:
-        """Returns a Tuple containing the number of quantum levels of each qid
+        """Returns a tuple containing the number of quantum levels of each qid
         the gate acts on.  E.g. (2, 2, 2) for the three-qubit CCZ gate and
         (3, 3) for a 2-qutrit ternary gate.
         """

cirq/protocols/act_on_protocol.py

@@ -15,7 +15,7 @@
 from __future__ import annotations
 
 from types import NotImplementedType
-from typing import Any, Optional, Sequence, TYPE_CHECKING, Union
+from typing import Any, Sequence, TYPE_CHECKING
 
 from typing_extensions import Protocol
 
@@ -30,7 +30,7 @@ class SupportsActOn(Protocol):
     """An object that explicitly specifies how to act on simulator states."""
 
     @doc_private
-    def _act_on_(self, sim_state: cirq.SimulationStateBase) -> Union[NotImplementedType, bool]:
+    def _act_on_(self, sim_state: cirq.SimulationStateBase) -> NotImplementedType | bool:
         """Applies an action to the given argument, if it is a supported type.
 
         For example, unitary operations can implement an `_act_on_` method that
@@ -62,7 +62,7 @@ class SupportsActOnQubits(Protocol):
     @doc_private
     def _act_on_(
         self, sim_state: cirq.SimulationStateBase, qubits: Sequence[cirq.Qid]
-    ) -> Union[NotImplementedType, bool]:
+    ) -> NotImplementedType | bool:
         """Applies an action to the given argument, if it is a supported type.
 
         For example, unitary operations can implement an `_act_on_` method that
@@ -91,7 +91,7 @@ class SupportsActOnQubits(Protocol):
 def act_on(
     action: Any,
     sim_state: cirq.SimulationStateBase,
-    qubits: Optional[Sequence[cirq.Qid]] = None,
+    qubits: Sequence[cirq.Qid] | None = None,
     *,
     allow_decompose: bool = True,
 ):

cirq/protocols/commutes_protocol.py

@@ -17,7 +17,7 @@
 from __future__ import annotations
 
 from types import NotImplementedType
-from typing import Any, overload, TypeVar, Union
+from typing import Any, overload, TypeVar
 
 import numpy as np
 from typing_extensions import Protocol
@@ -38,7 +38,7 @@ class SupportsCommutes(Protocol):
     """An object that can determine commutation relationships vs others."""
 
     @doc_private
-    def _commutes_(self, other: Any, *, atol: float) -> Union[None, bool, NotImplementedType]:
+    def _commutes_(self, other: Any, *, atol: float) -> None | bool | NotImplementedType:
         r"""Determines if this object commutes with the other object.
 
         Can return None to indicate the commutation relationship is
@@ -81,9 +81,7 @@ def commutes(v1: Any, v2: Any, *, atol: float = 1e-8) -> bool: ...
 
 
 @overload
-def commutes(
-    v1: Any, v2: Any, *, atol: float = 1e-8, default: TDefault
-) -> Union[bool, TDefault]: ...
+def commutes(v1: Any, v2: Any, *, atol: float = 1e-8, default: TDefault) -> bool | TDefault: ...
 
 
 def commutes(
@@ -162,7 +160,7 @@ def definitely_commutes(v1: Any, v2: Any, *, atol: float = 1e-8) -> bool:
 
 def _strat_commutes_from_commutes(
     v1: Any, v2: Any, *, atol: float = 1e-8
-) -> Union[bool, NotImplementedType, None]:
+) -> bool | NotImplementedType | None:
     """Attempts to determine commutativity via the objects' _commutes_
     method."""
 
@@ -179,7 +177,7 @@ def _strat_commutes_from_commutes(
 
 def _strat_commutes_from_matrix(
     v1: Any, v2: Any, *, atol: float
-) -> Union[bool, NotImplementedType, None]:
+) -> bool | NotImplementedType | None:
     """Attempts to determine commutativity of matrices."""
     if not isinstance(v1, np.ndarray) or not isinstance(v2, np.ndarray):
         return NotImplemented