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

Conference on Lasers and Electro-Optics Pacific Rim (CLEO-PR)

Quantum Fourier Transform in a d-level Quantum System

Ye Cao, Shi-Guo Peng, Gui Lu Long

Published Aug 1, 2007• 1 citation
Publisher

Abstract

The quantum Fourier transform is an essential part of many quantum algorithms. In this paper, we present the product formula for general quantum Fourier transform in a qudit system, namely quantum system with d-levels. We give the concise quantum circuits.
DOI
10.1109/cleopr.2007.4391569

Related papers

Quantum Fourier Transform and Phase Estimation in Qudit System

Ye Cao, Shi-Guo Peng, Chao Zheng +1 more

The quantum Fourier transform and quantum phase estimation are the key components for many quantum algorithms, such as order-finding, factoring, and etc. In this article, the general procedure of quantum Fourier transform and phase estimation are investigated for high dimensional case. They can be seen as subroutines in a main program run in a qudit quantum computer, and the quantum circuits are given.

Communications in Theoretical Physics•May 1, 2011•41 citations

Generalised Quantum Gates for Qudits and their Application in Quantum Fourier Transform

Francesco Pudda, Mario Chizzini, Crippa, Luca

Quantum computing with qudits, quantum systems with $d > 2$ levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several algorithms and, possibly, providing a foundation for optimised error correction. In this work, we propose a novel formulation of qudit gates that is universally applicable for any number of levels $d$, without restrictions on the dimensionality. By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size. We demonstrate the validity of our approach through the implementation of the Quantum Fourier Transform (QFT) for arbitrary $d$, verifying both the correctness and utility of our generalized gates. This novel methodology broadens the design space for quantum algorithms and fault-tolerant architectures, paving the way for advancements in qudit-based quantum computing.

arXiv:2410.05122•Oct 7, 2024•17 citations

Quantum-Fourier-transform-based quantum arithmetic with qudits

Archimedes Pavlidis, Emmanuel G. Floratos

We present some basic integer arithmetic quantum circuits, such as adders and multiplier-accumulators of various forms, which operate on multilevel qudits. The integers to be processed are represented in an alternative basis after they have been Fourier transformed. Several arithmetic circuits operating on Fourier-transformed integers have appeared in the literature for two-level qubits. Here we extend these techniques to multilevel qudits, as they may offer some advantages relative to qubit implementations. The arithmetic circuits presented here can be used as basic building blocks for higher level algorithms such as quantum phase estimation, quantum simulation, quantum optimization, etc. Detailed decomposition is given down to elementary two-level single- and two-qudit gates as such gates are the most appropriate for physical implementation. A complexity analysis is given after this decomposition step and it is shown that the depth of the circuits is linear in the number of qudits employed and quadratic in the dimension of each qudit while their quantum cost is quadratic in the number of the qudits and quadratic in the dimension.

arXiv:1707.08834•Physical Review A•Mar 16, 2021•51 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

A presentation of the quantum Fourier transform from a recursive viewpoint

Gloria Paradisi, Hugues Randriambololona

In this note we construct a quantum Fourier transform circuit in a recursive way, by directly copying the 'divide and conquer' construction of the fast Fourier transform algorithm, rather than using the explicit formula that is given in most introductory texts to quantum computation. We do not pretend this presentation to be original, nor claim for any anteriority. The aim of this paper is purely pedagogical.

arXiv:quant-ph/0411069•Nov 10, 2004•1 citation

The quantum Schur and Clebsch-Gordan transforms: I. efficient qudit circuits

Dave Bacon, Isaac L. Chuang, Aram W. Harrow

We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d -dimensional quantum systems is a transform between a standard computational basis to a labelling related to the representation theory of the symmetric and unitary groups. If we desire to implement the Schur transform to an accuracy of ε -1 , then our circuit construction uses a number of gates which is polynomial in n, d and log(ε -1 ). The key tool in our construction is a poly( d , log n , log(ε -1 )) algorithm for the u d Clebsch-Gordan transform. Our efficient circuit construction renders numerous protocols in quantum information theory computationally tractable and yields a new possible approach to quantum algorithms which is distinct from the standard paradigm of the quantum Fourier transform.

Symposium on Discrete Algorithms•Jan 7, 2007•28 citations
Quantum computing with qudits, quantum systems with d>2d > 2d>2 levels, offers a powerful extension beyond qubits, expanding the computational possibilities of quantum systems, allowing the simplification of the implementation of several algorithms and, possibly, providing a foundation for optimised error correction. In this work, we propose a novel formulation of qudit gates that is universally applicable for any number of levels ddd, without restrictions on the dimensionality. By extending the mathematical framework of quantum gates to arbitrary dimensions, we derive explicit gate operations that form a universal set for quantum computation on qudits of any size. We demonstrate the validity of our approach through the implementation of the Quantum Fourier Transform (QFT) for arbitrary ddd, verifying both the correctness and utility of our generalized gates. This novel methodology broadens the design space for quantum algorithms and fault-tolerant architectures, paving the way for advancements in qudit-based quantum computing.
We present some basic integer arithmetic quantum circuits, such as adders and multiplier-accumulators of various forms, which operate on multilevel qudits. The integers to be processed are represented in an alternative basis after they have been Fourier transformed. Several arithmetic circuits operating on Fourier-transformed integers have appeared in the literature for two-level qubits. Here we extend these techniques to multilevel qudits, as they may offer some advantages relative to qubit implementations. The arithmetic circuits presented here can be used as basic building blocks for higher level algorithms such as quantum phase estimation, quantum simulation, quantum optimization, etc. Detailed decomposition is given down to elementary two-level single- and two-qudit gates as such gates are the most appropriate for physical implementation. A complexity analysis is given after this decomposition step and it is shown that the depth of the circuits is linear in the number of qudits employed and quadratic in the dimension of each qudit while their quantum cost is quadratic in the number of the qudits and quadratic in the dimension.
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.
We present an efficient family of quantum circuits for a fundamental primitive in quantum information theory, the Schur transform. The Schur transform on n d -dimensional quantum systems is a transform between a standard computational basis to a labelling related to the representation theory of the symmetric and unitary groups. If we desire to implement the Schur transform to an accuracy of ε -1 , then our circuit construction uses a number of gates which is polynomial in n, d and log(ε -1 ). The key tool in our construction is a poly( d , log n , log(ε -1 )) algorithm for the u d Clebsch-Gordan transform. Our efficient circuit construction renders numerous protocols in quantum information theory computationally tractable and yields a new possible approach to quantum algorithms which is distinct from the standard paradigm of the quantum Fourier transform.