z iSrSSKJr SSKJr SSKrSSKrSSKrSSK J r SSK J r SSK Jr SSKJrJr SS KJr S S KJr S r"S S\ 5r"SS\ 5rSrg)zDiagonal matrix circuit.) annotations)SequenceN)Gate)QuantumCircuit) CircuitError)AnnotatedOperationInverseModifier)deprecate_func)UCRZGateg|=cF^\rSrSrSr\"SSSS9S U4Sjj5rSrU=r$) Diagonal"z/Circuit implementing a diagonal transformation.z2.1zUse DiagonalGate instead.z in Qiskit 3.0)sinceadditional_msgremoval_timelinec>[RU5 [[R"[ U555n[ TU]USS9 UR[U5UR5 g)a< Args: diag: List of the :math:`2^k` diagonal entries (for a diagonal gate on :math:`k` qubits). Raises: CircuitError: if the list of the diagonal entries or the qubit list is in bad format; if the number of diagonal entries is not :math:`2^k`, where :math:`k` denotes the number of qubits. r)nameN) DiagonalGate _check_inputintmathlog2lensuper__init__appendqubitsselfdiag num_qubits __class__s k/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/circuit/library/generalized_gates/diagonal.pyrDiagonal.__init__%sS !!$'3t9-.  *5 L& 4r!zSequence[complex]returnNone) __name__ __module__ __qualname____firstlineno____doc__r r__static_attributes__ __classcell__r#s@r$rr"s&92( 5  5r&rc`^\rSrSrSrS U4SjjrSrU4SjrS S Sjjr\ S5r Sr U=r $) r;aA generic diagonal quantum gate. Matrix form: .. math:: \text{DiagonalGate}\ q_0, q_1, .., q_{n-1} = \begin{pmatrix} D[0] & 0 & \dots & 0 \\ 0 & D[1] & \dots & 0 \\ \vdots & \vdots & \ddots & 0 \\ 0 & 0 & \dots & D[n-1] \end{pmatrix} Diagonal gates are useful as representations of Boolean functions, as they can map from :math:`\{0,1\}^{2^n}` to :math:`\{0,1\}^{2^n}` space. For example a phase oracle can be seen as a diagonal gate with :math:`\{1, -1\}` on the diagonals. Such an oracle will induce a :math:`+1` or :math`-1` phase on the amplitude of any corresponding basis state. Diagonal gates appear in many classically hard oracular problems such as Forrelation or Hidden Shift circuits. Diagonal gates are represented and simulated more efficiently than a dense :math:`2^n \times 2^n` unitary matrix. The reference implementation is via the method described in Theorem 7 of [1]. The code is based on Emanuel Malvetti's semester thesis at ETH in 2018, supervised by Raban Iten and Prof. Renato Renner. References: [1] Shende et al., Synthesis of Quantum Logic Circuits, 2009 `arXiv:0406176 `_ c>URU5 [[R"[ U555n[ TU]SX!5 g)ze Args: diag: list of the :math:`2^k` diagonal entries (for a diagonal gate on :math:`k` qubits). diagonalN)rrrrrrrrs r$rDiagonalGate.__init___s9 $3t9-.  Z6r&cURVs/sHn[R"U5PM nn[U5n[ UR 5nUS:a/n[ SUS5H/n[X&X&S-5uX&S-'nURU5 M1 [[R"U55n[[ UR U- S-UR 55n UR U- n [U5n URX/U -5 US-nUS:aMU=RUS- slX@lgs snf)Nrr )paramscmathphaserrr"range _extract_rzrrrrlistr global_phase definition) r z diag_phasesncircuit angles_rzirz_anglenum_act_qubits ctrl_qubits target_qubitucrzs r$_defineDiagonalGate._defineis 04{{;{!u{{1~{ ;   11fI1a^0;KNK\]X]L^0_- F#X  *$!1.NuT__~%E%I4??[\K??^;LI&D NN4+!= > !GA1f  A.!'[U[5(a [U5$[[TU] U55$)z{Diagonal Gate parameter should accept complex (in addition to the Gate parameter types) and always return build-in complex.) isinstancecomplexrvalidate_parameter)r parameterr#s r$rRDiagonalGate.validate_parameters2 i ) )9% %575i@A Ar&cU(a[UR5[5$[URVs/sHn[ R "U5PM sn5$s snf)z(Return the inverse of the diagonal gate.)rcopyr rr:npconj)r annotatedentrys r$inverseDiagonalGate.inversesA %diik?C CERWWU^EFFEs A cj[U[[R45(d [ S5e[ R "[U55nUS:dUR5(d [ S5e[R"[R"U5S[S9(d [ S5eg)z%Check if ``diag`` is in valid format.z2Diagonal entries must be in a list or numpy array.r z!6!6!8!8]^ ^{{266$<6UV V7r&)rAr()F)rYbool) r+r,r-r.r/rrMrRr[ staticmethodrr0r1r2s@r$rr;s5!F7"0BGWWr&rcX-S- nX- nX#4$)z Extract a Rz rotation (angle given by first output) such that exp(j*phase)*Rz(z_angle) is equal to the diagonal matrix with entires exp(1j*ph1) and exp(1j*ph2). g@r')phi1phi2r<z_angles r$r>r>s [C EkG >r&)r/ __future__rcollections.abcrr;rnumpyrWqiskit.circuit.gaterqiskit.circuit.quantumcircuitrqiskit.circuit.exceptionsr"qiskit.circuit.annotated_operationrr qiskit.utils.deprecationr rLr rcrrr>r'r&r$rssR"$ $82R3 5~52^W4^WBr&