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

Linear Approximation in Frequency Domain01:26

Linear Approximation in Frequency Domain

119
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear....
119
Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule01:10

Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule

1.4K
In the AX proton spin system, proton A can sense the two spin states of a coupled proton X, resulting in a doublet NMR signal with two peaks of equal (1:1) intensity. When proton A is coupled to two equivalent protons (AX2 spin system), the spin states of each X can be aligned with or against the external field, creating three possible scenarios. This results in a 1:2:1  triplet signal, where the central peak corresponds to the chemical shift of A and is twice as large or intense as the...
1.4K
Fast Fourier Transform01:10

Fast Fourier Transform

406
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...
406
Linear Approximation in Time Domain01:21

Linear Approximation in Time Domain

109
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
109
Block Diagram Reduction01:22

Block Diagram Reduction

251
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
251
Quantum Numbers02:43

Quantum Numbers

34.9K
It is said that the energy of an electron in an atom is quantized; that is, it can be equal only to certain specific values and can jump from one energy level to another but not transition smoothly or stay between these levels.
34.9K

You might also read

Related Articles

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

Sort by
Same author

Reducing T-count and T-depth in approximate quantum Fourier transform circuits.

Scientific reports·2025
Same author

Comparison of Microplastics between Lung Tissues and Intestinal Contents in Finless Porpoises (<i>Neophocaena asiaeorientalis</i>).

Environmental science & technology·2025
Same author

Non-reciprocity in photon polarization based on direction of polarizer under gravitational fields.

Scientific reports·2024
Same author

Microplastic Contamination of a Benthic Ecosystem in a Hydrothermal Vent.

Environmental science & technology·2024
Same author

Non-Markovian cost function for quantum error mitigation with Dirac Gamma matrices representation.

Scientific reports·2023
Same author

First Report of Stunt Nematode, <i>Tylenchorhynchus zeae</i>, on Corn in Republic of Korea.

Plant disease·2023

Related Experiment Video

Updated: Jul 28, 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

9.0K

Reducing CNOT count in quantum Fourier transform for the linear nearest-neighbor architecture.

Byeongyong Park1,2, Doyeol Ahn3,4,5

  • 1Department of Electrical and Computer Engineering and Center for Quantum Information Processing, University of Seoul, 163 Seoulsiripdae-ro, Dongdaemun-gu, Seoul, 02504, Republic of Korea.

Scientific Reports
|May 27, 2023
PubMed
Summary

We developed a new linear nearest-neighbor (NN) circuit design for the quantum Fourier transform (QFT). This design significantly reduces the number of CNOT gates, improving efficiency for quantum hardware with NN architectures.

More Related Videos

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

609
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.6K

Related Experiment Videos

Last Updated: Jul 28, 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

9.0K
Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit
05:30

Large Scale Energy Efficient Sensor Network Routing Using a Quantum Processor Unit

Published on: September 8, 2023

609
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.6K

Area of Science:

  • Quantum Computing
  • Quantum Algorithms
  • Circuit Design

Background:

  • Quantum hardware limitations often require nearest-neighbor (NN) architectures.
  • CNOT gates are crucial for adapting quantum circuits to NN architectures but are costly due to error rates and execution times.

Purpose of the Study:

  • To propose a novel linear nearest-neighbor (LNN) circuit design for the quantum Fourier transform (QFT).
  • To reduce the number of CNOT gates required for QFT implementation on NN architectures.

Main Methods:

  • Developed a new LNN circuit design for QFT.
  • Compared the proposed QFT circuits with conventional designs using the Qiskit transpiler for IBM quantum computers.

Main Results:

  • The proposed LNN QFT circuit design uses approximately 40% fewer CNOT gates than previous LNN QFT circuits.
  • Transpilation results showed a substantial advantage in CNOT gate count for the proposed QFT circuits on NN architectures.

Conclusions:

  • The novel LNN QFT circuit design offers a significant reduction in CNOT gate usage.
  • This design provides a promising foundation for efficient QFT implementation on quantum hardware with NN constraints.