In this work, we describe a method of calculation of the 1-D circular quantum convolution of signals represented by 3-qubit superpositions in the computational basis states. The examples of the ideal low pass and high pass filters are described and quantum schemes for the 3-qubit circular convolution are presented. In the proposed method, the 3-qubit Fourier transform is used and one addition qubit, to prepare the quantum superposition for the inverse quantum Fourier transform. It is considered that the discrete Fourier transform of one of the signals is known and calculated in advance and only the quantum Fourier transform of another signal is calculated. The frequency characteristics of many linear time-invariant systems and filters are well known. Therefore, the described method of convolution can be used for these systems in quantum computation.
In this work, we describe a method of calculation of the 1-D circular quantum convolution of signals represented by 3-qubit superpositions in the computational basis states. The examples of the ideal low pass and high pass filters are described and quantum schemes for the 3-qubit circular convolution are presented. In the proposed method, the 3-qubit Fourier transform is used and one addition qubit, to prepare the quantum superposition for the inverse quantum Fourier transform. It is considered that the discrete Fourier transform of one of the signals is known and calculated in advance and only the quantum Fourier transform of another signal is calculated. The frequency characteristics of many linear time-invariant systems and filters are well known. Therefore, the described method of convolution can be used for these systems in quantum computation.
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.
The Fourier transform is a popular tool in many areas of practical mathematics, including data compression and signal processing. The underlying principle of the Fourier transform is that functions with the right characteristics may be expressed as a linear combination of trigonometric functions. Decomposing a signal using trigonometric functions is like taking a time-domain signal and separating its frequency-domain components; this opens up new and more efficient avenues for signal analysis and manipulation. An increasing number of people are looking at quantum image processing (QIP) as a way to enhance the efficiency of conventional methods and their applications by taking use of quantum computing's characteristics. Filtering and rectifying the frequency domain to get important picture information is the goal of both image design and interactive processing in this procedure. We demonstrate the operation of quantum operators and states in the context of quaternions and demonstrate how it may be used to expand the quantum complex Fourier transform (QCFT) to the quantum quaternion Fourier transform (QQFT). We demonstrate why convolution cannot be used to quantum image processing, and we create space-domain and quaternion-Fourier spectrum filters, including an edge detector and a quantum median filter. An enhanced method is used to provide the groundwork for the realization of picture design and interactive technology, drawing on the knowledge of FT and inverse transform.
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 shows that single qubits with real amplitudes can be multiplied and divided similarly to complex numbers. The inverse qubit is the complex conjugate qubit. The chapter describes new operations of qubits and quantum representations, which include multiplication of single qubits and properties; multiplication, division, and inverse between quantum superpositions; new representation of the quantum Fourier transform; ideal low- and high-pass filtration; and qubit quadratic equations. These operations can be used to process quantum computation images and signals. There are models of signal and image quantum representation, which use single qubits containing information of the signal or intensities or colors of the image at each point. The chapter considers a quadratic qubit equation and its solution with an example. There is a need to find new efficient operations on qubits, two-qubits, multi-qubits, and quantum superpositions to expand the capabilities in processing signals and images.
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.
Quantum information processing and its subfield, quantum image processing, are rapidly growing fields as a result of advancements in the practicality of quantum mechanics. In this paper, we propose a quantum algorithm for processing information, such as one-dimensional time series and two-dimensional images, in the frequency domain. The information of interest is encoded into the magnitude of probability amplitude or the coefficient of each basis state. The oracle for filtering operates based on postselection results, and its explicit circuit design is presented. This oracle is versatile enough to perform all basic filtering, including high pass, low pass, band pass, band stop, and many other processing techniques. Finally, we present two novel schemes for transposing matrices in this paper. They use similar encoding rules but with deliberate choices in terms of selecting basis states. These schemes could potentially be useful for other quantum information processing tasks, such as edge detection. The proposed techniques are implemented on the IBM Qiskit quantum simulator. Some results are compared with traditional information processing results to verify their correctness and are presented in this paper.