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

Communications in computer and information science

Quantum Fourier Transform in Image Processing

Д.Т. Мухамедиева, Р.А. Собиров, N. M. Turgunova, B. N. Samijonov

Published Jan 1, 2024• 11 citations
Publisher
DOI
10.1007/978-3-031-60318-1_12

Related papers

Quantum Fourier Transform Neural Network with image blockwise representation for image classification

Desheng Kong, Kangning An, Kairan Zhang +5 more

Knowledge-Based Systems•Apr 11, 2026•0 citations

Methods of calculation of the 2-D quantum Fourier transform of images

Artyom M. Grigoryan, Alexis A. Gomez, Sos С. Agaian

The quantum Fourier transform (QFT) is the important operation in quantum computing. It is used in many algorithms, including the Shor's quantum algorithm for finding the prime factors of integers. Color image encryption, processing and representation of quantum images are areas where the QFT is also used. In this paper, we discuss the quantum superpositions of the images and methods of calculation of the analogues of the quantum 2-D discrete Fourier transform of images. The quantum algorithms and circuits will be described, and examples of calculation of the 2-D QFT of images of 8×8 and 16×16 pixels will be given in detail.

Multimodal Image Exploitation and Learning•Apr 19, 2024•2 citations

Quantum Image Processing and Its Applications

J. Jennifer Ranjani

Springer eBooks•Jan 1, 2019•0 citations

Fast Transforms in Quantum Computation

Artyom M. Grigoryan, Sos S. Agaian

This chapter discusses quantum fast transforms that play a key role in the development of image processing techniques. It describes concepts of the discrete paired, Hadamard, and Fourier transforms and their circuits in quantum computation. The chapter focuses on the discrete paired transform, which is a core of the N-point discrete Hadamard and Fourier transforms. It also describes the simple quantum schemes for calculation of the paired transform and presents the method of implementation of the classical diagram for the circular convolution in the frequency domain. The chapter explains the analytical and matrix representations of the discrete Hadamard transform. It details the circuits for calculating quantum Fourier transform, which are based on the paired transform-based splitting. The N-point discrete Fourier transform is considered in the traditional form which is used in signal and image processing.

Wiley eBooks•Feb 10, 2025•0 citations

Quantum Image Processing

Fei Yan, Salvador Elías Venegas-Andraca

Springer eBooks•Jan 1, 2020•71 citations

Quantum methods of image analysis and processing in the frequency domain

Dilnoz Muhamediyeva, Narzullo Mamatov, Nilufar A’loxanovna Niyozmatova +2 more

Quantum methods for image analysis and processing in the frequency domain represent an innovative approach to image processing using quantum computing. One of the key tools in this field is the quantum Fourier transform (QFT), which can be applied to quantum images to analyze and process data in the frequency domain. The process involves several steps, including quantum image preparation, QFT application, frequency domain data processing, and inverse Fourier transform to reconstruct the spatial domain image. Quantum image processing techniques offer new opportunities for solving complex problems in the field of image processing, especially in the context of the use of quantum computing. However, this area is still under active research and requires further research and technology development for practical application.

International Conference on Digital Technologies, Optics, and Materials Science (DTIEE)•Jul 31, 2024•2 citations
The quantum Fourier transform (QFT) is the important operation in quantum computing. It is used in many algorithms, including the Shor's quantum algorithm for finding the prime factors of integers. Color image encryption, processing and representation of quantum images are areas where the QFT is also used. In this paper, we discuss the quantum superpositions of the images and methods of calculation of the analogues of the quantum 2-D discrete Fourier transform of images. The quantum algorithms and circuits will be described, and examples of calculation of the 2-D QFT of images of 8×8 and 16×16 pixels will be given in detail.
This chapter discusses quantum fast transforms that play a key role in the development of image processing techniques. It describes concepts of the discrete paired, Hadamard, and Fourier transforms and their circuits in quantum computation. The chapter focuses on the discrete paired transform, which is a core of the N-point discrete Hadamard and Fourier transforms. It also describes the simple quantum schemes for calculation of the paired transform and presents the method of implementation of the classical diagram for the circular convolution in the frequency domain. The chapter explains the analytical and matrix representations of the discrete Hadamard transform. It details the circuits for calculating quantum Fourier transform, which are based on the paired transform-based splitting. The N-point discrete Fourier transform is considered in the traditional form which is used in signal and image processing.
Quantum methods for image analysis and processing in the frequency domain represent an innovative approach to image processing using quantum computing. One of the key tools in this field is the quantum Fourier transform (QFT), which can be applied to quantum images to analyze and process data in the frequency domain. The process involves several steps, including quantum image preparation, QFT application, frequency domain data processing, and inverse Fourier transform to reconstruct the spatial domain image. Quantum image processing techniques offer new opportunities for solving complex problems in the field of image processing, especially in the context of the use of quantum computing. However, this area is still under active research and requires further research and technology development for practical application.