gdZddlmZddlmZddlZddlmZddl m Z ddl m Z m Z Gdd eZddZ dddZdS)z)Instantaneous quantum polynomial circuit.) annotations)SequenceN)QuantumCircuit)deprecate_func)py_iqp py_random_iqpcLeZdZdZedddd fd ZxZS) 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 `_ z1.3z4Use the qiskit.circuit.library.iqp function instead.T)sinceadditional_msgpending interactionslist | np.ndarrayreturnNonect|}tj|jd|ji|||jddS)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)selfrcircuit __class__s P/granary/edev/quantum/lib/python3.11/site-packages/qiskit/circuit/library/iqp.pyrz IQP.__init__Cs\l##'-;gl;;; W__&&t{D IIIII)rrrr)__name__ __module__ __qualname____doc__rr __classcell__)rs@rr r s{((T^M J J J J J  J J J J Jr r rSequence[Sequence[int]]rrcJt|}tj|tj}|dkr0|.tj|}d|ddz}nd}tjt|d}||_ |S) 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. Nziqp: ;rTadd_regs) lennpasarrayastypeint64 array_strreplacer_from_circuit_datarr)r num_qubitslabelrrs rrrVsb\""J:l++2228<rCs0/""""""$$$$$$))))))333333DDDDDDDD;J;J;J;J;J.;J;J;J|====Dr