ó Óz iå ã óL•SrSSKJr SSKJr SSKJr S S\S\ S\S \4S jjrg ) z& Circuit synthesis for a QFT circuit. é)ÚQuantumCircuit)Úsynth_qft_lineé)Ú_warn_if_precision_lossÚ num_qubitsÚdo_swapsÚapproximation_degreeÚreturncó`•[X- S- 5 [R"[XU5SS9$)u_Construct 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] `_ rT)Ú legacy_qubits)rrÚ_from_circuit_dataÚ_synth_qft_line)rrr s Ú`/home/james-whalen/.local/lib/python3.13/site-packages/qiskit/synthesis/qft/qft_decompose_lnn.pyrrs6€ôB˜JÑ=ÀÑAÔBä × ,Ò ,ä˜ Ð.BÓCØñ ðóN)Tr) Ú__doc__Úqiskit.circuitrÚ qiskit._accelerate.synthesis.qftrrÚqft_decompose_fullrÚintÚbool©rrÚrsAðñõ*ÝNå7ðIJñ'Øð'Ø#ð'ØBEð'àö'r