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

Journal of Shandong University of Science and Technology

The QFT Circuit Structured by Quantum Fourier Transformation

Cao Ming-tong

Published Jan 1, 2006• 0 citations
OpenAlex

Abstract

By means of the quantum Fourier transformation,the paper presents a method of structuring quantum Fourier transform circuit with 3 qubits and it can also structure QFT circuit with n qubits.

Related papers

Multidimensional Quantum Fourier Transformation

Philipp Pfeffer

The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The complexity of the algorithm is $\mathcal{O}( \log^2(M)/d )$ for an array with $M=(2^n)^d$ elements $(n \in \mathbb{N})$ equally separated along $d$ dimensions. Relevant properties for application are discussed. An example on current hardware is depicted by a 6 qubit 2D-QFT with an IBM quantum computer.

arXiv:2301.13835•Jan 31, 2023•13 citations

Rotational abstractions for verification of quantum Fourier transform circuits

Arun Govindankutty, Sudarshan K. Srinivasan, Nimish Mathure

Abstract With the race to build large‐scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of vital importance. A novel formal verification method that is targeted at Quantum Fourier Transform (QFT) circuits is proposed. Quantum Fourier Transform is a fundamental quantum algorithm that forms the basis of many quantum computing applications. The verification method employs abstractions of quantum gates used in QFT that leads to a reduction of the verification problem from Hilbert space to the quantifier free logic of bit‐vectors. Very efficient decision procedures are available to reason about bit‐vectors. Therefore, this method is able to scale up to the verification of QFT circuits with 10,000 qubits and 50 million quantum gates, providing a meteoric advance in the size of QFT circuits thus far verified using formal verification methods.

arXiv:2301.00737•IET Quantum Communication•Mar 13, 2023•15 citations

Realization of quantum Fourier transform overZN

Xiang-Qun Fu, Wan‐Su Bao, Fa-Da Li +1 more

Since the difficulty in preparing the equal superposition state of amplitude is 1/√ N , we construct a quantile transform of quantum Fourier transform (QFT) over Z N based on the elementary transforms, such as Hadamard transform and Pauli transform. The QFT over Z N can then be realized by the quantile transform, and used to further design its quantum circuit and analyze the requirements for the quantum register and quantum gates. However, the transform needs considerable quantum computational resources and it is difficult to construct a high-dimensional quantum register. Hence, we investigate the design of t -bit quantile transform, and introduce the definition of t -bit semiclassical QFT over Z N . According to probability amplitude, we prove that the transform can be used to realize QFT over Z N and further design its quantum circuit. For this transform, the requirements for the quantum register, the one-qubit gate, and two-qubit gate reduce obviously when compared with those for the QFT over Z N .

Chinese Physics B•Feb 1, 2014•2 citations

Performing the Quantum Fourier Transform in Linear Parallel Time

Cristopher Moore

We exhibit a quantum circuit that performs the Quantum Fourier Transform on $n$ qubits in $ (n)$ depth. Thus, a parallel quantum computer can carry out the QFT in linear time. We conjecture that this can, in fact, be reduced to $ ({\rm log} n)$ depth, which would place the QFT in the class {\bf QNC} of problems solvable in logarithmic parallel time.

•Jan 1, 1998•0 citations

Matrix-based perspective to quantum multiplication

Pedro Juan Roig, Salvador Alcaraz, Katja Gilly +2 more

The Quantum Fourier Transform (QFT) is a key component in many quantum circuit designs and algorithms. In this paper, a matrix-based approach is used to study the design and outcomes of an ancilla-free, QFT-based quantum circuit for multiplying a pair of 2-qubit strings. Additionally, a graphical method to calculate QFT and IQFT matrices has been proposed.

International Conference on Integrated Intelligence and Cognitive Engineering (ICIICE)•Apr 18, 2026•0 citations

Quantum Circuit for Quantum Fourier Transform for Arbitrary Qubit Connectivity Graphs Based on 1-Cover Path

Kamil Ravilevich Khadiev, Aliya Khadieva, Vadim Sagitov +1 more

In the paper, we consider quantum circuits for the Quantum Fourier Transform (QFT) algorithm. We present a generic method for constructing quantum circuits for QFT on quantum devices with restrictions. Many quantum devices (for example, based on superconductors) have restrictions on applying two-qubit gates presented by a qubit connectivity graph. Typically, researchers consider only the linear nearest neighbor (LNN) architecture, but current devices have more complex graphs. We present a method for arbitrary connected graphs that minimizes the number of CNOT gates in the circuit for implementing on such architecture.

International Conference on Quantum Communications, Networking, and Computing (QCNC)•Apr 6, 2026•1 citation
The Quantum Fourier Transformation (QFT) is a well-known subroutine for algorithms on qubit-based universal quantum computers. In this work, the known QFT circuit is used to derive an efficient circuit for the multidimensional QFT. The complexity of the algorithm is O(log⁡2(M)/d)\mathcal{O}( \log^2(M)/d )O(log2(M)/d) for an array with M=(2n)dM=(2^n)^dM=(2n)d elements (n∈N)(n \in \mathbb{N})(n∈N) equally separated along ddd dimensions. Relevant properties for application are discussed. An example on current hardware is depicted by a 6 qubit 2D-QFT with an IBM quantum computer.
Abstract With the race to build large‐scale quantum computers and efforts to exploit quantum algorithms for efficient problem solving in science and engineering disciplines, the requirement to have efficient and scalable verification methods are of vital importance. A novel formal verification method that is targeted at Quantum Fourier Transform (QFT) circuits is proposed. Quantum Fourier Transform is a fundamental quantum algorithm that forms the basis of many quantum computing applications. The verification method employs abstractions of quantum gates used in QFT that leads to a reduction of the verification problem from Hilbert space to the quantifier free logic of bit‐vectors. Very efficient decision procedures are available to reason about bit‐vectors. Therefore, this method is able to scale up to the verification of QFT circuits with 10,000 qubits and 50 million quantum gates, providing a meteoric advance in the size of QFT circuits thus far verified using formal verification methods.
Since the difficulty in preparing the equal superposition state of amplitude is 1/√ N , we construct a quantile transform of quantum Fourier transform (QFT) over Z N based on the elementary transforms, such as Hadamard transform and Pauli transform. The QFT over Z N can then be realized by the quantile transform, and used to further design its quantum circuit and analyze the requirements for the quantum register and quantum gates. However, the transform needs considerable quantum computational resources and it is difficult to construct a high-dimensional quantum register. Hence, we investigate the design of t -bit quantile transform, and introduce the definition of t -bit semiclassical QFT over Z N . According to probability amplitude, we prove that the transform can be used to realize QFT over Z N and further design its quantum circuit. For this transform, the requirements for the quantum register, the one-qubit gate, and two-qubit gate reduce obviously when compared with those for the QFT over Z N .
We exhibit a quantum circuit that performs the Quantum Fourier Transform on nnn qubits in $ (n)$ depth. Thus, a parallel quantum computer can carry out the QFT in linear time. We conjecture that this can, in fact, be reduced to $ ({\rm log} n)$ depth, which would place the QFT in the class {\bf QNC} of problems solvable in logarithmic parallel time.
In the paper, we consider quantum circuits for the Quantum Fourier Transform (QFT) algorithm. We present a generic method for constructing quantum circuits for QFT on quantum devices with restrictions. Many quantum devices (for example, based on superconductors) have restrictions on applying two-qubit gates presented by a qubit connectivity graph. Typically, researchers consider only the linear nearest neighbor (LNN) architecture, but current devices have more complex graphs. We present a method for arbitrary connected graphs that minimizes the number of CNOT gates in the circuit for implementing on such architecture.