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.
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.
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 describes the basics of quantum computing in grayscale and color imaging and a few models of discrete image representation in the form of multi-qubit superpositions. A long list of different approaches exists for quantum signal and image representation. Many other gradient operators are used in image processing for edge extraction in different directions. Compared to other known models, the novel enhanced quantum representation (NEQR) model probably requires the highest number of qubits to represent an image. In the qubit lattice model, the discrete images are represented similarly to the model with quantum pixels. The choice of quantum image representation directly impacts the algorithms, efficiency, and design of quantum circuits used in processing. In the flexible representation for quantum images (FRQI) model, different geometric transformations can be performed. The quantum representation by amplitudes was used to calculate the quantum Fourier, Hartley, paired, and cosine transforms.
In this chapter, we will study the quantum Fourier transform and its application in different quantum algorithms. Problems such as factoring an integer into prime numbers or period finding are computationally intractable problems for a classical computer because of the exponentially large number of operations involved. Integer factoring and period finding can be efficiently solved using the quantum phase estimation algorithm that is heavily based on the quantum Fourier transform. Alternately, since quantum phase estimation aims to find the eigenvalue corresponding to an eigenvector of a unitary operator, it is backbone of important algorithms in optimization such as the HHL algorithm (named for Hassim, Harrow, and Lloyd), which serves as the matrix inversion routine in quantum computing. We start this chapter by revising our concepts of the Fourier transform and its discrete counterpart, the discrete Fourier transform , and then move on to the exciting domain of the quantum Fourier transform and the quantum phase estimation algorithm. We follow this up with a discussion and implementation of the few quantum Fourier transform–related algorithms such as factoring a number and period finding. At the end of the chapter, we briefly introduce the basics of group theory with an attempt to explain the hidden subgroup problem and how it relates to several of the Fourier transform–based algorithms.
In this model of quantum image representation, the concept of the Fourier transform qubit representation (FTQR) is used. Information of an image in each pixel is written in the phase of the basis state in the quantum superposition. There is no constraint on the size and range of the signal and image when using the FTQR. It possesses properties, such as the sum, amplification, shifting, that are not available for the known methods of quantum signal and image representation. Values of the signal can be mapped into the quarter unit circle by the transformation. This chapter explains the operations with Kronecker product. It considers FTQR Model for grayscale image, and color image FTQR models. The 2D discrete Fourier transform is used for processing images in the frequency domain in many tasks, such as linear filtration, image enhancement, and denoising.
Quantum Fourier transform (QFT) plays a key role in many quantum algorithms, but the existing circuits of QFT are incomplete and lacking the proof of correctness. Furthermore, it is difficult to apply QFT to the concrete field of information processing. Thus, this chapter firstly investigates quantum vision representation (QVR) and develops a model of QVR (MQVR). Then, four complete circuits of QFT and inverse QFT (IQFT) are designed. Meanwhile, this chapter proves the correctness of the four complete circuits using formula derivation. Next, 2D QFT and 3D QFT based on QVR are proposed. Experimental results with simulation show the proposed QFTs are valid and useful in processing quantum images and videos. In conclusion, this chapter develops a complete framework of QFT based on QVR and provides a feasible scheme for QFT to be applied in quantum vision information processing.
This work focuses into the emerging field of quantum image representation, which is a key for processing grayscale and color images on quantum computing platforms. We explore foundational methods like the qubit lattice model, the flexible representation for quantum images, the novel enhanced quantum representation, and the generalized quantum image representation, and categorize them into state-based, amplitude-based, and quaternion-based representations - the latter offering holistic color processing. A novel discrete signal representation mapping data on the unit circle will be introduced to simplify the Fourier transform concepts in quantum systems. We will examine crucial quantum operations, including quantum gradients, multiplication, square roots, Fourier transform, and filtering. Challenges in implementing the circular convolution on quantum hardware will be addressed with practical examples such as quantum low-pass and high-pass filters and 3-qubit convolution circuits. Additionally, we will discuss ongoing research into quantum algorithms inspired by classical transform processing, including the Fourier transforms, that leverage quantum states’ unique properties to achieve efficient encoding, transformation, and decoding of images.