gdZddlmZddlZddlmZddlmZddlm Z ddl m Z Gdd eZ Gd d eZ dS) zPermutation circuit (the old way to specify permutations, which is required for backward compatibility and which will be eventually deprecated) and the permutation gate (the new way to specify permutations, allowing a variety of synthesis algorithms). ) annotationsN)QuantumCircuit)Gate) CircuitError)deprecate_funccReZdZdZeddd ddfd ZxZS) Permutationz(An n_qubit circuit that permutes qubits.z1.3TzUse PermutationGate instead.)sincependingadditional_msgN num_qubitsintpatternlist[int] | np.ndarray | Noneseed int | NonereturnNonech|Qt|tt|krtdt j|}nHtj|}t j|}| |dt j | ddz}t ||ddlm}||}||_|j}|||dS) a+Return an n_qubit permutation circuit implemented using SWAPs. Args: num_qubits: circuit width. pattern: permutation pattern, describing which qubits occupy the positions 0, 1, 2, etc. after applying the permutation, that is ``pattern[k] = m`` when the permutation maps qubit ``m`` to position ``k``. As an example, the pattern ``[2, 4, 3, 0, 1]`` means that qubit ``2`` goes to position ``0``, qubit ``4`` goes to the position ``1``, etc. The pattern can also be ``None``, in which case a random permutation over ``num_qubits`` is created. seed: random seed in case a random permutation is requested. Raises: CircuitError: if permutation pattern is malformed. Reference Circuit: .. plot:: :alt: Diagram illustrating the previously described circuit. from qiskit.circuit.library import Permutation A = [2,4,3,0,1] circuit = Permutation(5, A) circuit.draw('mpl') Expanded Circuit: .. plot:: :alt: Diagram illustrating the previously described circuit. from qiskit.circuit.library import Permutation from qiskit.visualization.library import _generate_circuit_library_visualization A = [2,4,3,0,1] circuit = Permutation(5, A) _generate_circuit_library_visualization(circuit.decompose()) NGPermutation pattern must be some ordering of 0..num_qubits-1 in a list. permutation_ ,)namersynth_permutation_basic)sortedlistrangernparrayrandom default_rngarangeshuffle array_strreplacesuper__init__qiskit.synthesis.permutationrrqubitsappendto_gate) selfr rrrngrrcircuit all_qubits __class__s j/granary/edev/quantum/lib/python3.11/site-packages/qiskit/circuit/library/generalized_gates/permutation.pyr)zPermutation.__init__s#V  g$uZ'8'8"9"999"]hw''GG)''--Ci ++G KK  W 5 5 = =c3 G GG $/// IHHHHH))'22 [  GOO%%z22222NN)r rrrrrrr)__name__ __module__ __qualname____doc__rr) __classcell__r2s@r3r r sy22^%>\]]]26 @3@3@3@3@3@3^]@3@3@3@3@3r4r cZeZdZdZdfd ZddZd Zedd ZdddZ dZ xZ S)PermutationGatezA gate that permutes qubits.r list[int]rrc(t|}t|tt|krt dt j|t j}t d||gdS)aReturn a permutation gate. Args: pattern: permutation pattern, describing which qubits occupy the positions 0, 1, 2, etc. after applying the permutation, that is ``pattern[k] = m`` when the permutation maps qubit ``m`` to position ``k``. As an example, the pattern ``[2, 4, 3, 0, 1]`` means that qubit ``2`` goes to position ``0``, qubit ``4`` goes to the position ``1``, etc. Raises: CircuitError: if permutation pattern is malformed. Reference Circuit: .. plot:: :alt: Diagram illustrating the previously described circuit. from qiskit.circuit.quantumcircuit import QuantumCircuit from qiskit.circuit.library import PermutationGate A = [2, 4, 3, 0, 1] permutation = PermutationGate(A) circuit = QuantumCircuit(5) circuit.append(permutation, [0, 1, 2, 3, 4]) circuit.draw("mpl") Expanded Circuit: .. plot:: :alt: Diagram illustrating the previously described circuit. from qiskit.circuit.quantumcircuit import QuantumCircuit from qiskit.circuit.library import PermutationGate from qiskit.visualization.library import _generate_circuit_library_visualization A = [2, 4, 3, 0, 1] permutation = PermutationGate(A) circuit = QuantumCircuit(5) circuit.append(permutation, [0, 1, 2, 3, 4]) _generate_circuit_library_visualization(circuit.decompose()) rdtype permutation)rr paramsN) lenrrrrr r!int32r(r))r.rr r2s r3r)zPermutationGate.__init__fsV\\ '??d5#4#455 5 5Y (7"(333 m G9UUUUUr4Nc|durtdt|j}tjd|zd|zf|}t d|zD]{}t |dd|ddddfd|jD}t|dddd}d |||f<||S) z.Return a numpy.array for the Permutation gate.Fz9unable to avoid copy while creating an array as requestedr@Nc g|] }| SrK).0jbits r3 z-PermutationGate.__array__..s#A#A#AqCF#A#A#Ar4) ValueErrorrDrr zerosrbinzfilljoinr) r.rAcopynqmatr permuted_bitprrNs @r3 __array__zPermutationGate.__array__s 5==XYY Y   h2q"u~U333q"u  Aa&&*""2&&ttt,C77#A#A#A#ADL#A#A#ABBL\$$B$'++BCAJJ r4c|S)zParameter validation.rK)r. parameters r3validate_parameterz"PermutationGate.validate_parametersr4np.ndarray[bool]c|jdS)z:Returns the permutation pattern defining this permutation.r)rC)r.s r3rzPermutationGate.patterns{1~r4F annotatedboolcJddlm}t||jS)z'Returns the inverse of the permutation.r)_inverse_pattern)r).qiskit.synthesis.permutation.permutation_utilsrer=r)r.rbres r3inversezPermutationGate.inverses6 TSSSSS'7'7 'E'EFFFFr4cddlm}ddd|jDd}||j}||_|S)Nrr permutation___c34K|]}t|VdS)N)str)rLns r3 z6PermutationGate._qasm_decomposition..s('E'E1A'E'E'E'E'E'Er4)r*rrUrrr-)r.rrouts r3_qasm_decompositionz#PermutationGate._qasm_decompositionshHHHHHHHsxx'E'E 'E'E'EEEHHH%%dl33{{}}r4)rr>rrr5)rr`)F)rbrcrr=) r6r7r8r9r)r\r_propertyrrgrpr:r;s@r3r=r=cs&&2V2V2V2V2V2Vh$XGGGGG       r4r=)r9 __future__rnumpyr qiskit.circuit.quantumcircuitrrqiskit.circuit.exceptionsrqiskit.utils.deprecationrr r=rKr4r3rws #"""""888888......222222333333D3D3D3D3D3.D3D3D3Ncccccdcccccr4