|View source on GitHub|
Attempts to convert strange gates into XmonGates.
cirq.google.ConvertToXmonGates( ignore_failures=False ) -> None
Used in the notebooks
|Used in the tutorials|
First, checks if the given operation is already a native xmon operation.
Second, checks if the operation has a known unitary. If so, and the gate is a 1-qubit or 2-qubit gate, then performs circuit synthesis of the operation.
Third, attempts to
cirq.decompose to the operation.
Fourth, if ignore_failures is set, gives up and returns the gate unchanged. Otherwise raises a TypeError.
convert( op: "cirq.Operation" ) -> List['cirq.Operation']
optimization_at( circuit, index, op )
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.