PermutationGate¶
- class PermutationGate(pattern)[source]¶
Bases:
Gate
A gate that permutes qubits.
Return a permutation gate.
- Parameters
pattern (list[int]) – permutation pattern, describing which qubits occupy the positions 0, 1, 2, etc. after applying the permutation, that is
pattern[k] = m
when the permutation maps qubitm
to positionk
. As an example, the pattern[2, 4, 3, 0, 1]
means that qubit2
goes to position0
, qubit4
goes to the position1
, etc.- Raises
CircuitError – if permutation pattern is malformed.
- Reference Circuit:
-
- Expanded Circuit:
-
Methods Defined Here
Returns the inverse of the permutation.
Parameter validation.
Attributes
- condition_bits¶
Get Clbits in condition.
- decompositions¶
Get the decompositions of the instruction from the SessionEquivalenceLibrary.
- definition¶
Return definition in terms of other basic gates.
- duration¶
Get the duration.
- label¶
Return instruction label
- name¶
Return the name.
- num_clbits¶
Return the number of clbits.
- num_qubits¶
Return the number of qubits.
- params¶
return instruction params.
- pattern¶
Returns the permutation pattern defining this permutation.
- unit¶
Get the time unit of duration.