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

Applied Sciences

Quantum 3D FFT in Tomography

Γεωργία Κούκιου, V. Anastassopoulos

Published Mar 21, 2023• 4 citations
Publisher

Abstract

The Radon transform constitutes the conventional tool for tomosynthesis, i.e., the composition of cross-sections of an object from its projections. It is actually a version of the Fourier Transform, which is accompanied by the appropriate digital high pass filters for correct distribution of energy among the reconstructed frequency components. The Radon transform and its inverse are employed in their 2D and 3D versions, respectively, and the whole procedure is verified by the a priori known cross-sections to be reconstructed (known fandom). Usually, 3D medical image cubes, which are to be reconstructed, require powerful computational tools since the 2D projections are of high-resolution containing millions of pixels. Although the 3D FFT is very fast, the large number of projections will result in a 3D spectrum of very large dimensions. Inverting this spectrum with the inverse 3D FFT is extremely time consuming. In this work, the implementation of the 2D Radon transform using the 2D Quantum Fourier Transform is analytically presented. Simultaneously, its inverse version is realized by means of the Quantum inverse 3D FFT. For this purpose, a review of the necessary quantum computational units is presented for the implementation of the quantum 3D FFT and simultaneously simple examples of tomosynthesis are given by means of the quantum version of the 2D Radon transform and its inverse 3D counterpart. The whole procedure of the quantum tomosynthesis is analytically described.

DOI
10.3390/app13064009

Related papers

Velocity Filtering Using Quantum 3D FFT

Γεωργία Κούκιου, V. Anastassopoulos

In this work, the quantum version of 3D FFT is proposed for constructing velocity filters. Velocity filters are desirable when we need to separate moving objects with a specific velocity range in amplitude and direction in a rapidly changing background. These filters are useful in many application fields, such as for monitoring regions for security reasons or inspecting processes in experimental physics. A faster and more attractive way to implement this filtering procedure is through 3D FFT instead of using 3D FIR filters. Additionally, 3D FFT provides the capability to create banks of ready-made filters with various characteristics. Thus, 3D filtering is carried out in the frequency domain by rejecting appropriate frequency bands according to the spectral content of the trajectory of the object to be isolated. The 3D FFT procedure and the corresponding inverse one are required in the beginning and end of the filtering process. Although 3D FFT is computationally effective, it becomes time-consuming when we need to process large data cubes. The implementation of velocity filters by means of the quantum version of 3D FFT is investigated in this work. All necessary quantum circuits and quantum procedures needed are presented in detail. This proposed quantum structure results in velocity filtering with a short execution time. For this purpose, a review of the necessary quantum computational units is presented for the implementation of quantum 3D FFT and representative examples of applications of velocity filtering are provided.

Photonics•Apr 22, 2023•3 citations

Image Analysis-Synthesis Using the Quantum Fourier Transform

Tanay Kamlesh Patel, Danielle Knutson, Glen S. Uehara +4 more

This paper introduces a hybrid two-dimensional Quantum Fourier Transform (2D hybrid QFT) method for image analysis and synthesis. The QFT and Inverse QFT (IQFT) functions enable analysis-synthesis implementation using frequency spectrum-based selection approaches for compression. We study the resolution and precision of the QFT by comparing its outputs against classical two-dimensional Fast Fourier Transform (FFT) techniques using pixel-level Signal to Noise Ratio (SNR) as a metric. Formative and summative assessments have been deployed as a laboratory exercise in two National Science Foundation (NSF) workforce development programs. Preliminary evaluation results are presented in this paper.

IEEE International Symposium on Circuits and Systems proceedings•May 25, 2025•4 citations

A review on quantum Fourier transform

Tomás Barros, Pablo Álvarez, Bárbara Vidal +1 more

This survey presents a comprehensive analysis of the quantum Fourier transform (QFT), a fundamental tool in quantum computing, in comparison to its classical counterpart, the fast Fourier transform (FFT). The study begins with an introduction to the classical Fourier transform, which is widely used in different disciplines such as signal and image processing. The article introduces the QFT as a quantum version of the Fourier transform, detailing how it leverages quantum parallelism and superposition to reduce the time complexity of the operation, and highlighting its crucial role in quantum algorithms like Shor’s algorithm for integer factorization. The analysis also addresses the mathematical foundations of the QFT, its implementation in quantum circuits, and the key advantages and challenges associated with its use, such as measurement precision and quantum decoherence. Finally, it concludes with an exploration of the current and potential applications of QFT in quantum computing.

Quantum Information Processing•Jan 27, 2026•2 citations

FOURIER TRANSFORM ANALYSIS USING QUANTUM COMPUTATION METHOD

Surya P, U. Pavan Kumar, Ch. Arun Prakash +2 more

signals into frequency-domain forms is the Fourier Transform (FT). It is extensively utilized in several fields, such as spectrum analysis, audio and video processing, and 5G networks. Effective frequency analysis is essential for channel optimization, signal reliability, and noise reduction in 5G networks. The FFT is appropriate for real-time applications since it greatly increases processing speed. However, the Quantum Fourier Transform makes use of quantum entanglement and superposition, providing exciting new developments for secure data transfer and high-speed communication in the future. Furthermore, both the Inverse Fast Fourier Transform (IFFT) and the Inverse Quantum Fourier Transform are used to correctly recreate the signal. Implementation of Quantum's real valued computing of quantum-based signal processing is also covered in the survey.

International Journal of Advanced Research•Feb 21, 2026•0 citations

Quantum tomography

J. C. Garrison, R. Y. Chiao

This chapter begins with a review of classical tomography, which reconstructs hidden structures inside an object by successive transmissions of an X-ray beam at different angles and lateral displacements. By interpreting the Wigner distribution as an analogue of the density distribution in a physical object, the mathematical methods of classical tomography — the Radon transform, the Fourier slice theorem, and the inverse Radon transform — are adapted to perform a high resolution determination of a quantum state of light. In optical homodyne tomography, the classical transmission angle is replaced by the adjustable phase of a local oscillator, and the successive lateral displacements are replaced by a series of measurements of the quadrature operator defined by the local oscillator phase. Experimental data is presented showing various properties of the Wigner distribution for a coherent state.

Oxford University Press eBooks•Jun 5, 2008•0 citations

Advancements in Fourier Analysis: The Quantum Perspective

S. T., Aniverthy Amrutesh

Fourier Transform (FT) is an important signal processing technique that translates time-domain signals to frequency-domain forms. It is widely used in several applications, including 5G networks, image processing, & spectrum analysis. In 5G networks, efficient frequency analysis is critical for noise reduction, channel optimisation, and signal dependability.This study explores the implementation of Classical Fourier Transform, Fast Fourier Transform, and Quantum Fourier Transform using Python (NumPy, Pandas, Matplotlib) and Qiskit. The FFT significantly improves processing speed, making it suitable for real-time applications. On the other hand, QFT leverages quantum superposition and entanglement, offering promising advancements for future high-speed communication and secure data transmission. Additionally, the signal is successfully reconstructed using both the Inverse Fast Fourier Transform (IFFT) and the Inverse Quantum Fourier Transform (IQFT). While IFFT efficiently restores the original signal with minimal numerical artifacts, IQFT ensures exact reconstruction without errors. The study also includes execution on IBM Quantum’s real hardware, showcasing the practical feasibility of quantum-based signal processing.

IEEE Space, Aerospace and Defence Conference (SPACE)•Jul 21, 2025•0 citations
The Radon transform constitutes the conventional tool for tomosynthesis, i.e., the composition of cross-sections of an object from its projections. It is actually a version of the Fourier Transform, which is accompanied by the appropriate digital high pass filters for correct distribution of energy among the reconstructed frequency components. The Radon transform and its inverse are employed in their 2D and 3D versions, respectively, and the whole procedure is verified by the a priori known cross-sections to be reconstructed (known fandom). Usually, 3D medical image cubes, which are to be reconstructed, require powerful computational tools since the 2D projections are of high-resolution containing millions of pixels. Although the 3D FFT is very fast, the large number of projections will result in a 3D spectrum of very large dimensions. Inverting this spectrum with the inverse 3D FFT is extremely time consuming. In this work, the implementation of the 2D Radon transform using the 2D Quantum Fourier Transform is analytically presented. Simultaneously, its inverse version is realized by means of the Quantum inverse 3D FFT. For this purpose, a review of the necessary quantum computational units is presented for the implementation of the quantum 3D FFT and simultaneously simple examples of tomosynthesis are given by means of the quantum version of the 2D Radon transform and its inverse 3D counterpart. The whole procedure of the quantum tomosynthesis is analytically described.
In this work, the quantum version of 3D FFT is proposed for constructing velocity filters. Velocity filters are desirable when we need to separate moving objects with a specific velocity range in amplitude and direction in a rapidly changing background. These filters are useful in many application fields, such as for monitoring regions for security reasons or inspecting processes in experimental physics. A faster and more attractive way to implement this filtering procedure is through 3D FFT instead of using 3D FIR filters. Additionally, 3D FFT provides the capability to create banks of ready-made filters with various characteristics. Thus, 3D filtering is carried out in the frequency domain by rejecting appropriate frequency bands according to the spectral content of the trajectory of the object to be isolated. The 3D FFT procedure and the corresponding inverse one are required in the beginning and end of the filtering process. Although 3D FFT is computationally effective, it becomes time-consuming when we need to process large data cubes. The implementation of velocity filters by means of the quantum version of 3D FFT is investigated in this work. All necessary quantum circuits and quantum procedures needed are presented in detail. This proposed quantum structure results in velocity filtering with a short execution time. For this purpose, a review of the necessary quantum computational units is presented for the implementation of quantum 3D FFT and representative examples of applications of velocity filtering are provided.
This paper introduces a hybrid two-dimensional Quantum Fourier Transform (2D hybrid QFT) method for image analysis and synthesis. The QFT and Inverse QFT (IQFT) functions enable analysis-synthesis implementation using frequency spectrum-based selection approaches for compression. We study the resolution and precision of the QFT by comparing its outputs against classical two-dimensional Fast Fourier Transform (FFT) techniques using pixel-level Signal to Noise Ratio (SNR) as a metric. Formative and summative assessments have been deployed as a laboratory exercise in two National Science Foundation (NSF) workforce development programs. Preliminary evaluation results are presented in this paper.
This survey presents a comprehensive analysis of the quantum Fourier transform (QFT), a fundamental tool in quantum computing, in comparison to its classical counterpart, the fast Fourier transform (FFT). The study begins with an introduction to the classical Fourier transform, which is widely used in different disciplines such as signal and image processing. The article introduces the QFT as a quantum version of the Fourier transform, detailing how it leverages quantum parallelism and superposition to reduce the time complexity of the operation, and highlighting its crucial role in quantum algorithms like Shor’s algorithm for integer factorization. The analysis also addresses the mathematical foundations of the QFT, its implementation in quantum circuits, and the key advantages and challenges associated with its use, such as measurement precision and quantum decoherence. Finally, it concludes with an exploration of the current and potential applications of QFT in quantum computing.
signals into frequency-domain forms is the Fourier Transform (FT). It is extensively utilized in several fields, such as spectrum analysis, audio and video processing, and 5G networks. Effective frequency analysis is essential for channel optimization, signal reliability, and noise reduction in 5G networks. The FFT is appropriate for real-time applications since it greatly increases processing speed. However, the Quantum Fourier Transform makes use of quantum entanglement and superposition, providing exciting new developments for secure data transfer and high-speed communication in the future. Furthermore, both the Inverse Fast Fourier Transform (IFFT) and the Inverse Quantum Fourier Transform are used to correctly recreate the signal. Implementation of Quantum's real valued computing of quantum-based signal processing is also covered in the survey.
This chapter begins with a review of classical tomography, which reconstructs hidden structures inside an object by successive transmissions of an X-ray beam at different angles and lateral displacements. By interpreting the Wigner distribution as an analogue of the density distribution in a physical object, the mathematical methods of classical tomography — the Radon transform, the Fourier slice theorem, and the inverse Radon transform — are adapted to perform a high resolution determination of a quantum state of light. In optical homodyne tomography, the classical transmission angle is replaced by the adjustable phase of a local oscillator, and the successive lateral displacements are replaced by a series of measurements of the quadrature operator defined by the local oscillator phase. Experimental data is presented showing various properties of the Wigner distribution for a coherent state.
Fourier Transform (FT) is an important signal processing technique that translates time-domain signals to frequency-domain forms. It is widely used in several applications, including 5G networks, image processing, & spectrum analysis. In 5G networks, efficient frequency analysis is critical for noise reduction, channel optimisation, and signal dependability.This study explores the implementation of Classical Fourier Transform, Fast Fourier Transform, and Quantum Fourier Transform using Python (NumPy, Pandas, Matplotlib) and Qiskit. The FFT significantly improves processing speed, making it suitable for real-time applications. On the other hand, QFT leverages quantum superposition and entanglement, offering promising advancements for future high-speed communication and secure data transmission. Additionally, the signal is successfully reconstructed using both the Inverse Fast Fourier Transform (IFFT) and the Inverse Quantum Fourier Transform (IQFT). While IFFT efficiently restores the original signal with minimal numerical artifacts, IQFT ensures exact reconstruction without errors. The study also includes execution on IBM Quantum’s real hardware, showcasing the practical feasibility of quantum-based signal processing.