Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Analyze of Quantum Fourier Transform Circuit Implementation

Ivan V. Murashko, Constantine C. Korikov

Published Jan 1, 2015• 0 citations
Publisher
DOI
10.1007/978-3-319-23126-6_58

Related papers

Explaining the Design of the Quantum Fourier Transform

Leonidas Deligiannidis

Communications in computer and information science•Jan 1, 2025•0 citations

Implementation of the Quantum Fourier Transform in Quantum Optical Processors Using Linear Optics with Imperfect Circuits

Mohammad Bayat, Mehran Gholipour Shahraki, Mehdi Mirzaee

Abstract This paper investigates the implementation of the Quantum Fourier Transform (QFT) using linear optical devices and the Cooley-Tukey algorithm, with a focus on the impact of device imperfections and phase errors due to optical path differences. It examines real-world defects in optical gate circuits, systematically analyzing these imperfections for systems with two, three, and general γ-qubit states, providing a comprehensive formula for the γ-qubit case.

•Aug 26, 2026•0 citations

Simple implementation of discrete quantum Fourier transform via cavity quantum electrodynamics

Hong‐Fu Wang, Ai‐Dong Zhu, Shou Zhang +1 more

We propose a scheme for implementing discrete quantum Fourier transform in cavity quantum electrodynamics (QED). The experimental implementation is appealingly simple because the combined effect of the complex controlled- R k gate and SWAP gate operations required for implementing discrete quantum Fourier transform in the naive quantum circuit is replaced by the one-step CR k S gate, which can be directly implemented via atom–cavity interaction with the assistance of classical fields. We propose the detailed experimental procedure and analyze the experimental feasibility. The experimental implementation of the scheme would show the full power of quantum algorithm and would open wide prospects for more complicated quantum computation with atoms in QED.

New Journal of Physics•Jan 17, 2011•37 citations

Fourier Transforms and Quantum Computation

Umesh V. Vazirani

Lecture notes in computer science•Jan 1, 2002•5 citations

Quantum Fourier transform in computational basis

S. S. Zhou, T. Loke, Josh Izaac +1 more

arXiv:1511.04818•Quantum Information Processing•Feb 10, 2017•69 citations

t-bit semiclassical quantum Fourier transform

Xiang-Qun Fu, Wan‐Su Bao, Chun Hua Zhou +1 more

Because of the difficulty of building a high-dimensional quantum register, this paper presents an implementation of the high-dimensional quantum Fourier transform (QFT) based on a low-dimensional quantum register. First, we define the t-bit semiclassical quantum Fourier transform. In terms of probability amplitude, we prove that the transform can realize quantum Fourier transformation, illustrate that the requirement for the two-qubit gate reduces obviously, and further design a quantum circuit of the transform. Combining the classical fixed-window method and the implementation of Shor’s quantum factorization algorithm, we then redesign a circuit for Shor’s algorithm, whose required computation resource is approximately equal to that of Parker’s. The requirement for elementary quantum gates for Parker’s algorithm is O(⌈ log N⌉3, and the quantum register for our circuit requires t−1 more dimensions than Parker’s. However, our circuit is t 2 times as fast as Parker’s, where t is the width of the window.

Chinese Science Bulletin•Jan 1, 2012•3 citations
We propose a scheme for implementing discrete quantum Fourier transform in cavity quantum electrodynamics (QED). The experimental implementation is appealingly simple because the combined effect of the complex controlled- R k gate and SWAP gate operations required for implementing discrete quantum Fourier transform in the naive quantum circuit is replaced by the one-step CR k S gate, which can be directly implemented via atom–cavity interaction with the assistance of classical fields. We propose the detailed experimental procedure and analyze the experimental feasibility. The experimental implementation of the scheme would show the full power of quantum algorithm and would open wide prospects for more complicated quantum computation with atoms in QED.
Because of the difficulty of building a high-dimensional quantum register, this paper presents an implementation of the high-dimensional quantum Fourier transform (QFT) based on a low-dimensional quantum register. First, we define the t-bit semiclassical quantum Fourier transform. In terms of probability amplitude, we prove that the transform can realize quantum Fourier transformation, illustrate that the requirement for the two-qubit gate reduces obviously, and further design a quantum circuit of the transform. Combining the classical fixed-window method and the implementation of Shor’s quantum factorization algorithm, we then redesign a circuit for Shor’s algorithm, whose required computation resource is approximately equal to that of Parker’s. The requirement for elementary quantum gates for Parker’s algorithm is O(⌈ log N⌉3, and the quantum register for our circuit requires t−1 more dimensions than Parker’s. However, our circuit is t 2 times as fast as Parker’s, where t is the width of the window.