gdZddlmZddlmZmZddlmZGddeZGddeZ Gd d eZ Gd d eZ d S)z5Compute the sum of two equally sized qubit registers.) annotations)QuantumCircuitGate)deprecate_funccfeZdZdZedddddfd Zedd ZxZS)AdderanCompute 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}. z1.3)a2Use 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://docs.quantum.ibm.com/api/qiskit/synthesis.T)sinceadditional_msgpendingnum_state_qubitsintnamestrreturnNonecZt|||_dS) Args: num_state_qubits: The number of qubits in each of the registers. name: The name of the circuit. )rN)super__init___num_state_qubits)selfr r __class__s d/granary/edev/quantum/lib/python3.11/site-packages/qiskit/circuit/library/arithmetic/adders/adder.pyrzAdder.__init__-s. d###!1c|jSzThe number of state qubits, i.e. the number of bits in each input register. Returns: The number of state qubits. rrs rr zAdder.num_state_qubits@ %%r)r)r r rrrrrr ) __name__ __module__ __qualname____doc__rrpropertyr __classcell__rs@rrrs.^    222222  2&&&X&&&&&rrcDeZdZdZd d fd Zedd Zd ZxZS) HalfAdderGateaCompute 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}. Nr r label str | Nonerrc|dkrtdtdd|zdzg|||_dS)rNeed at least 1 state qubit. HalfAdderr*N ValueErrorrrrrr r*rs rrzHalfAdderGate.__init__bY a  ;<< < a*:&:Q&>%PPP!1rc|jSrrrs rr zHalfAdderGate.num_state_qubitsnrrc@ddlm}||jd|_dS)?Populates self.definition with some decomposition of this gate.r adder_qft_d00halfkindNqiskit.synthesis.arithmeticr:r definitionrr:s r_definezHalfAdderGate._definews3====== (-(=FKKKrNr r r*r+rrr r!r"r#r$rr%r rBr&r's@rr)r)Js. 2 2 2 2 2 2 2&&&X&LLLLLLLrr)cDeZdZdZd d fd Zedd Zd ZxZS)ModularAdderGateaCompute 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}. Nr r r*r+rrc|dkrtdtdd|zg|||_dS)rr-r. ModularAdderr0r1Nr2r4s rrzModularAdderGate.__init__sT a  ;<< < -=)=rOOO!1rc|jSrrrs rr z!ModularAdderGate.num_state_qubitsrrc@ddlm}||jd|_dS)r8rr9fixedr<Nr>rAs rrBzModularAdderGate._defines3====== (-(=GLLLrrCrDr rEr's@rrGrGs. 2 2 2 2 2 2 2&&&X&MMMMMMMrrGcDeZdZdZd d fd Zedd Zd ZxZS) 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}. Nr r r*r+rrc|dkrtdtdd|zdzg|||_dS)rr-r. FullAdderr0r1Nr2r4s rrzFullAdderGate.__init__r5rc|jSrrrs rr zFullAdderGate.num_state_qubitsrrc@ddlm}||jd|_dS)zrYs<;""""""////////3333332&2&2&2&2&N2&2&2&j4L4L4L4L4LD4L4L4Ln4M4M4M4M4Mt4M4M4Mn3O3O3O3O3OD3O3O3O3O3Or