cirq.CliffordGate

Clifford rotation for N-qubit.

Inherits From: Gate

cirq.CliffordGate(
    *,
    _clifford_tableau: cirq.CliffordTableau
) -> None

Attributes
`clifford_tableau`

Attributes

clifford_tableau

Methods

`controlled`

View source

controlled(
    num_controls: Optional[int] = None,
    control_values: Optional[Union[cv.AbstractControlValues, Sequence[Union[int, Collection[int]]]]
        ] = None,
    control_qid_shape: Optional[Tuple[int, ...]] = None
) -> 'Gate'

Returns a controlled version of this gate. If no arguments are specified, defaults to a single qubit control.

Args
`num_controls`	Total number of control qubits.
`control_values`	Which control computational basis state to apply the sub gate. A sequence of length `num_controls` where each entry is an integer (or set of integers) corresponding to the computational basis state (or set of possible values) where that control is enabled. When all controls are enabled, the sub gate is applied. If unspecified, control values default to 1.
`control_qid_shape`	The qid shape of the controls. A tuple of the expected dimension of each control qid. Defaults to `(2,) * num_controls`. Specify this argument when using qudits.

Returns
A `cirq.Gate` representing `self` controlled by the given control values and qubits. This is a `cirq.ControlledGate` in the base implementation, but subclasses may return a different gate type.

`from_clifford_tableau`

View source

@classmethod
from_clifford_tableau(
    tableau: cirq.CliffordTableau
) -> 'CliffordGate'

Create the CliffordGate instance from Clifford Tableau.

Args
`tableau`	A CliffordTableau to define the effect of Clifford Gate applying on the stabilizer state or Pauli group. The meaning of tableau here is To X Z sign from X [ X_x Z_x \| r_x ] from Z [ X_z Z_z \| r_z ] Each row in the Clifford tableau indicates how the transformation of original Pauli gates to the new gates after applying this Clifford Gate.

Returns
A CliffordGate instance, which has the transformation defined by the input tableau.

Raises
`ValueError`	When input tableau is wrong type or the tableau does not satisfy the symplectic property.

`from_op_list`

View source

@classmethod
from_op_list(
    operations: Sequence[cirq.Operation],
    qubit_order: Sequence[cirq.Qid]
) -> 'CliffordGate'

Construct a new Clifford gates from several known operations.

Args
`operations`	A list of cirq operations to construct the Clifford gate. The combination order is the first element in the list applies the transformation on the stabilizer state first.
`qubit_order`	Determines how qubits are ordered when decomposite the operations.

Returns
A CliffordGate instance, which has the transformation on the stabilizer state equivalent to the composition of operations.

Raises
`ValueError`	When one or more operations do not have stabilizer effect.

`num_qubits`

View source

num_qubits() -> int

The number of qubits this gate acts on.

`on`

View source

on(
    *qubits
) -> 'Operation'

Returns an application of this gate to the given qubits.

Args
`*qubits`	The collection of qubits to potentially apply the gate to.

Returns: a cirq.Operation which is this gate applied to the given qubits.

`on_each`

View source

on_each(
    *targets
) -> List['cirq.Operation']

Returns a list of operations applying the gate to all targets.

Args
`*targets`	The qubits to apply this gate to. For single-qubit gates this can be provided as varargs or a combination of nested iterables. For multi-qubit gates this must be provided as an `Iterable[Sequence[Qid]]`, where each sequence has `num_qubits` qubits.

Returns
Operations applying this gate to the target qubits.

Raises
`ValueError`	If targets are not instances of Qid or Iterable[Qid]. If the gate qubit number is incompatible.
`TypeError`	If a single target is supplied and it is not iterable.

`validate_args`

View source

validate_args(
    qubits: Sequence['cirq.Qid']
) -> None

Checks if this gate can be applied to the given qubits.

By default checks that:

inputs are of type Qid
len(qubits) == num_qubits()
qubit_i.dimension == qid_shape[i] for all qubits

Child classes can override. The child implementation should call super().validate_args(qubits) then do custom checks.

Args
`qubits`	The sequence of qubits to potentially apply the gate to.

Raises
`ValueError`	The gate can't be applied to the qubits.

`with_probability`

View source

with_probability(
    probability: 'cirq.TParamVal'
) -> 'cirq.Gate'

Creates a probabilistic channel with this gate.

Args
`probability`	floating point value between 0 and 1, giving the probability this gate is applied.

Returns
`cirq.RandomGateChannel` that applies `self` with probability `probability` and the identity with probability `1-p`.

`wrap_in_linear_combination`

View source

wrap_in_linear_combination(
    coefficient: Union[complex, float, int] = 1
) -> 'cirq.LinearCombinationOfGates'

Returns a LinearCombinationOfGates with this gate.

Args
`coefficient`	number coefficient to use in the resulting `cirq.LinearCombinationOfGates` object.

Returns
`cirq.LinearCombinationOfGates` containing self with a coefficient of `coefficient`.

`add`

View source

__add__(
    other: Union['Gate', 'cirq.LinearCombinationOfGates']
) -> 'cirq.LinearCombinationOfGates'

`call`

View source

__call__(
    *qubits, **kwargs
)

Call self as a function.

`eq`

View source

__eq__(
    other: _SupportsValueEquality
) -> bool

`mul`

View source

__mul__(
    other: Union[complex, float, int]
) -> 'cirq.LinearCombinationOfGates'

`ne`

View source

__ne__(
    other: _SupportsValueEquality
) -> bool

`neg`

View source

__neg__() -> 'cirq.LinearCombinationOfGates'

`pow`

View source

__pow__(
    exponent: float
) -> 'CliffordGate'

`rmul`

View source

__rmul__(
    other: Union[complex, float, int]
) -> 'cirq.LinearCombinationOfGates'

`sub`

View source

__sub__(
    other: Union['Gate', 'cirq.LinearCombinationOfGates']
) -> 'cirq.LinearCombinationOfGates'

`truediv`

View source

__truediv__(
    other: Union[complex, float, int]
) -> 'cirq.LinearCombinationOfGates'