§ º³Ùg ãóJ—dZddlmZddlZddlmZddlmZm Z d d „Z d d „Z dS) z@Synthesis algorithm for Permutation gates for full-connectivity.é)Ú annotationsN)ÚQuantumCircuit)Ú_synth_permutation_basicÚ_synth_permutation_acgÚpatternúlist[int] | np.ndarray[int]ÚreturnrcóH—tjt|¦«d¬¦«S)aPSynthesize a permutation circuit for a fully-connected architecture using sorting. More precisely, if the input permutation is a cycle of length ``m``, then this creates a quantum circuit with ``m-1`` SWAPs (and of depth ``m-1``); if the input permutation consists of several disjoint cycles, then each cycle is essentially treated independently. 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 position ``1``, etc. Returns: The synthesized quantum circuit. T©Úadd_regs)rÚ_from_circuit_datar©rs úc/granary/edev/quantum/lib/python3.11/site-packages/qiskit/synthesis/permutation/permutation_full.pyÚsynth_permutation_basicrs$€õ( Ô ,Õ-EÀgÑ-NÔ-NÐY]Ð ^Ñ ^Ô ^Ð^ócóH—tjt|¦«d¬¦«S)uASynthesize a permutation circuit for a fully-connected architecture using the Alon, Chung, Graham method. This produces a quantum circuit of depth 2 (measured in the number of SWAPs). This implementation is based on the Proposition 4.1 in reference [1] with the detailed proof given in Theorem 2 in reference [2] 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 position ``1``, etc. Returns: The synthesized quantum circuit. References: 1. N. Alon, F. R. K. Chung, and R. L. Graham. *Routing Permutations on Graphs Via Matchings.*, Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing(1993). Pages 583–591. `(Extended abstract) 10.1145/167088.167239 `_ 2. N. Alon, F. R. K. Chung, and R. L. Graham. *Routing Permutations on Graphs Via Matchings.*, `(Full paper) `_ Tr )rr rrs rÚsynth_permutation_acgr0s$€õ< Ô ,Õ-CÀGÑ-LÔ-LÐW[Ð \Ñ \Ô \Ð\r)rrr r) Ú__doc__Ú __future__rÚnumpyÚnpÚqiskit.circuit.quantumcircuitrÚ(qiskit._accelerate.synthesis.permutationrrrr©rrúrs¢ððGÐFà"Ð"Ð"Ð"Ð"Ð"àÐÐÐØ8Ð8Ð8Ð8Ð8Ð8ððððððððð _ð_ð_ð_ð.]ð]ð]ð]ð]ð]r