Source code for cirq.ops.moment

# Copyright 2018 The Cirq Developers
# Licensed under the Apache License, Version 2.0 (the "License");
# you may not use this file except in compliance with the License.
# You may obtain a copy of the License at
# Unless required by applicable law or agreed to in writing, software
# distributed under the License is distributed on an "AS IS" BASIS,
# See the License for the specific language governing permissions and
# limitations under the License.

"""A simplified time-slice of operations within a sequenced circuit."""

from typing import (Any, Callable, Iterable, Sequence, TypeVar, Union, Tuple,
                    FrozenSet, TYPE_CHECKING, Iterator, overload)
from cirq import protocols
from cirq.ops import raw_types

    import cirq

TSelf_Moment = TypeVar('TSelf_Moment', bound='Moment')

[docs]class Moment: """A time-slice of operations within a circuit. Grouping operations into moments is intended to be a strong suggestion to whatever is scheduling operations on real hardware. Operations in the same moment should execute at the same time (to the extent possible; not all operations have the same duration) and it is expected that all operations in a moment should be completed before beginning the next moment. Moment can be indexed by qubit or list of qubits: moment[qubit] returns the Operation in the moment which touches the given qubit, or throws KeyError if there is no such operation. moment[qubits] returns another Moment which consists only of those operations which touch at least one of the given qubits. If there are no such operations, returns an empty Moment. """
[docs] def __init__(self, operations: Iterable[raw_types.Operation] = ()) -> None: """Constructs a moment with the given operations. Args: operations: The operations applied within the moment. Will be frozen into a tuple before storing. Raises: ValueError: A qubit appears more than once. """ self._operations = tuple(operations) # Check that operations don't overlap. affected_qubits = [q for op in self.operations for q in op.qubits] self._qubits = frozenset(affected_qubits) if len(affected_qubits) != len(self._qubits): raise ValueError( 'Overlapping operations: {}'.format(self.operations))
@property def operations(self) -> Tuple[raw_types.Operation, ...]: return self._operations @property def qubits(self) -> FrozenSet[raw_types.Qid]: return self._qubits def operates_on_single_qubit(self, qubit: 'cirq.Qid') -> bool: """Determines if the moment has operations touching the given qubit. Args: qubit: The qubit that may or may not be touched by operations. Returns: Whether this moment has operations involving the qubit. """ return qubit in self.qubits def operates_on(self, qubits: Iterable[raw_types.Qid]) -> bool: """Determines if the moment has operations touching the given qubits. Args: qubits: The qubits that may or may not be touched by operations. Returns: Whether this moment has operations involving the qubits. """ return bool(set(qubits) & self.qubits) def with_operation(self, operation: 'cirq.Operation') -> 'cirq.Moment': """Returns an equal moment, but with the given op added. Args: operation: The operation to append. Returns: The new moment. """ if any(q in self._qubits for q in operation.qubits): raise ValueError('Overlapping operations: {}'.format(operation)) # Use private variables to facilitate a quick copy m = Moment() m._operations = self.operations + (operation,) m._qubits = frozenset(self._qubits.union(set(operation.qubits))) return m def without_operations_touching(self, qubits: Iterable['cirq.Qid'] ) -> 'cirq.Moment': """Returns an equal moment, but without ops on the given qubits. Args: qubits: Operations that touch these will be removed. Returns: The new moment. """ qubits = frozenset(qubits) if not self.operates_on(qubits): return self return Moment( operation for operation in self.operations if qubits.isdisjoint(frozenset(operation.qubits))) def _operation_touching(self, qubit: raw_types.Qid) -> 'cirq.Operation': """Returns the operation touching given qubit. Args: qubit: Operations that touch this qubit will be returned. Returns: The operation which touches `qubit`. """ for op in self.operations: if qubit in op.qubits: return op raise KeyError("Moment doesn't act on given qubit") def __copy__(self): return type(self)(self.operations) def __bool__(self) -> bool: return bool(self.operations) def __eq__(self, other) -> bool: if not isinstance(other, type(self)): return NotImplemented return (sorted(self.operations, key=lambda op: op.qubits) == sorted( other.operations, key=lambda op: op.qubits)) def _approx_eq_(self, other: Any, atol: Union[int, float]) -> bool: """See `cirq.protocols.SupportsApproximateEquality`.""" if not isinstance(other, type(self)): return NotImplemented return protocols.approx_eq(sorted(self.operations, key=lambda op: op.qubits), sorted(other.operations, key=lambda op: op.qubits), atol=atol) def __ne__(self, other) -> bool: return not self == other def __hash__(self): return hash( (Moment, tuple(sorted(self.operations, key=lambda op: op.qubits)))) def __iter__(self) -> Iterator['cirq.Operation']: return iter(self.operations) def __pow__(self, power): if power == 1: return self new_ops = [] for op in self.operations: new_op = protocols.pow(op, power, default=None) if new_op is None: return NotImplemented new_ops.append(new_op) return Moment(new_ops) def __len__(self): return len(self.operations) def __repr__(self): if not self.operations: return 'cirq.Moment()' return 'cirq.Moment(operations={})'.format( _list_repr_with_indented_item_lines(self.operations)) def __str__(self): return ' and '.join(str(op) for op in self.operations) def transform_qubits(self: TSelf_Moment, func: Callable[['cirq.Qid'], 'cirq.Qid'] ) -> TSelf_Moment: """Returns the same moment, but with different qubits. Args: func: The function to use to turn each current qubit into a desired new qubit. Returns: The receiving moment but with qubits transformed by the given function. """ return self.__class__(op.transform_qubits(func) for op in self.operations) def _json_dict_(self): return protocols.obj_to_dict_helper(self, ['operations']) def __add__(self, other: Union['cirq.Operation', 'cirq.Moment']) -> 'cirq.Moment': if isinstance(other, raw_types.Operation): return self.with_operation(other) if isinstance(other, Moment): return Moment(self.operations + other.operations) return NotImplemented # pylint: disable=function-redefined @overload def __getitem__(self, key: raw_types.Qid) -> 'cirq.Operation': pass @overload def __getitem__(self, key: Iterable[raw_types.Qid]) -> 'cirq.Moment': pass def __getitem__(self, key): if isinstance(key, raw_types.Qid): return self._operation_touching(key) elif isinstance(key, Iterable): qubits_to_keep = frozenset(key) ops_to_keep = tuple( op for op in self.operations if not qubits_to_keep.isdisjoint(frozenset(op.qubits))) return Moment(ops_to_keep)
def _list_repr_with_indented_item_lines(items: Sequence[Any]) -> str: block = '\n'.join([repr(op) + ',' for op in items]) indented = ' ' + '\n '.join(block.split('\n')) return '[\n{}\n]'.format(indented)