g RdZddlZddlmZddlmZddlmZ d de d e d e d efd Z dS)z& Circuit synthesis for a QFT circuit. N)QuantumCircuit)#_append_reverse_permutation_lnn_kms)_warn_if_precision_lossT num_qubitsdo_swapsapproximation_degreereturncDt||z dz t|}t|D]}||dz t||dz D]}||z dz||z dzkr|t jd||z dzzz ||z |zdz |||z |zdz ||z |zdz |t j d||z dzzz ||z |zdz |||z |zdz ||z |zdz |||z |zdz ||z |zdz |t jd||z dzzz ||z |zdz 0|||z |zdz ||z |zdz |||z |zdz ||z |zdz |||z |zdz ||z |zdz |st|||S)uConstruct a circuit for the Quantum Fourier Transform using linear neighbor connectivity. The construction is based on Fig 2.b in Fowler et al. [1]. .. note:: With the default value of ``do_swaps = True``, this synthesis algorithm creates a circuit that faithfully implements the QFT operation. When ``do_swaps = False``, this synthesis algorithm creates a circuit that corresponds to "QFT-with-reversal": applying the QFT and reversing the order of its output qubits. Args: num_qubits: The number of qubits on which the Quantum Fourier Transform acts. approximation_degree: The degree of approximation (0 for no approximation). It is possible to implement the QFT approximately by ignoring controlled-phase rotations with the angle beneath a threshold. This is discussed in more detail in https://arxiv.org/abs/quant-ph/9601018 or https://arxiv.org/abs/quant-ph/0403071. do_swaps: Whether to synthesize the "QFT" or the "QFT-with-reversal" operation. Returns: A circuit implementing the QFT operation. References: 1. A. G. Fowler, S. J. Devitt, and L. C. L. Hollenberg, *Implementation of Shor's algorithm on a linear nearest neighbour qubit array*, Quantum Info. Comput. 4, 4 (July 2004), 237–251. `arXiv:quant-ph/0402196 [quant-ph] `_ r) rrrangehpnppicxr)rrr qcijs \/granary/edev/quantum/lib/python3.11/site-packages/qiskit/synthesis/qft/qft_decompose_lnn.pysynth_qft_linersBJ)==ABBB  # #B :  FF Z!^q*q.)) F FA1uqy:(<r!s))))))dddddd777777IJ999#9BE9999999r