z iSrSSKJr SSKJrJr SSKJr "SS\5r"SS\5r "S S \5r "S S \5r g )z5Compute the sum of two equally sized qubit registers.) annotations)QuantumCircuitGate)deprecate_funcc^^\rSrSrSr\"SSSS9S S U4Sjjj5r\S Sj5rS r U=r $) AdderaBCompute the sum of two equally sized qubit registers. For two registers :math:`|a\rangle_n` and :math:`|b\rangle_n` with :math:`n` qubits each, an adder performs the following operation .. math:: |a\rangle_n |b\rangle_n \mapsto |a\rangle_n |a + b\rangle_{n + 1}. The quantum register :math:`|a\rangle_n` (and analogously :math:`|b\rangle_n`) .. math:: |a\rangle_n = |a_0\rangle \otimes \cdots \otimes |a_{n - 1}\rangle, for :math:`a_i \in \{0, 1\}`, is associated with the integer value .. math:: a = 2^{0}a_{0} + 2^{1}a_{1} + \cdots + 2^{n - 1}a_{n - 1}. z2.1)a8Use the adder gates provided in qiskit.circuit.library.arithmetic instead. The gate type depends on the adder kind: fixed, half, full are represented by ModularAdderGate, HalfAdderGate, FullAdderGate, respectively. For different adder implementations, see https://quantum.cloud.ibm.com/docs/api/qiskit/synthesis.z in Qiskit 3.0)sinceadditional_msgremoval_timelinec,>[TU]US9 Xlg)o Args: num_state_qubits: The number of qubits in each of the registers. name: The name of the circuit. )nameN)super__init___num_state_qubits)selfnum_state_qubitsr __class__s h/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/circuit/library/arithmetic/adders/adder.pyrAdder.__init__-s d#!1cUR$zvThe number of state qubits, i.e. the number of bits in each input register. Returns: The number of state qubits. rrs rrAdder.num_state_qubits@%%%rr)r)rintrstrreturnNoner!r) __name__ __module__ __qualname____firstlineno____doc__rrpropertyr__static_attributes__ __classcell__rs@rrrsG. ) 22 2&&rrcN^\rSrSrSrSSU4Sjjjr\S Sj5rSrSr U=r $) HalfAdderGateJa]Compute the sum of two equally-sized qubit registers, including a carry-out bit. For two registers :math:`|a\rangle_n` and :math:`|b\rangle_n` with :math:`n` qubits each, an adder performs the following operation .. math:: |a\rangle_n |b\rangle_n \mapsto |a\rangle_n |a + b\rangle_{n + 1}. The quantum register :math:`|a\rangle_n` (and analogously :math:`|b\rangle_n`) .. math:: |a\rangle_n = |a_0\rangle \otimes \cdots \otimes |a_{n - 1}\rangle, for :math:`a_i \in \{0, 1\}`, is associated with the integer value .. math:: a = 2^{0}a_{0} + 2^{1}a_{1} + \cdots + 2^{n - 1}a_{n - 1}. c`>US:a [S5e[TU] SSU-S-/US9 Xlg)rNeed at least 1 state qubit. HalfAdderlabelN ValueErrorrrrrrr6rs rrHalfAdderGate.__init__b@ a ;< < a*:&:Q&>%P!1rcUR$rrrs rrHalfAdderGate.num_state_qubitsnrrc>SSKJn U"UR5Ulg)?Populates self.definition with some decomposition of this gate.r)adder_ripple_r25N)qiskit.synthesis.arithmeticr@r definition)rr@s r_defineHalfAdderGate._definews@ +4+@+@ArrrBNrrr6z str | Noner!r"r# r$r%r&r'r(rr)rrCr*r+r,s@rr.r.Js2. 2 2&&BBrr.cN^\rSrSrSrSSU4Sjjjr\S Sj5rSrSr U=r $) ModularAdderGateabCompute the sum modulo :math:`2^n` of two :math:`n`-sized qubit registers. For two registers :math:`|a\rangle_n` and :math:`|b\rangle_n` with :math:`n` qubits each, an adder performs the following operation .. math:: |a\rangle_n |b\rangle_n \mapsto |a\rangle_n |a + b \text{ mod } 2^n\rangle_n. The quantum register :math:`|a\rangle_n` (and analogously :math:`|b\rangle_n`) .. math:: |a\rangle_n = |a_0\rangle \otimes \cdots \otimes |a_{n - 1}\rangle, for :math:`a_i \in \{0, 1\}`, is associated with the integer value .. math:: a = 2^{0}a_{0} + 2^{1}a_{1} + \cdots + 2^{n - 1}a_{n - 1}. cZ>US:a [S5e[TU] SSU-/US9 Xlg)rr1r2 ModularAdderr4r5Nr7r9s rrModularAdderGate.__init__s; a ;< < -=)=rO!1rcUR$rrrs rr!ModularAdderGate.num_state_qubitsrrc>SSKJn U"UR5Ulg)r?r)adder_modular_v17N)rArRrrB)rrRs rrCModularAdderGate._definesA ,D,A,ABrrErFrGr#rHr,s@rrJrJs2. 2 2&&CCrrJcN^\rSrSrSrSSU4Sjjjr\S Sj5rSrSr U=r $) FullAdderGateaCompute the sum of two :math:`n`-sized qubit registers, including carry-in and -out bits. For two registers :math:`|a\rangle_n` and :math:`|b\rangle_n` with :math:`n` qubits each, an adder performs the following operation .. math:: |c_{\text{in}}\rangle_1 |a\rangle_n |b\rangle_n \mapsto |a\rangle_n |c_{\text{in}} + a + b \rangle_{n + 1}. The quantum register :math:`|a\rangle_n` (and analogously :math:`|b\rangle_n`) .. math:: |a\rangle_n = |a_0\rangle \otimes \cdots \otimes |a_{n - 1}\rangle, for :math:`a_i \in \{0, 1\}`, is associated with the integer value .. math:: a = 2^{0}a_{0} + 2^{1}a_{1} + \cdots + 2^{n - 1}a_{n - 1}. c`>US:a [S5e[TU] SSU-S-/US9 Xlg)rr1r2 FullAdderr4r5Nr7r9s rrFullAdderGate.__init__r;rcUR$rrrs rrFullAdderGate.num_state_qubitsrrc<SSKJn U"URSS9Ulg)zresL<"/32&N2&j4BD4Bn4Ct4Cn3OD3Or