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

Chinese Physics B

Realization of quantum Fourier transform overZN

Xiang-Qun Fu, Wan‐Su Bao, Fa-Da Li, Yuchao Zhang

Published Feb 1, 2014• 2 citations
Publisher

Abstract

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 .

DOI
10.1088/1674-1056/23/2/020306

Related papers

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

Quantum circuit for the fast Fourier transform

Ryo Asaka, Kazumitsu Sakai, Ryoko Yahagi

Abstract We propose an implementation of the algorithm for the fast Fourier transform (FFT) as a quantum circuit consisting of a combination of some quantum gates. In our implementation, a data sequence is expressed by a tensor product of vector spaces. Namely, our FFT is defined as a transformation of the tensor product of quantum states. It is essentially different from the so-called quantum Fourier transform (QFT) defined to be a linear transformation of the amplitudes for the superposition of quantum states. The quantum circuit for the FFT consists of several circuits for elementary arithmetic operations such as a quantum adder, subtractor and shift operations, which are implemented as effectively as possible. Namely, our circuit does not generate any garbage bits. The advantages of our method compared to the QFT are its high versatility, and data storage efficiency in terms, for instance, of the quantum image processing.

arXiv:1911.03055•Quantum Information Processing•Aug 1, 2020•33 citations

The Study of Simulation Technique of Quantum Compute and Quantum Fourier Transform

Jiajia Wang, Hanwu Chen, Zhiqiang Li

For discussing the solving methods of NP problems in classical computers and studying the circuit model which is the most representative in quantum computing to simulate the compute processes, this article discussed how to simulate the quantum Fourier transform by using the quantum logic gates, implemented the quantum Fourier transform and constructed the quantum information and compute simulation platform. The experiment introduced the quantum register structure to be the storage medium, which is better than the form of matrix in space. The operation processes adopted the bit manipulation to avoid the mass time for matrix multiplications. The results presented the changes of quantum amplitudes and probabilities of quantum states according to the quantum effect and compared with the approximate quantum Fourier transform. The experimental platform provided a groundwork for the further simulations of other important quantum algorithms and quantum circuits.

International Conference on Computer Supported Cooperative Work in Design (CSCWD)•Apr 1, 2007•3 citations

FPGA-based quantum circuit emulation: A case study on Quantum Fourier transform

Y. H. Lee, Mohamed Khalil-Hani, Muhammad Nadzir Marsono

Hardware emulation based on field programmable gate array (FPGA) platform is vital to harness the power of quantum parallelism. As resource requirement grows exponentially in classical modeling quantum system, an optimum hardware architecture is crucial to emulate practical quantum circuits. Quantum Fourier transform (QFT) finds application in several critical quantum algorithms. In this work, experiments are conducted based on QFT to identify suitable qubit representation and hardware design technique. Experimental results show that 24-bit fixed point representation and serial architecture achieve optimal computation accuracy and resource utilization in QFT circuit emulation.

International Symposium on Integrated Circuits•Dec 1, 2014•6 citations

Symmetric ternary quantum Fourier transform and its application

Hao Dong, Dayong Lu, Xiaoyun Sun

The research of ternary quantum system has gradually come into the attention of scholars in recent years. In $2018$, Guangcan Guo and his colleagues showed that in a qutrit-qutrit system they can observe quantum nonlocality and quantum contextuality at the same time. In $2019$, international cooperation team led by Anton Zelinger of Austrian Academy of Sciences and Jianwei Pan of University of science and technology of China, they have succeeded in teleporting complex high-dimensional quantum states. The work of the above scholars makes us clearly realize the importance of the study of ternary quantum system, but there is a few research results on this aspect. Furthermore, the quantum Fourier transform (QFT) offers an interesting way to perform arithmetic operations on a quantum computer. So, the paper extends the QFT to symmetric ternary quantum system and gives its applications. First, a set of quantum gates is defined for symmetric ternary quantum system. It is worth noting that in binary system, qubit flipping is realized by Not gate. Therefore, we need to extend Not gate to symmetric ternary system to realize qutrit flipping, which is called M-S gate. And then, by decomposing single-qutrit unitary gate in symmetric ternary quantum system, the universal gates are given. It means that any unitary operation on $n$ qutrits can be accurately implemented by single-qutrit symmetric ternary quantum gates and two-qutrit symmetric ternary M-S gates. By extending the QFT to the symmetric ternary quantum system, the paper successfully use some symmetric ternary quantum gates to construct the circuit which can realize symmetric ternary quantum Fourier transform (STQFT). Finally, the circuit of adder in symmetric ternary quantum system are designed based on the STQFT and the universal quantum gates. ternary quantum Fourier transform and its application (pp733-754) Hao Dong, Dayong Lu, and Xiaoyun Sun doi: https://doi.org/10.26421/QIC22.9-10-2 Abstracts: The research of ternary quantum system has gradually come into the attention of scholars in recent years. In $2018$, Guangcan Guo and his colleagues showed that in a qutrit-qutrit system they can observe quantum nonlocality and quantum contextuality at the same time. In $2019$, international cooperation team led by Anton Zelinger of Austrian Academy of Sciences and Jianwei Pan of University of science and technology of China, they have succeeded in teleporting complex high-dimensional quantum states. The work of the above scholars makes us clearly realize the importance of the study of ternary quantum system, but there is a few research results on this aspect. Furthermore, the quantum Fourier transform (QFT) offers an interesting way to perform arithmetic operations on a quantum computer. So, the paper extends the QFT to symmetric ternary quantum system and gives its applications. First, a set of quantum gates is defined for symmetric ternary quantum system. It is worth noting that in binary system, qubit flipping is realized by Not gate. Therefore, we need to extend Not gate to symmetric ternary system to realize qutrit flipping, which is called M-S gate. And then, by decomposing single-qutrit unitary gate in symmetric ternary quantum system, the universal gates are given. It means that any unitary operation on $n$ qutrits can be accurately implemented by single-qutrit symmetric ternary quantum gates and two-qutrit symmetric ternary M-S gates. By extending the QFT to the symmetric ternary quantum system, the paper successfully use some symmetric ternary quantum gates to construct the circuit which can realize symmetric ternary quantum Fourier transform (STQFT). Finally, the circuit of adder in symmetric ternary quantum system are designed based on the STQFT and the universal quantum gates.

Quantum Information and Computation•May 30, 2022•1 citation

Improved Exact and Approximate Quantum Fourier Transforms from Multiplication

Chandrima Kayal, Rajat Mittal, Manaswi Paraashar +1 more

In the world of quantum computing, quantum Fourier transform (QFT) has been one of the most important subroutines for quantum algorithms, as exemplified by Shor's factoring algorithms and phase estimation (which in itself has been used as a primitive in various quantum algorithms). In fact most of the well known quantum algorithms can be divided into two classes, QFT based algorithms and search based algorithms. The usual circuit for QFT (covered in almost every basic quantum algorithms course) needs $O(q^2)$ gates (and $O(q)$ qubits) to perform the exact Fourier transform over $\mathbb{F}_{2^q}$. Cleve and Watrous (FOCS 2000) improved this gate count to $O(q (\log q)^2 (\log \log q))$ using the integer multiplication algorithm in $O(n (\log n) (\log \log n))$ time for two $n$-bit integers (best known at that time). Our first main result shows that this gate count can be improved to $O(q (\log q))$. In fact, if there is a multiplication circuit, to multiply two $n$-bit integers, with $O(n (\log n)^α)$ gates; we get a QFT circuit with $O(q (\log q)^α)$ gates (improving upon $O(q (\log q)^{α+ 1})$) gates from the construction of Cleve and Watrous). Given the recent claim by OpenAI about integer multiplication, this opens up the possibility of having a QFT circuit with $o \left( q (\log q)\right)$ gates. On approximating the QFT over $\ZZ/(2^q \ZZ)$, the result of Ahokas, Cleve and Hales (ERATO 2003) showed that an approximating circuit can be built with $O \left( q (\log \log(q/\varepsilon))^{α+1} \right)$ gates, where $ε$ is the approximating parameter. Our second main result again improves this to $O \left( q (\log \log(q/\varepsilon))^α \right)$ gates.

arXiv:2611.06341•Nov 4, 2026•0 citations
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 .
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.
Abstract We propose an implementation of the algorithm for the fast Fourier transform (FFT) as a quantum circuit consisting of a combination of some quantum gates. In our implementation, a data sequence is expressed by a tensor product of vector spaces. Namely, our FFT is defined as a transformation of the tensor product of quantum states. It is essentially different from the so-called quantum Fourier transform (QFT) defined to be a linear transformation of the amplitudes for the superposition of quantum states. The quantum circuit for the FFT consists of several circuits for elementary arithmetic operations such as a quantum adder, subtractor and shift operations, which are implemented as effectively as possible. Namely, our circuit does not generate any garbage bits. The advantages of our method compared to the QFT are its high versatility, and data storage efficiency in terms, for instance, of the quantum image processing.
For discussing the solving methods of NP problems in classical computers and studying the circuit model which is the most representative in quantum computing to simulate the compute processes, this article discussed how to simulate the quantum Fourier transform by using the quantum logic gates, implemented the quantum Fourier transform and constructed the quantum information and compute simulation platform. The experiment introduced the quantum register structure to be the storage medium, which is better than the form of matrix in space. The operation processes adopted the bit manipulation to avoid the mass time for matrix multiplications. The results presented the changes of quantum amplitudes and probabilities of quantum states according to the quantum effect and compared with the approximate quantum Fourier transform. The experimental platform provided a groundwork for the further simulations of other important quantum algorithms and quantum circuits.
Hardware emulation based on field programmable gate array (FPGA) platform is vital to harness the power of quantum parallelism. As resource requirement grows exponentially in classical modeling quantum system, an optimum hardware architecture is crucial to emulate practical quantum circuits. Quantum Fourier transform (QFT) finds application in several critical quantum algorithms. In this work, experiments are conducted based on QFT to identify suitable qubit representation and hardware design technique. Experimental results show that 24-bit fixed point representation and serial architecture achieve optimal computation accuracy and resource utilization in QFT circuit emulation.
The research of ternary quantum system has gradually come into the attention of scholars in recent years. In 201820182018, Guangcan Guo and his colleagues showed that in a qutrit-qutrit system they can observe quantum nonlocality and quantum contextuality at the same time. In 201920192019, international cooperation team led by Anton Zelinger of Austrian Academy of Sciences and Jianwei Pan of University of science and technology of China, they have succeeded in teleporting complex high-dimensional quantum states. The work of the above scholars makes us clearly realize the importance of the study of ternary quantum system, but there is a few research results on this aspect. Furthermore, the quantum Fourier transform (QFT) offers an interesting way to perform arithmetic operations on a quantum computer. So, the paper extends the QFT to symmetric ternary quantum system and gives its applications. First, a set of quantum gates is defined for symmetric ternary quantum system. It is worth noting that in binary system, qubit flipping is realized by Not gate. Therefore, we need to extend Not gate to symmetric ternary system to realize qutrit flipping, which is called M-S gate. And then, by decomposing single-qutrit unitary gate in symmetric ternary quantum system, the universal gates are given. It means that any unitary operation on nnn qutrits can be accurately implemented by single-qutrit symmetric ternary quantum gates and two-qutrit symmetric ternary M-S gates. By extending the QFT to the symmetric ternary quantum system, the paper successfully use some symmetric ternary quantum gates to construct the circuit which can realize symmetric ternary quantum Fourier transform (STQFT). Finally, the circuit of adder in symmetric ternary quantum system are designed based on the STQFT and the universal quantum gates. ternary quantum Fourier transform and its application (pp733-754) Hao Dong, Dayong Lu, and Xiaoyun Sun doi: https://doi.org/10.26421/QIC22.9-10-2 Abstracts: The research of ternary quantum system has gradually come into the attention of scholars in recent years. In 201820182018, Guangcan Guo and his colleagues showed that in a qutrit-qutrit system they can observe quantum nonlocality and quantum contextuality at the same time. In 201920192019, international cooperation team led by Anton Zelinger of Austrian Academy of Sciences and Jianwei Pan of University of science and technology of China, they have succeeded in teleporting complex high-dimensional quantum states. The work of the above scholars makes us clearly realize the importance of the study of ternary quantum system, but there is a few research results on this aspect. Furthermore, the quantum Fourier transform (QFT) offers an interesting way to perform arithmetic operations on a quantum computer. So, the paper extends the QFT to symmetric ternary quantum system and gives its applications. First, a set of quantum gates is defined for symmetric ternary quantum system. It is worth noting that in binary system, qubit flipping is realized by Not gate. Therefore, we need to extend Not gate to symmetric ternary system to realize qutrit flipping, which is called M-S gate. And then, by decomposing single-qutrit unitary gate in symmetric ternary quantum system, the universal gates are given. It means that any unitary operation on nnn qutrits can be accurately implemented by single-qutrit symmetric ternary quantum gates and two-qutrit symmetric ternary M-S gates. By extending the QFT to the symmetric ternary quantum system, the paper successfully use some symmetric ternary quantum gates to construct the circuit which can realize symmetric ternary quantum Fourier transform (STQFT). Finally, the circuit of adder in symmetric ternary quantum system are designed based on the STQFT and the universal quantum gates.
In the world of quantum computing, quantum Fourier transform (QFT) has been one of the most important subroutines for quantum algorithms, as exemplified by Shor's factoring algorithms and phase estimation (which in itself has been used as a primitive in various quantum algorithms). In fact most of the well known quantum algorithms can be divided into two classes, QFT based algorithms and search based algorithms. The usual circuit for QFT (covered in almost every basic quantum algorithms course) needs O(q2)O(q^2)O(q2) gates (and O(q)O(q)O(q) qubits) to perform the exact Fourier transform over F2q\mathbb{F}_{2^q}F2q​. Cleve and Watrous (FOCS 2000) improved this gate count to O(q(log⁡q)2(log⁡log⁡q))O(q (\log q)^2 (\log \log q))O(q(logq)2(loglogq)) using the integer multiplication algorithm in O(n(log⁡n)(log⁡log⁡n))O(n (\log n) (\log \log n))O(n(logn)(loglogn)) time for two nnn-bit integers (best known at that time). Our first main result shows that this gate count can be improved to O(q(log⁡q))O(q (\log q))O(q(logq)). In fact, if there is a multiplication circuit, to multiply two nnn-bit integers, with O(n(log⁡n)α)O(n (\log n)^α)O(n(logn)α) gates; we get a QFT circuit with O(q(log⁡q)α)O(q (\log q)^α)O(q(logq)α) gates (improving upon O(q(log⁡q)α+1)O(q (\log q)^{α+ 1})O(q(logq)α+1)) gates from the construction of Cleve and Watrous). Given the recent claim by OpenAI about integer multiplication, this opens up the possibility of having a QFT circuit with o(q(log⁡q))o \left( q (\log q)\right)o(q(logq)) gates. On approximating the QFT over $\ZZ/(2^q \ZZ)$, the result of Ahokas, Cleve and Hales (ERATO 2003) showed that an approximating circuit can be built with O(q(log⁡log⁡(q/ε))α+1)O \left( q (\log \log(q/\varepsilon))^{α+1} \right)O(q(loglog(q/ε))α+1) gates, where εεε is the approximating parameter. Our second main result again improves this to O(q(log⁡log⁡(q/ε))α)O \left( q (\log \log(q/\varepsilon))^α \right)O(q(loglog(q/ε))α) gates.