Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Discrete-time Fourier transform01:26

Discrete-time Fourier transform

273
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
273
Frequency Response of a Circuit01:20

Frequency Response of a Circuit

230
Inductive circuits present intriguing challenges in electrical engineering, particularly during the transition from the time domain to the frequency domain. This transformation involves converting inductors into impedances and utilizing phasor representation.
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...
230
Discrete Fourier Transform01:15

Discrete Fourier Transform

225
The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
225
Fast Fourier Transform01:10

Fast Fourier Transform

273
The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
273
Discrete-Time Fourier Series01:20

Discrete-Time Fourier Series

229
The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
For a discrete-time periodic signal x[n]...
229
Basic signals of Fourier Transform01:07

Basic signals of Fourier Transform

475
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
475

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

Impact of intrapartum quality improvement interventions on stillbirths: a systematic review and meta-analysis.

Therapeutic advances in reproductive health·2026
Same author

Signatures of Quantum Phase Transitions in Driven Dissipative Spin Chains.

Physical review letters·2026
Same author

Demonstration of high-fidelity entangled logical qubits using transmons.

Nature communications·2026
Same author

Randomized Benchmarking with Non-Markovian Noise and Realistic Finite-Time Gates.

Physical review letters·2025
Same author

Scaling Advantage in Approximate Optimization with Quantum Annealing.

Physical review letters·2025
Same author

Benchmarking Quantum Gates and Circuits.

Chemical reviews·2025
Same journal

Erratum: Bacterial Turbulence at Compressible Fluid Interfaces [Phys. Rev. Lett. 136, 138301 (2026)].

Physical review letters·2026
Same journal

Unveiling Light-Quark Yukawa Flavor Structure via Dihadron Fragmentation at Lepton Colliders.

Physical review letters·2026
Same journal

Adaptable Route to Fast Coherent State Transport via Bang-Bang-Bang Protocols.

Physical review letters·2026
Same journal

Topological Transition and Emergence of Elasticity of Dislocation in Skyrmion Lattice: Beyond Kittel's Magnetic-Polar Analogy.

Physical review letters·2026
Same journal

Pound-Drever-Hall Method for Superconducting-Qubit Readout.

Physical review letters·2026
Same journal

Coupling a ^{73}Ge Nuclear Spin to an Electrostatically Defined Quantum Dot in Silicon.

Physical review letters·2026
See all related articles

Related Experiment Video

Updated: Jun 9, 2025

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

8.9K

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.

Physical Review Letters
|October 25, 2024
PubMed
Summary
This summary is machine-generated.

Dynamic quantum circuits significantly reduce resource requirements for quantum algorithms like the Quantum Fourier Transform. This study demonstrates their advantage on IBM hardware, achieving high fidelities for efficient quantum computing.

More Related Videos

Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform
05:39

Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform

Published on: August 2, 2019

9.5K
Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
09:23

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators

Published on: May 30, 2014

14.5K

Related Experiment Videos

Last Updated: Jun 9, 2025

Generation and Coherent Control of Pulsed Quantum Frequency Combs
06:42

Generation and Coherent Control of Pulsed Quantum Frequency Combs

Published on: June 8, 2018

8.9K
Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform
05:39

Scalable Quantum Integrated Circuits on Superconducting Two-Dimensional Electron Gas Platform

Published on: August 2, 2019

9.5K
Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators
09:23

Quantum State Engineering of Light with Continuous-wave Optical Parametric Oscillators

Published on: May 30, 2014

14.5K

Area of Science:

  • Quantum Computing
  • Quantum Information Science
  • Computer Science

Background:

  • Dynamic quantum circuits utilize midcircuit measurements and feed-forward of classical information.
  • This capability offers significant resource reductions for quantum algorithms.
  • The Quantum Fourier Transform (QFT) is a key primitive benefiting from dynamic circuits.

Purpose of the Study:

  • To demonstrate the practical advantage of dynamic quantum circuits for the Quantum Fourier Transform.
  • To achieve high process fidelities for dynamic quantum circuits on superconducting hardware.
  • To introduce novel methods for fidelity certification and error suppression in dynamic circuits.

Main Methods:

  • Implementation of dynamic quantum circuits for QFT on IBM's superconducting quantum hardware.
  • Development of an efficient process fidelity certification method.
  • Application of a "feed-forward-compensated dynamical decoupling" protocol for error suppression.

Main Results:

  • Demonstrated dynamic QFT on up to 37 qubits with certified process fidelities exceeding previous reports (>50% on 16 qubits, >1% on 37 qubits).
  • Achieved significant reduction in resource requirements compared to standard unitary QFT formulations.
  • Validated the effectiveness of the novel error suppression protocol.

Conclusions:

  • Dynamic quantum circuits offer a powerful approach to optimize quantum algorithm compilation.
  • The demonstrated high fidelities pave the way for more complex dynamic quantum computations.
  • This work highlights the potential of dynamic circuits for advancing practical quantum computing.