- class MCXRecursive(num_ctrl_qubits, label=None, ctrl_state=None)¶
Implement the multi-controlled X gate using recursion.
Using a single ancilla qubit, the multi-controlled X gate is recursively split onto four sub-registers. This is done until we reach the 3- or 4-controlled X gate since for these we have a concrete implementation that do not require ancillas.
Create new MCX gate.
Methods Defined Here
Get the number of required ancilla qubits.
Invert this gate.
Return the control state of the gate as a decimal integer.
Get the decompositions of the instruction from the SessionEquivalenceLibrary.
Return definition in terms of other basic gates. If the gate has open controls, as determined from self.ctrl_state, the returned definition is conjugated with X without changing the internal _definition.
Get the duration.
Return instruction label
Get name of gate. If the gate has open controls the gate name will become:
where <original_name> is the gate name for the default case of closed control qubits and <ctrl_state> is the integer value of the control state for the gate.
The number of ancilla qubits.
Return the number of clbits.
Get number of control qubits.
The number of control qubits for the gate.
Return the number of qubits.
Get parameters from base_gate.
List of gate parameters.
CircuitError – Controlled gate does not define a base gate
Get the time unit of duration.