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

Wiley eBooks

Image Representation on the Unit Circle and MQFTR

Artyom M. Grigoryan, Sos S. Agaian

Published Feb 10, 2025• 0 citations
Publisher

Abstract

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.

DOI
10.1002/9781394265183.ch8

Related papers

Quantum Image Representation with Examples

Artyom M. Grigoryan, Sos S. Agaian

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.

Wiley eBooks•Feb 10, 2025•1 citation

Quantum image representation and processing: advances and novel approaches

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

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.

Multimodal Image Exploitation and Learning•Jun 9, 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

Quaternion Qubit Image Representation (QQIR)

Artyom M. Grigoryan, Sos S. Agaian

Quaternion qubit image representation aims to provide an efficient approach for representing and manipulating color images using quaternion algebra and 2-qubits in the quantum computing paradigm. The aim is to overcome the limitations of traditional image representations by leveraging the unique properties of quaternions and quantum computing. This chapter considers the RGB color model. The real part of this quaternion image is the grayscale image, and color image is its imaginary part. The chapter describes a simple model for quaternion images, wherein the four colors of the quaternion image are coded in one qubit at each pixel. Two concepts of the quaternion and quantum representations of color images can be united to obtain the so-called quaternion-in-quantum representation of color images. The chapter illustrates the concept of the square root of the image in quantum quaternion image representation.

Wiley eBooks•Feb 10, 2025•1 citation

Quantum Image Processing in Practice: A Mathematical Toolbox

Artyom M. Grigoryan, Sos С. Agaian

Comprehensive resource addressing the need for a quantum image processing machine learning model that can outperform classical neural networks Quantum Image Processing in Practice explores the transformative potential of quantum color image processing across various domains, including biomedicine, entertainment, economics, and industry. The rapid growth of image data, especially in facial recognition and autonomous vehicles, demands more efficient processing techniques. Quantum computing promises to accelerate digital image processing (DIP) to meet this demand. This book covers the role of quantum image processing (QIP) in quantum information processing, including mathematical foundations, quantum operations, image processing using quantum filters, quantum image representation, and quantum neural networks. It aims to inspire practical applications and foster innovation in this promising field. Topics include: Qubits and Quantum Logic Gates: Introduces qubits, the fundamental data unit in quantum computing, and their manipulation using quantum logic gates like Pauli matrices, rotations, the CNOT gate, and Hadamard matrices. The concept of entanglement, where qubits become interconnected, is also explored, highlighting its importance for applications like quantum teleportation and cryptography. Two and Multiple Qubit Systems: Demonstrates the importance of using two qubits to process color images, enabling image enhancement, noise reduction, edge detection, and feature extraction. Covers the tensor product, Kronecker sum, SWAP gate, and local and controlled gates. Extends to multi-qubit superpositions, exploring local and control gates for three qubits, such as the Toffoli and Fredkin gates, and describes the measurement of superpositions using projection operators. Transforms and Quantum Image Representations: Covers the Hadamard, Fourier, and Heap transforms and their circuits in quantum computation, highlighting their applications in signal and image processing. Introduces the quantum signal-induced heap transform for image enhancement, classification, compression, and filtration. Explores quantum representations and operations for images using the RGB, XYZ, CMY, HSI, and HSV color models, providing numerous examples. Fourier Transform Qubit Representation: Introduces a new model of quantum image representation, the Fourier transform qubit representation. Describes the algorithm and circuit for calculating the 2-D quantum Fourier transform, enabling advancements in quantum imaging techniques. New Operations and Hypercomplex Algebra: Presents new operations on qubits and quantum representations, including multiplication, division, and inverse operations. Explores hypercomplex algebra, specifically quaternion algebra, for its potential in color image processing. Quantum Neural Networks (QNNs): Discusses QNNs and their circuit implementation as advancements in machine learning driven by quantum mechanics. Summarizes various applications of QNNs and current trends and future developments in this rapidly evolving field. The book also addresses challenges and opportunities in QIP research, aiming to inspire practical applications and innovation. It is a valuable resource for researchers, students, and professionals interested in the intersection of quantum computing and color image processing applications, as well as those in visual communications, multimedia systems, computer vision, entertainment, and biomedical applications.

Wiley eBooks•Feb 10, 2025•8 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
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.
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.
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 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.
Quaternion qubit image representation aims to provide an efficient approach for representing and manipulating color images using quaternion algebra and 2-qubits in the quantum computing paradigm. The aim is to overcome the limitations of traditional image representations by leveraging the unique properties of quaternions and quantum computing. This chapter considers the RGB color model. The real part of this quaternion image is the grayscale image, and color image is its imaginary part. The chapter describes a simple model for quaternion images, wherein the four colors of the quaternion image are coded in one qubit at each pixel. Two concepts of the quaternion and quantum representations of color images can be united to obtain the so-called quaternion-in-quantum representation of color images. The chapter illustrates the concept of the square root of the image in quantum quaternion image representation.
Comprehensive resource addressing the need for a quantum image processing machine learning model that can outperform classical neural networks Quantum Image Processing in Practice explores the transformative potential of quantum color image processing across various domains, including biomedicine, entertainment, economics, and industry. The rapid growth of image data, especially in facial recognition and autonomous vehicles, demands more efficient processing techniques. Quantum computing promises to accelerate digital image processing (DIP) to meet this demand. This book covers the role of quantum image processing (QIP) in quantum information processing, including mathematical foundations, quantum operations, image processing using quantum filters, quantum image representation, and quantum neural networks. It aims to inspire practical applications and foster innovation in this promising field. Topics include: Qubits and Quantum Logic Gates: Introduces qubits, the fundamental data unit in quantum computing, and their manipulation using quantum logic gates like Pauli matrices, rotations, the CNOT gate, and Hadamard matrices. The concept of entanglement, where qubits become interconnected, is also explored, highlighting its importance for applications like quantum teleportation and cryptography. Two and Multiple Qubit Systems: Demonstrates the importance of using two qubits to process color images, enabling image enhancement, noise reduction, edge detection, and feature extraction. Covers the tensor product, Kronecker sum, SWAP gate, and local and controlled gates. Extends to multi-qubit superpositions, exploring local and control gates for three qubits, such as the Toffoli and Fredkin gates, and describes the measurement of superpositions using projection operators. Transforms and Quantum Image Representations: Covers the Hadamard, Fourier, and Heap transforms and their circuits in quantum computation, highlighting their applications in signal and image processing. Introduces the quantum signal-induced heap transform for image enhancement, classification, compression, and filtration. Explores quantum representations and operations for images using the RGB, XYZ, CMY, HSI, and HSV color models, providing numerous examples. Fourier Transform Qubit Representation: Introduces a new model of quantum image representation, the Fourier transform qubit representation. Describes the algorithm and circuit for calculating the 2-D quantum Fourier transform, enabling advancements in quantum imaging techniques. New Operations and Hypercomplex Algebra: Presents new operations on qubits and quantum representations, including multiplication, division, and inverse operations. Explores hypercomplex algebra, specifically quaternion algebra, for its potential in color image processing. Quantum Neural Networks (QNNs): Discusses QNNs and their circuit implementation as advancements in machine learning driven by quantum mechanics. Summarizes various applications of QNNs and current trends and future developments in this rapidly evolving field. The book also addresses challenges and opportunities in QIP research, aiming to inspire practical applications and innovation. It is a valuable resource for researchers, students, and professionals interested in the intersection of quantum computing and color image processing applications, as well as those in visual communications, multimedia systems, computer vision, entertainment, and biomedical applications.
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.