z iSrSSKJr SSKJr SSKrSSKJr SSK J r SSK J r J r "SS \5rS S jrS SS jjrg)z)Instantaneous quantum polynomial circuit.) annotations)SequenceN)QuantumCircuit)deprecate_func)py_iqp py_random_iqpcF^\rSrSrSr\"SSSS9S U4Sjj5rSrU=r$) IQPaInstantaneous quantum polynomial (IQP) circuit. The circuit consists of a column of Hadamard gates, a column of powers of T gates, a sequence of powers of CS gates (up to :math:`\frac{n^2-n}{2}` of them), and a final column of Hadamard gates, as introduced in [1]. The circuit is parameterized by an n x n interactions matrix. The powers of each T gate are given by the diagonal elements of the interactions matrix. The powers of the CS gates are given by the upper triangle of the interactions matrix. Reference Circuit: .. plot:: :alt: Diagram illustrating the previously described circuit. from qiskit.circuit.library import IQP A = [[6, 5, 3], [5, 4, 5], [3, 5, 1]] circuit = IQP(A) circuit.draw('mpl') Expanded Circuit: .. plot:: :alt: Diagram illustrating the previously described circuit. from qiskit.circuit.library import IQP from qiskit.visualization.library import _generate_circuit_library_visualization A = [[6, 5, 3], [5, 4, 5], [3, 5, 1]] circuit = IQP(A) _generate_circuit_library_visualization(circuit.decompose()) References: [1] M. J. Bremner et al. Average-case complexity versus approximate simulation of commuting quantum computations, Phys. Rev. Lett. 117, 080501 (2016). `arXiv:1504.07999 `_ z2.1z4Use the qiskit.circuit.library.iqp function instead.z in Qiskit 3.0)sinceadditional_msgremoval_timelinec>[U5n[TU]"URSUR06 UR UR 5URSS9 g)zCreate IQP circuit. Args: interactions: input n-by-n symmetric matrix. Raises: CircuitError: if the inputs is not as symmetric matrix. nameT)qubitsinplaceN)iqpsuper__init__qregsrcomposeto_gater)self interactionscircuit __class__s T/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/circuit/library/iqp.pyr IQP.__init__CsFl# '--;gll; W__&t{{D I)rzlist | np.ndarrayreturnNone) __name__ __module__ __qualname____firstlineno____doc__rr__static_attributes__ __classcell__)rs@rr r s-(TM( J  Jrr c8[U5n[R"U5R[R5nUS:a/Ub,[R "U5nSUR SS5-nOSn[R"[U5SS9nX4l U$)aInstantaneous quantum polynomial time (IQP) circuit. The circuit consists of a column of Hadamard gates, a column of powers of T gates, a sequence of powers of CS gates (up to :math:`\frac{n^2-n}{2}` of them), and a final column of Hadamard gates, as introduced in [1]. The circuit is parameterized by an :math:`n \times n` interactions matrix. The powers of each T gate are given by the diagonal elements of the interactions matrix. The powers of the CS gates are given by the upper triangle of the interactions matrix. Reference Circuit: .. plot:: :alt: Diagram illustrating the previously described circuit. from qiskit.circuit.library import iqp A = [[6, 5, 3], [5, 4, 5], [3, 5, 1]] circuit = iqp(A) circuit.draw("mpl") Expanded Circuit: .. plot:: :alt: Diagram illustrating the previously described circuit. from qiskit.circuit.library import iqp from qiskit.visualization.library import _generate_circuit_library_visualization A = [[6, 5, 3], [5, 4, 5], [3, 5, 1]] circuit = iqp(A) _generate_circuit_library_visualization(circuit) References: [1] M. J. Bremner et al. Average-case complexity versus approximate simulation of commuting quantum computations, Phys. Rev. Lett. 117, 080501 (2016). `arXiv:1504.07999 `_ Args: interactions: The interactions as symmetric square matrix. If ``None``, then the ``num_qubits`` argument must be set and a random IQP circuit will be generated. Returns: An IQP circuit. ziqp: ;rT legacy_qubits) lennpasarrayastypeint64 array_strreplacer_from_circuit_datarr)r num_qubitslabelrrs rrrVsb\"J::l+22288rDse0"$)3D;J.;J|=)==D r