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

Scaling the discrete Fourier transform gate in the quantum frequency processor

Hsuan‐Hao Lu, Navin B. Lingaraju, Daniel E. Leaird, Andrew M. Weiner, Joseph M. Lukens

Published Jan 1, 2021• 0 citations
Publisher

Abstract

We show that the d-dimensional discrete Fourier transform can be implemented by adding RF harmonics to the applied modulation in a quantum frequency processor. Implementing the d = 3 case experimentally, we quantify entanglement and perform full quantum state tomography.
DOI
10.1364/cleo_qels.2021.ftu1n.8

Related papers

High-dimensional discrete Fourier transform gates with a quantum frequency processor

Hsuan‐Hao Lu, Navin B. Lingaraju, Daniel E. Leaird +2 more

The discrete Fourier transform (DFT) is of fundamental interest in photonic quantum information, yet the ability to scale it to high dimensions depends heavily on the physical encoding, with practical recipes lacking in emerging platforms such as frequency bins. In this article, we show that d-point frequency-bin DFTs can be realized with a fixed three-component quantum frequency processor (QFP), simply by adding to the electro-optic modulation signals one radio-frequency harmonic per each incremental increase in d. We verify gate fidelity F W > 0.9997 and success probability P W > 0.965 up to d = 10 in numerical simulations, and experimentally implement the solution for d = 3, utilizing measurements with parallel DFTs to quantify entanglement and perform tomography of multiple two-photon frequency-bin states. Our results furnish new opportunities for high-dimensional frequency-bin protocols in quantum communications and networking.

arXiv:2201.10973•Optics Express•Mar 4, 2022•34 citations

Implementation of quantum and classical discrete fractional Fourier transforms

Steffen Weimann, Armando Pérez-Leija, Maxime Lebugle +9 more

Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools.

arXiv:1508.00033•Nature Communications•Mar 23, 2016•119 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•38 citations

Implementing discrete quantum Fourier transform via superconducting qubits coupled to a superconducting cavity

A.‐S. F. Obada, H. A. Hessian, Abdel-Basset A. Mohamed +1 more

A new physical scheme for implementing an N-bit discrete quantum Fourier transform (DQFT) is proposed via superconducting (SC) qubits coupled to a single-mode SC cavity. Two-qubit and one-qubit gates as well as a new two-qubit gate are realized. Such gates are used for implementing the algorithm of N-bit DQFT. We propose and analyze a detailed experimental procedure for implementing the algorithm and compute the fidelity measure to quantify the success of this algorithm. Estimates show that the protocol can be successfully implemented within the present experimental limits.

Journal of the Optical Society of America B•Apr 11, 2013•36 citations

EFFICIENT IMPLEMENTATIONS OF THE QUANTUM FOURIER TRANSFORM: AN EXPERIMENTAL PERSPECTIVE

Kavita Dorai, Dieter Suter

The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.

arXiv:quant-ph/0211030•International Journal of Quantum Information•May 31, 2005•20 citations

A Quantum Bluestein's Algorithm for Arbitrary-Size Quantum Fourier Transform

Nan-Hong Kuo, Renata Wong

We propose a quantum analogue of Bluestein's algorithm (QBA) that implements an exact $N$-point Quantum Fourier Transform (QFT) for arbitrary $N$. Our construction factors the $N$-dimensional QFT unitary into three diagonal quadratic-phase gates and two standard radix-2 QFT subcircuits of size $M = 2^m$ (with $M \ge 2N - 1$). This achieves asymptotic gate complexity $O((\log N)^2)$ and uses $O(\log N)$ qubits, matching the performance of a power-of-two QFT on $m$ qubits while avoiding the need to embed into a larger Hilbert space. We validate the correctness of the algorithm through a concrete implementation in Qiskit and classical simulation, confirming that QBA produces the exact $N$-point discrete Fourier transform on arbitrary-length inputs.

quant-pharXiv:2512.15349•Physica Scripta•Dec 18, 2025•1 citation
The discrete Fourier transform (DFT) is of fundamental interest in photonic quantum information, yet the ability to scale it to high dimensions depends heavily on the physical encoding, with practical recipes lacking in emerging platforms such as frequency bins. In this article, we show that d-point frequency-bin DFTs can be realized with a fixed three-component quantum frequency processor (QFP), simply by adding to the electro-optic modulation signals one radio-frequency harmonic per each incremental increase in d. We verify gate fidelity F W > 0.9997 and success probability P W > 0.965 up to d = 10 in numerical simulations, and experimentally implement the solution for d = 3, utilizing measurements with parallel DFTs to quantify entanglement and perform tomography of multiple two-photon frequency-bin states. Our results furnish new opportunities for high-dimensional frequency-bin protocols in quantum communications and networking.
Fourier transforms, integer and fractional, are ubiquitous mathematical tools in basic and applied science. Certainly, since the ordinary Fourier transform is merely a particular case of a continuous set of fractional Fourier domains, every property and application of the ordinary Fourier transform becomes a special case of the fractional Fourier transform. Despite the great practical importance of the discrete Fourier transform, implementation of fractional orders of the corresponding discrete operation has been elusive. Here we report classical and quantum optical realizations of the discrete fractional Fourier transform. In the context of classical optics, we implement discrete fractional Fourier transforms of exemplary wave functions and experimentally demonstrate the shift theorem. Moreover, we apply this approach in the quantum realm to Fourier transform separable and path-entangled biphoton wave functions. The proposed approach is versatile and could find applications in various fields where Fourier transforms are essential tools.
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.
A new physical scheme for implementing an N-bit discrete quantum Fourier transform (DQFT) is proposed via superconducting (SC) qubits coupled to a single-mode SC cavity. Two-qubit and one-qubit gates as well as a new two-qubit gate are realized. Such gates are used for implementing the algorithm of N-bit DQFT. We propose and analyze a detailed experimental procedure for implementing the algorithm and compute the fidelity measure to quantify the success of this algorithm. Estimates show that the protocol can be successfully implemented within the present experimental limits.
The Quantum Fourier transform (QFT) is a key ingredient in most quantum algorithms. We have compared various spin-based quantum computing schemes to implement the QFT from the point of view of their actual time-costs and the accuracy of the implementation. We focus here on an interesting decomposition of the QFT as a product of the non-selective Hadamard transformation followed by multiqubit gates corresponding to square- and higher-roots of controlled-NOT gates. This decomposition requires only O(n) operations and is thus linear in the number of qubits n. The schemes were implemented on a two-qubit NMR quantum information processor and the resultant density matrices reconstructed using standard quantum state tomography techniques. Their experimental fidelities have been measured and compared.
We propose a quantum analogue of Bluestein's algorithm (QBA) that implements an exact NNN-point Quantum Fourier Transform (QFT) for arbitrary NNN. Our construction factors the NNN-dimensional QFT unitary into three diagonal quadratic-phase gates and two standard radix-2 QFT subcircuits of size M=2mM = 2^mM=2m (with M≥2N−1M \ge 2N - 1M≥2N−1). This achieves asymptotic gate complexity O((log⁡N)2)O((\log N)^2)O((logN)2) and uses O(log⁡N)O(\log N)O(logN) qubits, matching the performance of a power-of-two QFT on mmm qubits while avoiding the need to embed into a larger Hilbert space. We validate the correctness of the algorithm through a concrete implementation in Qiskit and classical simulation, confirming that QBA produces the exact NNN-point discrete Fourier transform on arbitrary-length inputs.