Related Experiment Video
Updated: Jun 9, 2025

Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
Quantum Fourier Transform Using Dynamic Circuits
Elisa Bäumer1, Vinay Tripathi2, Alireza Seif3
1IBM Quantum, <a href="https://ror.org/02js37d36">IBM Research-Zurich</a>, 8803 Rüschlikon, Switzerland.
Abstract:
In dynamic quantum circuits, classical information from midcircuit measurements is fed forward during circuit execution. This emerging capability of quantum computers confers numerous advantages that can enable more efficient and powerful protocols by drastically reducing the resource requirements for certain core algorithmic primitives. In particular, in the case of the n-qubit quantum Fourier transform followed immediately by measurement, the scaling of resource requirements is reduced from O(n^{2}) two-qubit gates in an all-to-all connectivity in the standard unitary formulation to O(n) midcircuit measurements in its dynamic counterpart without any connectivity constraints. Here, we demonstrate the advantage of dynamic quantum circuits for the quantum Fourier transform on IBM's superconducting quantum hardware with certified process fidelities of >50% on up to 16 qubits and >1% on up to 37 qubits, exceeding previous reports across all quantum computing platforms. These results are enabled by our contribution of an efficient method for certifying the process fidelity, as well as of a dynamical decoupling protocol for error suppression during midcircuit measurements and feed forward within a dynamic quantum circuit that we call "feed-forward-compensated dynamical decoupling." Our results demonstrate the advantages of leveraging dynamic circuits in optimizing the compilation of quantum algorithms.
Related Concept Videos
Discrete-time Fourier transform
One of the notable...
Frequency Response of a Circuit
The transfer function is pivotal in characterizing how these circuits react to various frequencies, facilitating a profound understanding of their behavior. An essential parameter is the time constant, signifying the...
Discrete Fourier Transform
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Discrete-Time Fourier Series
For a discrete-time periodic signal x[n]...
Basic signals of Fourier Transform
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...

