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

Quantum Communications and Quantum Imaging

Searching for a pixel's position in a grayscale quantum image with Grover's algorithm

Amor Gueddana

Published Oct 4, 2024• 1 citation
Publisher

Abstract

This work proposes a circuit implementation of the encoding circuit for an N × N grayscale-based Flexible Representation of Quantum Images (FRQI). The implementation is tested on the Qiskit simulator before being executed on real IBM Quantum hardware. The encoded FRQI, with a searched pixel encoded by a single qubit, is considered an unsorted database with a single table, where the key of the table represents the pixel’s position (x, y). The other columns represent the grayscale level at this position and the searched grayscale level, which are encoded by rotation angles and implemented using several multi-controlled rotation gates along the y-axis. Subsequently, Grover ’s algorithm is used to retrieve the position from the FRQI after performing a comparison with the given grayscale level of an individual pixel. The physical constraints associated with the IBM quantum device used are discussed, and the limitations of Grover ’s algorithm for searching the pixel are addressed.

DOI
10.1117/12.3025644

Related papers

Optimized Quantum Circuits in Quantum Image Processing Using Qiskit

Zahra Boreiri, Alireza Norouzi Azad, N. Majd

Quantum image representation is an essential component of quantum image processing and plays a critical role in quantum information processing. Flexible Representation of Quantum Images (FRQI) presents pixel colors and associated locations as a state to represent images on quantum computers. A fundamental part of the quantum image processing system is quantum image compression (QIC), which is utilized to maintain and retrieve binary images. This compression allows us to minimize the number of controlled rotation gates in the quantum circuits. This paper designed optimized quantum circuits and simulated them using Qiskit on a real quantum computer based on minimum boolean expressions to retrieve the 8×4 binary single-digit images. To demonstrate the feasibility and efficacy of quantum image representation, quantum circuits for images were developed using FRQI, and quantum image representation experiments were done on IBM Quantum Experience (IBMQ). We were able to visualize quantum information by doing the quantum measurement on the image information that we had prepared. Without utilizing this method, the number of controlled rotation gates is equal to the number of pixels in the image; however, we showed that by using the QIC algorithm, we could decrease the number of gates significantly. On these images, the maximum and minimum compression ratios of QIC are 90.63% and 68.75%, respectively.

Iranian Conference on Machine Vision and Image Processing•Feb 23, 2022•10 citations

Flexible Representation of Quantum Images and Its Computational Complexity Analysis

Le Quang Phuc, Dong Fangyang, Yoshinori Arai +1 more

Flexible Representation of Quantum Images (FRQI) is proposed to provide a representation of images that enables efficient preparation and image processing operators on quantum computers. FRQI captures colors and their corresponding positions in an image into a quantum state. The preparation with polynomial simple operations for FRQI turning a quantum computer from the initialized state to the FRQI state is done by using Hadamard and controlled rotation gates. The Quantum Image Compression (QIC) algorithm reduces simple operations used in the preparation process based on the minimization of Boolean equations are from same color groups of positions. Quantum image processing operators on FRQI based unitary transforms dealing with only colors, colors at some positions and the combination by the quantum Fourier transform of both colors and positions are addressed. The experiments for the storage and retrieval of images using FRQI are implemented in Matlab. The compression ratio of QIC among same color groups ranges from 6.67% to 31.62% on the Lena image.

•Jul 14, 2009•22 citations

Quantum Computation based Image Data Searching, Image Watermarking, and Representation of Emotion Space

Fei Yan

Quantum computation is a promising and rapidly growing field that has witnessed a series of significant breakthroughs in the last several decades.While some practitioners envision the realization of complete quantum computing devices, the research presented in the thesis focusses on the works that we can do with quantum computing hardware when they are realized.One of such areas is that of quantum image processing.A Flexible Representation of Quantum Images (FRQI) allows us to dedicate n-qubits and 1-qubit to capturing the information about the position and color of every pixel in the image, respectively.A method to compare multiple pairs of quantum images in parallel is proposed, where the similarities of the images are estimated according to the probability distributions of the readouts from quantum measurements.It offers a significant speed-up in comparison to performing the same task on traditional computing devices by means of a single Hadamard gate with control-conditions to transform the entire information encoding the quantum images in a strip.The simulation experiments comprising of the comparison of two images, multiple pairs of images, and the sub-blocks from two images are implemented to demonstrate the feasibility and efficiency of the parallel comparison.On the basis of such a comparison strategy, a quantum image searching method is presented where the image in a 4 × 4 binary image database with the highest similarity value to the particular test image is retrieved as the search result using low computational resources.To process the RGB-like quantum image, the representation for Multi-Channel Quantum Images (MCQI) is given, and a double-key, double-domain watermarking strategy for i

•Jan 1, 2014•3 citations

Comparison between FRQI and NEQR quantum algorithms applied in digital image processing: Master’s Thesis Summary

Joel Silos-Sánchez, Jazmín Rodríguez-Flores, Josué Román Martínez-Mireles +3 more

Quantum image processing represents a transformative approach to visual data analysis, leveraging the principles of quantum computing to overcome classical limitations. This work explores two prominent quantum image encoding methods: FRQI (Flexible Representation of Quantum Images) and NEQR (Novel Enhanced Quantum Representation). FRQI excels in qubit efficiency, making it suitable for hardware implementation, while NEQR offers superior precision in pixel intensity representation, ideal for complex image processing tasks. We detail the implementation of these algorithms, including preprocessing, quantum circuit design, and simulation, using platforms like Qiskit. The study highlights the potential of quantum image processing in fields such as medicine, industry, and environmental monitoring, while addressing challenges like qubit limitations and noise sensitivity. This research contributes to advancing quantum computing applications, paving the way for innovative and sustainable technological solutions.

International Journal of Combinatorial Optimization Problems and Informatics.•Mar 18, 2025•0 citations

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

Identification of Desired Pixels in an Image Using Grover's Quantum Search Algorithm

Iqbal, Basit, Singh, Harkirat

Quantum Information Theory promises to speed up computation so is observed in real quantum computers as proved to its classical counterpart. This revolutionizes every field linked directly or indirectly with computation. Grover algorithm in quantum information gives quadratic speed up in unstructured database search. With the availability of public online resources for quantum computers like IBM, quantum image processing came into the picture for making use of quantum computers in the image processing field. Our research interest is to find all darker pixels in a 2x2 grayscale image using Grover's algorithm. We studied it in two different ways. In the first method, I ran Grover's algorithm on the python generated classical image. In the second method, I converted a python-generated 2x2 image into a quantum image and then ran Grover's algorithm to locate the darker pixels. As has been observed in complexity analysis, Grover's unstructured search has the O(2^{n}) while as for classical schemes O(2^{2n+2m}), where m and n denote the dimensions of the image.

arXiv:2107.03053•Jul 7, 2021•5 citations
This work proposes a circuit implementation of the encoding circuit for an N × N grayscale-based Flexible Representation of Quantum Images (FRQI). The implementation is tested on the Qiskit simulator before being executed on real IBM Quantum hardware. The encoded FRQI, with a searched pixel encoded by a single qubit, is considered an unsorted database with a single table, where the key of the table represents the pixel’s position (x, y). The other columns represent the grayscale level at this position and the searched grayscale level, which are encoded by rotation angles and implemented using several multi-controlled rotation gates along the y-axis. Subsequently, Grover ’s algorithm is used to retrieve the position from the FRQI after performing a comparison with the given grayscale level of an individual pixel. The physical constraints associated with the IBM quantum device used are discussed, and the limitations of Grover ’s algorithm for searching the pixel are addressed.
Quantum image representation is an essential component of quantum image processing and plays a critical role in quantum information processing. Flexible Representation of Quantum Images (FRQI) presents pixel colors and associated locations as a state to represent images on quantum computers. A fundamental part of the quantum image processing system is quantum image compression (QIC), which is utilized to maintain and retrieve binary images. This compression allows us to minimize the number of controlled rotation gates in the quantum circuits. This paper designed optimized quantum circuits and simulated them using Qiskit on a real quantum computer based on minimum boolean expressions to retrieve the 8×4 binary single-digit images. To demonstrate the feasibility and efficacy of quantum image representation, quantum circuits for images were developed using FRQI, and quantum image representation experiments were done on IBM Quantum Experience (IBMQ). We were able to visualize quantum information by doing the quantum measurement on the image information that we had prepared. Without utilizing this method, the number of controlled rotation gates is equal to the number of pixels in the image; however, we showed that by using the QIC algorithm, we could decrease the number of gates significantly. On these images, the maximum and minimum compression ratios of QIC are 90.63% and 68.75%, respectively.
Flexible Representation of Quantum Images (FRQI) is proposed to provide a representation of images that enables efficient preparation and image processing operators on quantum computers. FRQI captures colors and their corresponding positions in an image into a quantum state. The preparation with polynomial simple operations for FRQI turning a quantum computer from the initialized state to the FRQI state is done by using Hadamard and controlled rotation gates. The Quantum Image Compression (QIC) algorithm reduces simple operations used in the preparation process based on the minimization of Boolean equations are from same color groups of positions. Quantum image processing operators on FRQI based unitary transforms dealing with only colors, colors at some positions and the combination by the quantum Fourier transform of both colors and positions are addressed. The experiments for the storage and retrieval of images using FRQI are implemented in Matlab. The compression ratio of QIC among same color groups ranges from 6.67% to 31.62% on the Lena image.
Quantum computation is a promising and rapidly growing field that has witnessed a series of significant breakthroughs in the last several decades.While some practitioners envision the realization of complete quantum computing devices, the research presented in the thesis focusses on the works that we can do with quantum computing hardware when they are realized.One of such areas is that of quantum image processing.A Flexible Representation of Quantum Images (FRQI) allows us to dedicate n-qubits and 1-qubit to capturing the information about the position and color of every pixel in the image, respectively.A method to compare multiple pairs of quantum images in parallel is proposed, where the similarities of the images are estimated according to the probability distributions of the readouts from quantum measurements.It offers a significant speed-up in comparison to performing the same task on traditional computing devices by means of a single Hadamard gate with control-conditions to transform the entire information encoding the quantum images in a strip.The simulation experiments comprising of the comparison of two images, multiple pairs of images, and the sub-blocks from two images are implemented to demonstrate the feasibility and efficiency of the parallel comparison.On the basis of such a comparison strategy, a quantum image searching method is presented where the image in a 4 × 4 binary image database with the highest similarity value to the particular test image is retrieved as the search result using low computational resources.To process the RGB-like quantum image, the representation for Multi-Channel Quantum Images (MCQI) is given, and a double-key, double-domain watermarking strategy for i
Quantum image processing represents a transformative approach to visual data analysis, leveraging the principles of quantum computing to overcome classical limitations. This work explores two prominent quantum image encoding methods: FRQI (Flexible Representation of Quantum Images) and NEQR (Novel Enhanced Quantum Representation). FRQI excels in qubit efficiency, making it suitable for hardware implementation, while NEQR offers superior precision in pixel intensity representation, ideal for complex image processing tasks. We detail the implementation of these algorithms, including preprocessing, quantum circuit design, and simulation, using platforms like Qiskit. The study highlights the potential of quantum image processing in fields such as medicine, industry, and environmental monitoring, while addressing challenges like qubit limitations and noise sensitivity. This research contributes to advancing quantum computing applications, paving the way for innovative and sustainable technological solutions.
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.
Quantum Information Theory promises to speed up computation so is observed in real quantum computers as proved to its classical counterpart. This revolutionizes every field linked directly or indirectly with computation. Grover algorithm in quantum information gives quadratic speed up in unstructured database search. With the availability of public online resources for quantum computers like IBM, quantum image processing came into the picture for making use of quantum computers in the image processing field. Our research interest is to find all darker pixels in a 2x2 grayscale image using Grover's algorithm. We studied it in two different ways. In the first method, I ran Grover's algorithm on the python generated classical image. In the second method, I converted a python-generated 2x2 image into a quantum image and then ran Grover's algorithm to locate the darker pixels. As has been observed in complexity analysis, Grover's unstructured search has the O(2^{n}) while as for classical schemes O(2^{2n+2m}), where m and n denote the dimensions of the image.