Related Experiment Video
Updated: Jul 28, 2025

Generation and Coherent Control of Pulsed Quantum Frequency Combs
Published on: June 8, 2018
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.
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.
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.
Related Concept Videos
Linear Approximation in Frequency Domain
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....
Interpreting ¹H NMR Signal Splitting: The (n + 1) Rule
Fast Fourier Transform
The computational efficiency of the FFT becomes...
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
Block Diagram Reduction
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
Quantum Numbers

