An enhanced quantum-based image fidelity metric, the QIFM metric, is proposed as a tool to assess the “congruity” between two or more quantum images. The often confounding contrariety that distinguishes between classical and quantum information processing makes the widely accepted peak-signal-to-noise-ratio (PSNR) ill-suited for use in the quantum computing framework, whereas the prohibitive cost of the probability-based similarity score makes it imprudent for use as an effective image quality metric. Unlike the aforementioned image quality measures, the proposed QIFM metric is calibrated as a pixel difference-based image quality measure that is sensitive to the intricacies inherent to quantum image processing (QIP). As proposed, the QIFM is configured with in-built non-destructive measurement units that preserve the coherence necessary for quantum computation. This design moderates the cost of executing the QIFM in order to estimate congruity between two or more quantum images. A statistical analysis also shows that our proposed QIFM metric has a better correlation with digital expectation of likeness between images than other available quantum image quality measures. Therefore, the QIFM offers a competent substitute for the PSNR as an image quality measure in the quantum computing framework thereby providing a tool to effectively assess fidelity between images in quantum watermarking, quantum movie aggregation and other applications in QIP.
An enhanced quantum-based image fidelity metric, the QIFM metric, is proposed as a tool to assess the “congruity” between two or more quantum images. The often confounding contrariety that distinguishes between classical and quantum information processing makes the widely accepted peak-signal-to-noise-ratio (PSNR) ill-suited for use in the quantum computing framework, whereas the prohibitive cost of the probability-based similarity score makes it imprudent for use as an effective image quality metric. Unlike the aforementioned image quality measures, the proposed QIFM metric is calibrated as a pixel difference-based image quality measure that is sensitive to the intricacies inherent to quantum image processing (QIP). As proposed, the QIFM is configured with in-built non-destructive measurement units that preserve the coherence necessary for quantum computation. This design moderates the cost of executing the QIFM in order to estimate congruity between two or more quantum images. A statistical analysis also shows that our proposed QIFM metric has a better correlation with digital expectation of likeness between images than other available quantum image quality measures. Therefore, the QIFM offers a competent substitute for the PSNR as an image quality measure in the quantum computing framework thereby providing a tool to effectively assess fidelity between images in quantum watermarking, quantum movie aggregation and other applications in QIP.
A wholly quantum-based metric to assess fidelity between quantum images (QIFM) is proposed. Unlike traditional image quality measures, such as the PSNR metric, the proposed QIFM is formulated as a pixel difference-based measure whose design conforms to the intricacies inherent to quantum image processing (QIP). Results from simulation-based implementation of the QIFM suggest that it is a better technique to quantify fidelity between quantum images. By using m qubits to encode a strip containing multiple cover and test images (each encoded using an additional n qubits) the implementation of the proposed QIFM framework requires 326n basic quantum gates and 26m Toffoli gates to execute. The proposed metric has the potential to offer a better and more effective tool to assess fidelity between images in quantum watermarking, quantum movie aggregation and other applications in QIP.
Quantum Image Processing (QIP) is a field that aims to utilize the benefits of quantum computing for manipulating and analyzing images. However, QIP faces two challenges: the limitation of qubits and the presence of noise in a quantum machine. In this research, we propose a novel approach to address the issue of noise in QIP. By training and employing a machine learning model that identifies and corrects the noise in quantum-processed images, we can compensate for the noisiness caused by the machine and retrieve a processing result similar to that performed by a classical computer with higher efficiency. The model is trained by learning a dataset consisting of both existing processed images and quantum-processed images from open-access datasets. This model will be capable of providing us with the confidence level for each pixel and its potential original value. To assess the model's accuracy in compensating for loss and decoherence in QIP, we evaluate it using three metrics: Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM), and Mean Opinion Score (MOS). Additionally, we discuss the applicability of our model across domains well as its cost effectiveness compared to alternative methods.
Quantum Image Processing (QIP) is a field that aims to utilize the benefits of quantum computing for manipulating and analyzing images. However, QIP faces two challenges: the limitation of qubits and the presence of noise in a quantum machine. In this research we propose a novel approach to address the issue of noise in QIP. By training and employing a machine learning model that identifies and corrects the noise in quantum processed images, we can compensate for the noisiness caused by the machine and retrieve a processing result similar to that performed by a classical computer with higher efficiency. The model is trained by learning a dataset consisting of both existing processed images and quantum processed images from open access datasets. This model will be capable of providing us with the confidence level for each pixel and its potential original value. To assess the model's accuracy in compensating for loss and decoherence in QIP, we evaluate it using three metrics: Peak Signal to Noise Ratio (PSNR), Structural Similarity Index (SSIM), and Mean Opinion Score (MOS). Additionally, we discuss the applicability of our model across domains well as its cost effectiveness compared to alternative methods.
In this paper, we describe the integration of quantum entropy and classical IQA (Image Quality Assessment) metrics based on the 8-qubit NEQR (Novel Enhanced Quantum Representation) quantum image coding method. NEQR technology allows encoding image intensities through quantum computation, which helps in efficient storage and processing of high-resolution images. Quantum entropy blocks allow for the estimation of the information density of quantum images, while comparing image quality and accuracy using classical IQA metrics (ACMO, BREN, CONT, GRAE, HISE, LAPD, Contrast, Sharpness) and reference metrics (MSE, PSNR, SSIM). The developed pipeline visualization is presented in a diagram and shows the connections between the quantum encoding process and classical assessment.
The Flexible Representation of Quantum Images (FRQI) is widely used for encoding images into normalized quantum states for secure processing. However, it suffers from high computational and qubit complexity, limiting its scalability. In addition, quantum comparator models, often employed for qubit comparison, remain vulnerable to geometric attacks such as scaling and rotation and require a slow embedding and extraction rate. To address these challenges, this paper proposes a novel quantum watermarking technique that integrates Quantum Image Representation (QIR) with the Novel Enhanced Quantum Representation (NEQR), offering improved efficiency, robustness, and security for quantum image processing (QIP). The proposed technique initiates watermark qubit (QB) generation by integrating pixel position bits (PPB) with an arithmetic average (AA)-based logic, implemented through a quantum circuit comprising reverse parallel adder (RPA), dividing-4 (D4) models, and controlled-NOT (CNOT) gates. For watermark embedding, the proposed circuit employs RPA, quantum equal (QE) models, CNOT gates, and Pauli-X gates, embedding the watermark via a least significant bit (LSB) strategy within the NEQR-encoded image. The extraction process mirrors the embedding architecture, utilizing reverse parallel subtractor (RPS), QE models, CNOT, and Pauli-X gates to ensure accurate watermark retrieval. Experimental results demonstrate high robustness by achieving the highest peak-signal-to-noise-ratio(PSNR) values of 59.97 decibels (dB) along with a structural similarity index matrix (SSIM) of 0.9999. The proposed framework is validated using IBM Qiskit-based quantum circuit simulation on classical computing hardware and is not intended to demonstrate fault-tolerant quantum hardware execution or provable quantum computational advantage. Rather, the work focuses on simulation-level reversible quantum-circuit modelling for secure image watermarking using NEQR-based image representation and quantum-compatible reversible logic structures. Furthermore, the proposed technique is subjected to a range of image processing attacks, quantum noise and decoherence to rigorously evaluate its resilience and performance. In addition, an AI-assisted attack classification module is incorporated to automatically identify the type of distortion applied to the attacked watermarked images. A lightweight Random Forest classifier is trained to classify different attack categories, including no attack, Gaussian noise, salt-and-pepper noise, median filtering, histogram equalization, JPEG compression, cropping, rotation, and text addition. The proposed AI-assisted module achieves an overall classification accuracy of 96.56%, demonstrating its effectiveness in automatic attack identification and further strengthening the applicability of the proposed quantum watermarking framework for secure image authentication. Resource analysis shows that the watermark generation circuit requires 354 QBs (including 320 for RPA, 10 for D4, and 24 for CNOT), while both embedding and extraction consume 400 QBs each. Theoretical evaluation and empirical validation confirm the technique’s effectiveness in preserving image integrity and confidentiality, establishing it as a viable approach for secure quantum image watermarking in real time applications.
The measurement of image similarity represents a fundamental task within the domain of image processing, enabling the application of sophisticated computational techniques to ascertain the degree of similarity between two images. To enhance the performance of these similarity measurement algorithms, the academic community has investigated a range of quantum algorithms. Notably, the swap test-based quantum inner product algorithm (ST-QIP) has emerged as a pivotal method for computing image similarity. However, the inherent destructive nature of the swap test necessitates multiple quantum state evolutions and measurements, which leads to consumption of quantum resources and prolonged computational time, ultimately constraining its practical applicability. To address these limitations, this study introduces an advanced quantum inner product algorithm based on amplitude estimation (AE-QIP) designed to compute image similarity. This innovative approach circumvents the repetitive measurement processes associated with the swap test, thereby optimizing the utilization of quantum resources and substantially enhancing the algorithm's performance. We conducted experiments using a quantum simulator to implement the AE-QIP algorithm and evaluate its effectiveness in the image retrieval tasks. It is found that the AE-QIP algorithm achieves comparable precision to the ST-QIP algorithm while exhibiting significant reductions in qubit consumption and average processing time. Additionally, our findings suggest that increasing the number of ancillary qubits can further enhance the accuracy of the AE-QIP algorithm. Overall, within the acceptable error thresholds, the AE-QIP algorithm exhibits enhanced efficiency relative to the ST-QIP algorithm. However, significant further research is needed to address the challenges involved in optimizing the performance of quantum retrieval systems as a whole.