|View source on GitHub|
Decomposes any permutation gates that provide acquaintance opportunities
in order to make them explicit.
||A predicate that determines whether an operation should be decomposed or not. Defaults to decomposing everything.|
optimization_at( circuit: "cirq.Circuit", index: int, op: "cirq.Operation" ) -> Optional['cirq.PointOptimizationSummary']
Describes how to change operations near the given location.
For example, this method could realize that the given operation is an X gate and that in the very next moment there is a Z gate. It would indicate that they should be combined into a Y gate by returning PointOptimizationSummary(clear_span=2, clear_qubits=op.qubits, new_operations=cirq.Y(op.qubits))
||The circuit to improve.|
||The index of the moment with the operation to focus on.|
||The operation to focus improvements upon.|
|A description of the optimization to perform, or else None if no change should be made.|
Call self as a function.