Quantum Image Representation with Enhanced Intensity Preservation and Fidelity (IP-QIR)
Abstract
1. Introduction
- 1.
- The proposal of the IP-QIR architecture for high-fidelity, intensity-preserving quantum image representation.
- 2.
- A comparative analysis of IP-QIR, FRQIs and NEQR on synthetic and SAR data and medical data.
- 3.
- A patch-based encoding approach that scales back on the use of qubits and circuit depth and is, thus, feasible with NISQ devices.
- 4.
- Large-scale experiments with evaluation based on metrics as indicators of logic size, circuit depth, encoding efficiency, pixel fidelity, and information preservation.
2. Motivation
3. Problem Statement
- 1.
- Intensity Preservation: Ensuring that pixel intensity values are accurately represented and reconstructed.
- 2.
- Resource Efficiency: Minimizing qubit usage and circuit depth, making simulations practical on current quantum platforms.
- 3.
- Scalability: Enabling the processing of real-world image datasets by focusing on smaller patches rather than full images.
Research Gaps and Future Directions
4. Related Work
4.1. Flexible Representation of Quantum Images (FRQIs)
4.2. Novel Enhanced Quantum Representation (NEQR)
4.3. Multi-Channel Quantum Image Representation (MCQI)
4.4. Generalized Quantum Image Representation (GQIR)
4.5. Fourier Transform-Based Quantum Representation (FTQR)
4.6. Quantum Image Lossless Processing Interface (QUALPI)
4.7. Quantum Representation of Multi-Wavelength Images (QRMW)
4.8. Entropy-Based and Structure-Aware Representations (EBA-QR & SA-QIR)
4.9. Enhanced FRQIs Variants (EFRQI)
4.10. Recent Advances in Image Processing and Their Relevance to IP-QIR
5. Proposed Method: Intensity-Preserving Quantum Image Representation (IP-QIR)
5.1. Formal Classification of IP-QIR
- FRQIs: Global rotation encoding, depth ;
- EFRQI: Optimized rotation with compression;
- IP-QIR: Hybrid amplitude encoding with structured state preparation.
5.2. Overview of the Proposed IP-QIR Method
- 1.
- Image Preprocessing Scaling: The quantum register necessities are converted to the required input dimension of . The pixels are vacuumed to the scale of to enable encoding using amplitude.
- 2.
- Intensity Mapping: Apply each normalized pixel intensity to a rotation angle, which settles the chance amplitudes of the intensive qubit.
- 3.
- Quantum Circuit Construction: A quantum circuit is built by adding position qubits with one intensity qubit, with the rotational gates being generalized to multi-controlled, updating intensities as needed, based on the spatial coordinates of a pixel.
- 4.
- Quantum Simulation and Measurement: The quantum simulator, which is the IBM Qiskit quantum simulator, is used to simulate the built circuit, and statistical measurements are taken.
- 5.
- Image Reconstruction and Evaluation: The original image is constructed using the results of the measurements, and performance measurements, including fidelity, information loss, and circuit complexity, are calculated.
5.3. Design of the IP-QIR System
5.4. Mathematical Formulation of IP-QIR
- denotes the quantum basis state encoding the pixel position. Specifically, qubits represent the x-coordinate, and qubits represent the y-coordinate.
- and correspond to the computational basis states of the intensity qubit.
- and are the probability amplitudes of measuring the intensity qubit in and , respectively, ensuring that
- This guarantees that the measured intensity reflects the original pixel value.
- The summation over all x and y positions creates a superposition encoding the entire image simultaneously, enabling parallel processing.
Example of IP-QIR (2 × 2 Image)
- The initial qubit means pixel intensity in a likely way. Measuring it yields
- The last two qubits encode the spatial coordinates .
- Amplitudes are implemented by the controlled gate of the quantum circuit to make the probability of measuring the of each pixel equal to the original intensity.
5.5. Consistent Angle Encoding
5.6. Design of Quantum Encoding Circuit
- Position Qubits: A total of qubits are used to encode the spatial coordinates of each pixel, where and for an image of size . These qubits uniquely identify the pixel location within the image grid.
- Intensity Qubit: A single qubit is dedicated to encoding the grayscale intensity of each pixel. Pixel values are normalized to the range prior to encoding.
- Controlled Rotation Encoding: Pixel intensities are mapped to the intensity qubit using multi-controlled rotation gates. For each pixel at position , a controlled gate is applied, where the rotation angle is defined as
- This formulation ensures that the probability of measuring the intensity qubit in the state corresponds directly to the original normalized pixel intensity .
- Conditional Association: Each operation is conditionally applied based on the corresponding position qubit states, guaranteeing a correct association between pixel location and intensity value.
| Algorithm 1 IP-QIR quantum image encoding algorithm based on controlled rotation operations applied to position and intensity qubits for efficient grayscale image representation in quantum states. |
|
5.7. Key Characteristics
- Improved pixel intensity coding with amplitude-controlled coding.
- Fewer qubits than those needed by computational basis encoding schemes.
- Moderate circuit depth compatible with NISQ-era quantum hardware.
- Scalability on synthetic, SAR and medical image datasets.
- The openness will be seamlessly integrated with quantum simulators, including IBM Qisket.
5.8. Evaluation Criteria
- Intensity Fidelity: Consistency between the original and reconstructed pixel intensities.
- Encoding Time: This is the amount of time to encode the quantum circuit.
- Circuit Complexity: Number of qubits and quantum gates that are utilized in the encoding process.
- Scalability: It remains the same when changing image size and datasets.
6. Dataset Description
6.1. Synthetic Images
- Image Size: and pixels.
- Intensity Range: The pixel values are standardized to .
- Purpose: To check whether the encoding process of IP-QIR is correct and determine the qubit requirements, the circuit depth, and pixel-wise fidelity.
6.2. Synthetic Aperture Radar (SAR) Images
- Source: Publicly available on Kaggle SAR image datasets [74].
- Image Size: pixel patches extracted from larger SAR images.
- Characteristics: Rich structural patterns with varying intensity distributions.
- Purpose: To assess the performance of IP-QIR in preserving spatial patterns and minimizing information loss in real-world imaging data.
6.3. Medical TB Chest X-Ray Images
- Source: Publicly available on Kaggle TB chest X-ray datasets [75].
- Image Size: pixel patches to be simulated on quantum.
- Characteristics: It has varied patterns of intensities that are associated with abnormalities and organs.
- Purpose: To prove the high resilience of IP-QIR in maintaining fine-grained intensity details that are useful for restoring medical images with good accuracy.
6.4. Preprocessing
- 1.
- Resizing: Images were downsampled to a size of to size them to the specifications of quantum position encoding.
- 2.
- Normalization: The pixel values are geared towards the dynamics of the range to map the intensity of an amplitude-based quantum coding.
- 3.
- Patch Extraction: SAR and medical datasets use patch extraction in both SAR and medical conditions; small image patches are extracted to simplify circuit models and make them easy to simulate.
7. Image Representation in Quantum States
7.1. Quantum Representation of Images
- is the number of overall pixels of the image;
- is the quantum state that represents the position of the i-th pixel;
- includes the coding of the intensity into a quantum state;
- is the normalized amplitude with pixel intensity.
7.2. IP-QIR Encoding Strategy
- 1.
- Position Encoding: Position qubits find state representations based on pixel meaning by means of position encoding using row and column indices.
- 2.
- Intensity Encoding: Pixel values are quantized with amplitude-preserving transformations, which has the advantage of ensuring that the mapping of the grayscale values in quantum states is precise.
- 3.
- Circuit Optimization: It can be used to encode (rather efficiently) intensity information with the use of controlled rotation and phase gates, with a lower circuit depth and gate count.
7.3. Illustrative Example: Image
7.4. Advantages of IP-QIR Representation
- High Intensity Fidelity: pixels of a picture have very precise pixel intensity values, which results in better reconstruction.
- Reduced Qubit Requirements: A smaller number of qubits is needed in comparison to NEQR, especially with larger images.
- Optimized Circuit Depth: The number of gates and the circuit depth are lowered to enhance functionality on NISQ machines and increase resistance to noise.
8. Impact of NISQ Noise on IP-QIR
Inspiration from Multimodal and Multi-Level Feature Learning
9. Experimental Setup
9.1. Datasets
- Synthetic Images: Grayscale and images were created to check the accuracy of the quantum encoding algorithm. These images offer medium-value pixel intensities that can be used to determine both reconstruction fidelity and circuit behavior accurately.
- SAR Urban Imagery: SAR images were used to extract grayscale patches, which were then used to test the strength of IP-QIR on real-world data that underwent high contrast, structural complexity, and natural noise.
- Medical TB Chest X-ray Images: Patches of TB chest X-ray images (publicly available surrogate images) in grayscale were used to test the ability of IP-QIR to preserve faint intensive differences used in the medical diagnosis process.
9.2. Hardware and Software Environment
- Processor: Intel Core i5 (10th Generation), 2.6 GHz;
- Memory: 16 GB RAM;
- Operating System: Windows 11;
- Software Stack: Python 3.11, IBM Qiskit 0.47.1, All simulations and implementations were carried out using Python with NumPy (v1.26.4), OpenCV (v4.9.0), and Matplotlib (v3.8.2).
9.3. Quantum Circuit Implementation
- FRQIs and NEQR: Traditional applications of FRQIs and NEQR were created, as per their original formulations, and were used as benchmarking approaches.
- IP-QIR Circuits: The proposed circuits utilize low-position and intensity qubits. Pixel intensities are coded by controlled rotation gates, and multi-controlled gate operations are used to manipulate pixel positions, where a pixel block is used when needed.
- Circuit Metrics: To measure the efficiency of computation and resource consumption, qubit count, gate count, and circuit depth were measured as per the method on each of the datasets.
9.4. Experimental Procedure
- 1.
- Preprocessing: Resize images to dimensions, and normalize pixel intensities to .
- 2.
- Quantum Encoding: Encode images using FRQI, NEQR, and IP-QIR circuits.
- 3.
- Simulation: Execute quantum circuits on the Qiskit Aer simulator, performing multiple runs to account for probabilistic outcomes.
- 4.
- Measurement and Reconstruction: Extract measurement probabilities to reconstruct classical images.
- 5.
- Comparative Analysis: Evaluate pixel fidelity, information loss, qubit usage, circuit depth, and encoding time for all methods.
10. Performance Parameters
10.1. Number of Qubits
10.2. Quantum Circuit Depth Analysis
10.3. Encoding Time Complexity in Quantum Image Representation
10.4. Pixel Intensity Fidelity
10.5. Information Loss
10.6. Mean Squared Error (MSE) and Peak Signal-to-Noise Ratio (PSNR)
10.7. Entropy
10.8. Compression Efficiency Analysis of the Proposed IP-QIR Framework
10.9. Comparative Performance
11. Results and Discussion
11.1. Comparative Analysis of Performance Parameters
11.1.1. Qubits Used
- Observations: As shown in Figure 8 the proposed IP-QIR is always lower in qubits than deterministic techniques like NEQR, MCQI and other baseline models. Using IP-QIR, a single patch of 4 × 4 images only uses 5 qubits when compared to 12 qubits in NEQR. For the 8 × 8 patch, the qubit demand rises only slightly higher than the requirement for IP-QIR, which is 7, compared to that needed by NEQR, which is 14. This shows that IP-QIR is able to attain high reconstruction fidelity with a small amount of quantum resource consumption in images of different sizes.
- Significance: The direct advantage of lower qubit utilization is the increased possibility of running simulations on NISQ devices and counteracting the effect of decoherence and accumulating gate errors. Their intensity encoding is probabilistic and based even more on intelligent rotations of a single intensity qubit (IP-QIR), which is why the efficiency is high and works on single-bit planes; this means no multi-bit second-plane encoding is involved. It is able to reduce not only quantum cost, but also retain intensity information on a high-fidelity basis.
- Trend: The qubit commitment of IP-QIR is sub-linear with growing patch size, unlike NEQR and MCQI, which are linear because deterministic encoding of the bits of pixel intensities is used. It is evident in this pronounced tendency that IP-QIR is better applied in larger image patches, providing a good trade-off between quantum resources count and quality of reconstruction.
11.1.2. Circuit Depth
- Observations: As shown in Figure 9 IP-QIR demonstrates a steady and moderate circuit depth at the patch level, where approximately 16 layers are sufficient to process individual 4 × 4 image patches. The overall circuit depth reported in Figure 9 (705 layers) corresponds to the complete image representation after combining all patches. In contrast, FRQIs can reach depths as high as 705 due to repeated controlled rotations, and NEQR requires 100–138 gates depending on the pixel intensity distribution. This shows that IP-QIR achieves similar reconstruction quality with significantly lower circuit complexity.
- Implications: Maintaining a moderate circuit depth ensures that quantum states remain coherent throughout the encoding and reconstruction process, minimizing the likelihood of noise-induced errors. When combined with low qubit usage, this makes IP-QIR highly suitable for implementation on NISQ-era quantum hardware, where both decoherence and gate errors are critical constraints.
- Analysis: IP-QIR leverages selective controlled rotations on intensity qubits, rather than fully controlled multi-qubit operations for every pixel as in NEQR. This design choice allows the method to preserve image fidelity while reducing the number of sequential gates, achieving an optimal balance between reconstruction accuracy and computational efficiency. Furthermore, this approach enables scalability to larger patches with minimal increase in circuit depth.
11.1.3. Gate Count
- Observations: Figure 10 for 4 × 4 image patches, IP-QIR requires approximately 80 quantum gates. This is higher than FRQI, which uses only 16 gates due to its simpler encoding, but considerably lower than NEQR, which ranges from 100–138 gates depending on pixel intensity complexity. This demonstrates that IP-QIR achieves a balance between resource usage and reconstruction fidelity.
- Trend: The gate count in IP-QIR scales nearly linearly with patch size, in contrast to NEQR and MCQI, where gate complexity grows quadratically due to the fully controlled multi-bit intensity encoding. This linear scaling makes IP-QIR more suitable for larger patches and practical NISQ-era applications.
- Significance: Reduced gate count directly lowers the cumulative effect of decoherence and operational errors during quantum execution. By keeping the number of gates moderate, IP-QIR enables feasible implementation on current quantum simulators and hardware while still preserving high image fidelity.
- Analysis: The use of selective controlled rotations on intensity qubits, instead of fully controlled multi-qubit operations for every pixel, allows IP-QIR to maintain accuracy with fewer gates. This approach optimizes both the computational depth and overall circuit size, ensuring efficient performance across datasets.
11.1.4. Encoding Time
- Observations: Figure 11 the fast encoding times of IP-QIR are as shown: around 0.08 s on 4 × 4 patches. The efficiency of the intensity-preserving probabilistic encoding technique is further evidenced by its performance being better than other techniques like GQIR (0.25 s), MCQI (0.22 s) and QUALPI (0.23 s).
- Trend: Encoding time varies with patch size in a moderate way, as it is also linear to the growth of controlled rotations and phase encoding processes. In contrast to deterministic multi-bit approaches such as NEQR, IP-QIR does not have quadratic growth of computation, and so it can serve larger patches.
- Significance: The short-encoded times allow nearly real-time quantum image processing, which is more than useful in cases where time is highly sensitive, like medical image processing and the high-speed interpretation of SAR images. The faster encoding is also less demanding with respect to computational demands between patches.
- Analysis: Multiplexing selective rotations and minimal qubits enables IP-QIR to optimize its memory and computation resources, with a desirable trade-off between speed and reconstruction fidelity on all of the tested datasets.
11.1.5. Simulation Time
- Observations: In Figure 12 IP-QIR simulation times are always very low, with a 4 × 4 patch taking between 0.39 and 0.41 s. Comparatively, NEQR takes longer than 0.47 s because it uses more qubits and has a complicated structure of gates. The FRQIs approach has moderate times of about 0.42 s, whereas other deterministic ways have times of more than 0.45 s.
- Trend: The patch size grows slowly but is still less than that of deterministic multi-qubit algorithms since IP-QIR utilizes fewer controlled rotations and fewer qubits, as it limits deep multi-controlled gates severely.
- Significance: Many simulation speeds offers an efficient method to test system code, do iterative tunings, and understand practical implementation in hybrid quantum-classical processing pipelines, which is important in applications that need multiple patch evaluations or where real-time analysis is needed.
- Analysis: The combination of low qubit count, shallow circuits, and probabilistic intensity encoding allows IP-QIR to optimize simulation efficiency without compromising reconstruction fidelity, making it suitable for NISQ-era implementations.
11.1.6. Intensity Preservation
- Observations: In Figure 13 IP-QIR has high scores of preservation of intensity of 0.7937 (Synthetic), 0.7356 (Medical TB chest X-ray) and 0.6806 (SAR patches). These values consistently outperform those of FRQIs (0.6896–0.7406) and NEQR (0.6688–0.7261) across all datasets.
- Trend: Although intensity preservation has a minor drop in more complex data (e.g., SAR with speckle noise), IP-QIR has the ability to maintain the relative distance between pixel values, which proves its effectiveness in a wide range of image types.
- Significance: Use of high intensity preservation is of great significance in applications demanding a high level of precision on a pixel level, i.e., medical diagnosing, remote sensing and texture recognition, where minute differences have great significance regarding diagnosis or operations.
- Analysis: Since IP-QIR supports probabilistic encoding of intensity, the subtle differences in the intensity can be better preserved using probabilistic coding compared to deterministic multi-bit plane encoding (such as NEQR), minimizing the quantization errors and maintaining low quantum resource utilization. This balance is what causes IP-QIR to be very suitable in NISQ-era quantum image processing.
11.1.7. Mean Squared Error (MSE)
- Observations: As shown in Figure 14, the values of mean squared error (MSE) in IP-QIR are the lowest in all datasets: Synthetic (0.206), Medical TB chest X-ray (0.264) and SAR patches (0.319). Such values mean that it is closer to the original image than FRQIs (0.3100740) and NEQR (0.3310726).
- Trend: MSE decreases marginally with the complexity of the dataset, e.g., greater structural variation or noise in SAR imagery; however, IP-QIR still has a decisive lead over the baseline methods.
- Significance: A low MSE indicates minimal variations regarding the original pixel intensities, and tiny details and nuances are retained. This is especially important when using in medical imaging (especially in achieving a diagnostically significant difference) and in SAR, where one needs to preserve edge and texture edges.
- Analysis: Combining the phasing of probability distributions of intensities with circuit optimization allows IP-QIR to reduce errors on reconstruction with fewer qubits and fewer layers than deterministic systems, such as NEQR, but there is still a trade-off between fidelity and NISQ compatibility.
11.1.8. Peak Signal-to-Noise Ratio (PSNR)
- Observations: As shown in Figure 15 the Peak Signal-to-Noise Ratio (PSNR) values attained by IP-QIR are as follows: synthetic images (6.855 dB), Medical TB chest X-ray patches (5.777 dB), and SAR patches (4.957 dB). The values are always greater than those for FRQIs (4.6894.740 dB) and NEQR (4.6684.726 dB), showing higher fidelity to reconstruction.
- Trend: There is also a slight decrease in PSNR for complex images and noise, e.g., SAR patches have the lowest PSNR, as they have speckles, but IP-QIR does not need as much for an advantage over baseline techniques.
- Significance: The higher the PSNR, the lower the visual distortion, and the more the structural and intensity details are preserved; this is important in areas such as medical diagnosis and remote sensing.
- Analysis: Probabilistic encoding of intensity combined with optimized quantum circuits enables IP-QIR to encode images at higher fidelity using fewer qubits and also with lower circuit depths than so-called deterministic models such as NEQR.
11.1.9. Measurement Entropy
- Observations: In Figure 16 IP-QIR attains the following entropy values: Synthetic images (0.99), Medical TB chest X-ray patches (0.97) and SAR patches (0.95). Deterministic algorithms, such as NEQR and MCQI, on the contrary, will have almost zero entropy by virtue of perfect intensity encoding.
- Trend: Entropy is slightly lower with the complexity and patch size of the image, and more structured intensity distributions were observed in the complex image, but IP-QIR always has higher levels of entropy than the deterministic models.
- Significance: High entropy underlines the richness of probabilistic quantum representation. effectively exploiting superposition to encode variations in intensity and enhancing its concentration.
- Analysis: IP-QIR enables concurrent delivery of multiple states of intensity, as represented in quantum representation, with possible benefits in compression, parallel processing, and combining quantum processing with classical image processing.
11.1.10. Compression Efficiency
- Observations: As shown in Figure 17 IP-QIR has a compression efficiency of 25.6, which is much better than NEQR (10.667) and FRQIs (18.2) in all datasets analyzed.
- Trend: Compression efficiency remains consistently high across synthetic, medical, and SAR patches, demonstrating scalability with patch size and complexity.
- Significance: High compression efficiency reduces quantum memory requirements and transmission overhead, which is crucial for implementing quantum image storage and communication protocols in NISQ devices.
- Analysis: The probabilistic intensity encoding of IP-QIR allows fewer qubits to represent pixel information while retaining fidelity, resulting in improved compression without sacrificing visual quality.
11.2. Patch-Based Reconstruction and Visual Analysis
- Even with probabilistic encoding, the FRQIs approach has a high visual fidelity to low complexity patterns.
- NEQR and IP-QIR have precise or approximate intensity preservation, which guarantees faithful reconstruction.
- The small artifacts, including small contrast loss or smoothing of FRQI, can be expected only in large-sized images, intricate textures, or in situations where fewer measurement shots or hardware noise are involved.
- The FRQIs approach produces visually smooth reconstructions due to its amplitude-based probabilistic encoding of pixel intensities. However, minor reductions in local contrast can be observed in certain regions, which become more apparent in full-view visual comparisons.
- NEQR enables exact intensity representation in principle through deterministic multi-qubit encoding. Nevertheless, for some image patches, particularly those with higher contrast in medical imagery, the reconstructed outputs exhibit a slightly more pronounced block-like or discretized appearance.
- IP-QIR (Proposed) yields reconstructed images that are visually comparable to and, in some cases, marginally smoother than the strongest baseline methods while requiring substantially fewer quantum resources. Specifically, IP-QIR achieves this performance using only 5 qubits, in contrast to the higher qubit overhead associated with NEQR.
11.3. Dataset-Wise Performance Evaluation
11.3.1. Synthetic Dataset Performance
11.3.2. Medical TB Chest X-Ray Dataset Performance
11.3.3. SAR Urban Dataset Performance
11.4. Performance Evaluation of IP-QIR on Benchmark Datasets
11.5. Noise Modeling Under NISQ Constraints
11.6. Ablation Study
11.6.1. Effect of Intensity Encoding Strategy
11.6.2. Effect of Pixel-to-Angle Mapping
11.6.3. Effect of Patch-Based Representation
11.6.4. Justification and Scope Limitation
- Evaluate scalability on larger image sizes (8 × 8, 16 × 16 and beyond);
- Incorporate hardware-aware optimizations for fair comparison with optimized baselines;
- Analyze performance under realistic NISQ noise models.
12. Conclusions
13. Future Work
Extension of IP-QIR to Color Images and Multispectral Images
14. Code and Dataset Availability Declaration
- SAR Dataset: The SAR dataset used in this work was obtained from Kaggle and consists of terrain-segregated radar images, used to evaluate the performance of the proposed IP-QIR framework on synthetic aperture radar imagery. Available at: https://www.kaggle.com/datasets/requiemonk/sentinel12-image-pairs-segregated-by-terrain (accessed on 13 April 2026).
- Medical Imaging Dataset: Tuberculosis (TB) chest X-ray dataset, used to assess the applicability of IP-QIR in medical imaging scenarios involving grayscale diagnostic images. Available at: https://www.kaggle.com/datasets/tawsifurrahman/tuberculosis-tb-chest-xray-dataset (accessed on 13 April 2026).
Author Contributions
Funding
Data Availability Statement
Acknowledgments
Conflicts of Interest
Appendix A. Additional Representation Examples
Appendix A.1. FRQI Example
Appendix A.2. NEQR Example
Appendix A.3. GQIR Example
Appendix A.4. FTQR Example
Appendix A.5. QUALPI Example
Appendix A.6. QRMW Example
Appendix A.7. EBA-QR & SA-QIR Example
Appendix A.8. EFRQIs Example
References
- Yan, F.; Iliyasu, A.M.; Jiang, Z. Quantum computation-based image representation, processing operations and their applications. Entropy 2014, 16, 5290–5338. [Google Scholar] [CrossRef]
- Mastriani, M.; Iyengar, S.S.; Kumar, L. Analysis of five techniques for the internal representation of a digital image inside a quantum processor. SN Comput. Sci. 2021, 2, 450. [Google Scholar] [CrossRef]
- Farooq, U.; Singh, P.; Kumar, A. A systematic review of quantum image processing: Representation, applications and future perspectives. Comput. Sci. Rev. 2025, 57, 100763. [Google Scholar] [CrossRef]
- Su, J.; Guo, X.; Liu, C.; Li, L. An improved novel quantum image representation and its experimental test on IBM quantum experience. Sci. Rep. 2021, 11, 13879. [Google Scholar] [CrossRef] [PubMed]
- Cai, Y.; Lu, X.; Jiang, N. A survey on quantum image processing. Chin. J. Electron. 2018, 27, 718–727. [Google Scholar] [CrossRef]
- Chakraborty, S.; Mandal, S.; Shaikh, S. Quantum image processing: Challenges and future research issues. arXiv 2020, arXiv:2008.12983. [Google Scholar] [CrossRef]
- Yan, F.; Iliyasu, A.M.; Venegas-Andraca, S.E. A survey of quantum image representations. Quantum Inf. Process. 2016, 15, 1–35. [Google Scholar] [CrossRef]
- Wang, Z. Review of quantum image processing. Arch. Comput. Methods Eng. 2019, 26, 769–786. [Google Scholar] [CrossRef]
- Haque, M.E.; Paul, M.; Ulhaq, A.; Debnath, T. Advanced quantum image representation and compression using a DCT-EFRQI approach. Sci. Rep. 2023, 13, 4129. [Google Scholar] [CrossRef]
- Jiang, N.; Wang, J.; Mu, Y. Quantum image scaling up based on nearest-neighbor interpolation. Quantum Inf. Process. 2015, 14, 4001–4026. [Google Scholar] [CrossRef]
- Song, X.; Wang, S.; Liu, S. A dynamic watermarking scheme for quantum images using quantum wavelet transform. Quantum Inf. Process. 2013, 12, 3689–3706. [Google Scholar] [CrossRef]
- Yuan, S.; Mao, X.; Li, T.; Xue, Y.; Chen, L.; Xiong, Q. Quantum morphology operations based on quantum representation model. Quantum Inf. Process. 2015, 14, 1625–1645. [Google Scholar] [CrossRef]
- Zhou, N.R.; Hua, T.X.; Gong, L.H.; Pei, D.J.; Liao, Q.H. Quantum image encryption based on generalized Arnold transform and double random-phase encoding. Quantum Inf. Process. 2015, 14, 1193–1213. [Google Scholar] [CrossRef]
- Hu, B.; Huang, X.; Zhou, R.; Wei, Y.; Wan, Q.; Pang, C. A theoretical framework for quantum image representation and data loading scheme. Sci. China Inf. Sci. 2014, 57, 032108. [Google Scholar] [CrossRef]
- Deb, S.K.; Pan, W.D. Quantum image compression: Fundamentals, algorithms, and advances. Computers 2024, 13, 187. [Google Scholar] [CrossRef]
- Geng, A.; Moghiseh, A.; Redenbach, C.; Schladitz, K. Improved FRQI on superconducting processors and its restrictions in the NISQ era. Quantum Inf. Process. 2023, 22, 104. [Google Scholar] [CrossRef]
- Le, P.Q.; Dong, F.; Hirota, K. A flexible representation of quantum images for polynomial preparation, image compression, and processing operations. Quantum Inf. Process. 2011, 10, 63–84. [Google Scholar] [CrossRef]
- Venegas-Andraca, S.E. Quantum walks: A comprehensive review. Quantum Inf. Process. 2012, 11, 1015–1106. [Google Scholar] [CrossRef]
- Grigoryan, A.M.; Gomez, A.; Agaian, S.S.; Panetta, K. Quantum edge detection and convolution using paired transform-based image representation. Information 2025, 16, 255. [Google Scholar] [CrossRef]
- Niu, X.; Song, X.H.; Wang, S. Multi-channel quantum image representation based on phase transform and elementary transformations. J. Inf. Hiding Multimed. Signal Process. 2014, 5, 574–585. [Google Scholar]
- Li, K.; Zhang, Y.; Lü, K.; Wang, X.; Wang, X. An optimized quantum representation for color digital images. Int. J. Theor. Phys. 2018, 57, 2938–2948. [Google Scholar] [CrossRef]
- Preskill, J. Quantum computing in the NISQ era and beyond. Quantum 2018, 2, 79. [Google Scholar] [CrossRef]
- Bharti, K.; Cervera-Lierta, A.; Kyaw, T.H.; Haug, T.; Alperin-Lea, S.; Anand, A.; Degroote, M.; Heimonen, H.; Kottmann, J.S.; Menke, T.; et al. Noisy intermediate-scale quantum algorithms. Rev. Mod. Phys. 2022, 94, 015004. [Google Scholar] [CrossRef]
- Alam, M.; Ash-Saki, A.A.; Ghosh, S. An efficient circuit compilation flow for quantum approximate optimization algorithm. In Proceeding of the 2020 57th ACM/IEEE Design Automation Conference (DAC), San Francisco, CA, USA, 20–24 July 2020; IEEE: Piscataway, NJ, USA, 2020; pp. 1–6. [Google Scholar] [CrossRef]
- Zheng, K.; Li, K.; Cong, S. A reconstruction algorithm for compressive quantum tomography using various measurement sets. Sci. Rep. 2016, 6, 38497. [Google Scholar] [CrossRef]
- Lohani, S.; Kirby, B.T.; Brodsky, M.; Danaci, O.; Glasser, R.T. Machine learning assisted quantum state estimation with improved fidelity. arXiv 2020, arXiv:2003.03441. [Google Scholar]
- Yan, F.; Huang, H.; Pedrycz, W.; Hirota, K. Review of medical image processing using quantum-enabled algorithms. Artif. Intell. Rev. 2024, 57, 300. [Google Scholar] [CrossRef]
- Yousif, S.; Al-Khateeb, B.; Garcia-Zapirain, B. A new quantum circuits of quantum convolutional neural network for X-ray image classification. IEEE Access 2024, 12, 65660–65671. [Google Scholar] [CrossRef]
- Cruz, H. A review of synthetic-aperture radar image formation algorithms. Remote Sens. 2022, 14, 1258. [Google Scholar] [CrossRef]
- Miller, L.; Uehara, G.; Sharma, A.; Spanias, A. Quantum image fusion methods for remote sensing. In Proceedings of the 2024 IEEE Aerospace Conference, Big Sky, MT, USA, 2–9 March 2024; IEEE: Piscataway, NJ, USA, 2024; pp. 1–9. [Google Scholar] [CrossRef]
- Stoudenmire, E.M.; Schwab, D.J. Supervised learning with tensor networks. In Proceedings of the 30th International Conference on Neural Information Processing Systems (NeurIPS), Barcelona, Spain, 5–10 December 2016; NeurIPS Foundation: San Diego, CA, USA; pp. 4799–4807.
- Nielsen, M.A.; Chuang, I.L. Quantum Computation and Quantum Information; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
- Willsch, M.; Willsch, D.; Jin, F.; De Raedt, H.; Michielsen, K. Benchmarking the quantum approximate optimization algorithm. Quantum Inf. Process. 2020, 19, 197. [Google Scholar] [CrossRef]
- McClean, J.R.; Romero, J.; Babbush, R.; Aspuru-Guzik, A. The theory of variational hybrid quantum-classical algorithms. New J. Phys. 2016, 18, 023023. [Google Scholar] [CrossRef]
- Schuld, M.; Killoran, N. Is quantum advantage the right goal for quantum machine learning? PRX Quantum 2022, 3, 030101. [Google Scholar] [CrossRef]
- Cerezo, M.; Verdon, G.; Huang, H.-Y.; Cincio, L.; Coles, P.J. Challenges and opportunities in quantum machine learning. Nat. Comput. Sci. 2022, 2, 567–576. [Google Scholar] [CrossRef]
- Stein, S.A.; Wiebe, N.O.; Ang, J.A.; Li, A. Benchmarking quantum processor performance through quantum distance metrics. In Proceedings of the 2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW), Lyon, France, 30 May–3 June 2022; IEEE: Piscataway, NJ, USA, 2022; pp. 618–624. [Google Scholar] [CrossRef]
- Liu, Y.-H.; Qi, Z.-D.; Liu, Q. Comparison of the similarity between two quantum images. Sci. Rep. 2022, 12, 7776. [Google Scholar] [CrossRef]
- Srivastava, M.; Moulick, S.K.; Panigrahi, P.K. Quantum image representation through 2D states. arXiv preprint 2013, arXiv:1305.2251. [Google Scholar] [CrossRef]
- Erkan, Z.; Rahebi, J.; Yelghi, A. Quantum image dataset transform (QIDT) for image processing. Quantum Inf. Process. 2025, 24, 156. [Google Scholar] [CrossRef]
- Xiao, Y.; Fonov, V.; Chakravarty, M.M.; Beriault, S.; Al Subaie, F.; Sadikot, A.; Pike, G.B.; Bertrand, G.; Collins, D.L. A dataset of multi-contrast population-averaged brain MRI atlases of a Parkinson’s disease cohort. Data Brief 2017, 12, 370–379. [Google Scholar] [CrossRef]
- Georgescu, I.M.; Ashhab, S.; Nori, F. Quantum simulation. Rev. Mod. Phys. 2014, 86, 153. [Google Scholar] [CrossRef]
- Sheikh, H.R.; Sabir, M.F.; Bovik, A.C. A statistical evaluation of recent full reference image quality assessment algorithms. IEEE Trans. Image Process. 2006, 15, 3440–3451. [Google Scholar] [CrossRef]
- Sugunapriya, A.; Markkandan, S. Variational quantum enhanced deep transfer learning for small underwater aqua species image classification. Sci. Rep. 2025, 15, 38551. [Google Scholar] [CrossRef] [PubMed]
- Duan, L.; Wang, J.; Qiao, S.; Ma, B. Quantum image representation methods: A survey and future directions. Inf. Fusion 2022, 79, 149–167. [Google Scholar] [CrossRef]
- Fonov, V.S.; Evans, A.C.; Botteron, K.; Almli, C.R.; McKinstry, R.C.; Collins, D.L.; Brain Development Cooperative Group. Unbiased average age-appropriate atlases for pediatric studies. NeuroImage 2011, 54, 313–327. [Google Scholar] [CrossRef]
- Qiskit Development Team. Qiskit: An open-source framework for quantum computing. Zenodo 2024. [Google Scholar] [CrossRef]
- Eisert, J.; Hangleiter, D.; Walk, N.; Roth, I.; Markham, D.; Parekh, R.; Chabaud, U.; Kashefi, E. Quantum certification and benchmarking. Nat. Rev. Phys. 2020, 2, 382–390. [Google Scholar] [CrossRef]
- Larson, E.C.; Chandler, D.M. Most apparent distortion: Full-reference image quality assessment and the role of strategy. J. Electron. Imaging 2010, 19, 011006. [Google Scholar] [CrossRef]
- Coppersmith, D. An approximate Fourier transform useful in quantum factoring. arXiv 2002, arXiv:quant-ph/0201067. [Google Scholar] [CrossRef]
- Kim, S. Scalable feed-forward and backward quantum image representation based on stereographic projection. Eng. Appl. Artif. Intell. 2026. [Google Scholar] [CrossRef]
- Madge, V.; Fonov, V.S.; Xiao, Y.; Zou, L.; Jackson, C.; Postuma, R.B.; Dagher, A.; Fon, E.A.; Collins, D.L. A dataset of multi-contrast unbiased average MRI templates of a Parkinson’s disease population. medRxiv 2022. [Google Scholar] [CrossRef]
- Shende, V.V.; Bullock, S.S.; Markov, I.L. Synthesis of quantum-logic circuits. IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst. 2006, 25, 1000–1010. [Google Scholar] [CrossRef]
- Devitt, S.J.; Munro, W.J.; Nemoto, K. Quantum error correction for beginners. Rep. Prog. Phys. 2013, 76, 076001. [Google Scholar] [CrossRef]
- Wien, M. High Efficiency Video Coding: Coding Tools and Specification; Springer: Berlin/Heidelberg, Germany, 2015. [Google Scholar] [CrossRef]
- Biamonte, J.; Wittek, P.; Pancotti, N.; Rebentrost, P.; Wiebe, N.; Lloyd, S. Quantum machine learning. Nature 2017, 549, 195–202. [Google Scholar] [CrossRef]
- Montanaro, A. Quantum algorithms: An overview. npj Quantum Inf. 2016, 2, 15023. [Google Scholar] [CrossRef]
- Dale, A.M.; Fischl, B.; Sereno, M.I. Cortical surface-based analysis: I. Segmentation and surface reconstruction. NeuroImage 1999, 9, 179–194. [Google Scholar] [CrossRef] [PubMed]
- Horodecki, R.; Horodecki, P.; Horodecki, M.; Horodecki, K. Quantum entanglement. Rev. Mod. Phys. 2009, 81, 865–942. [Google Scholar] [CrossRef]
- IBM Quantum System Two: Advancing quantum computing with 127+ qubit processors. IBM Res. 2024. Available online: https://www.ibm.com/quantum (accessed on 13 April 2026).
- Zhang, Y.; Lu, K.; Gao, Y.; Wang, M. NEQR: A novel enhanced quantum representation of digital images. Quantum Inf. Process. 2013, 12, 2833–2860. [Google Scholar] [CrossRef]
- Khandelwal, A.; Chandra, M.G.; Pramanik, S. On classifying images using quantum image representation. In Proceedings of the 2022 IEEE/ACM 7th Symposium on Edge Computing (SEC), Seattle, WA, USA, 5–8 December 2022; IEEE: Piscataway, NJ, USA, 2022; pp. 444–449. [Google Scholar] [CrossRef]
- Li, H.-S.; Chen, X.; Xia, H.; Liang, Y.; Zhou, Z. A quantum image representation based on bitplanes. IEEE Access 2018, 6, 62396–62404. [Google Scholar] [CrossRef]
- Mandal, A.; Banerjee, S.; Panigrahi, P.K. Quantum image representation on clusters. In Proceedings of the 2021 IEEE International Conference on Quantum Computing and Engineering (QCE), Broomfield, CO, USA, 17–22 October 2021; IEEE: Piscataway, NJ, USA, 2021; pp. 89–99. [Google Scholar] [CrossRef]
- Haque, M.E.; Paul, M.; Tohidi, F.; Ulhaq, A.; Debnath, T. Enhancing image representation and compression: An innovative NZ-NQER framework with block truncation quantum coding. In Proceedings of the International Conference on Digital Image Computing: Techniques and Applications (DICTA), Port Macquarie, Australia, 28 November–1 December 2023; IEEE: Piscataway, NJ, USA, 2023; pp. 304–311. [Google Scholar] [CrossRef]
- Boreiri, Z.; Azad, A.N.; Majd, N. Optimized quantum circuits in quantum image processing using Qiskit. In Proceedings of the 2022 International Conference on Machine Vision and Image Processing (MVIP), Ahvaz, Iran, 23–24 February 2022; IEEE: Piscataway, NJ, USA, 2022; pp. 1–7. [Google Scholar] [CrossRef]
- Hammou, I.; Ziet, L.; Kouadra, I.; Abdelhalim, B. Comparison between FRQI and NEQR representation. In Proceedings of the 2024 International Conference on Advances in Electrical and Communication Technologies (ICAECOT), Setif, Algeria, 1–3 October 2024; IEEE: Piscataway, NJ, USA, 2024; pp. 1–6. [Google Scholar] [CrossRef]
- Tiwari, A.; Sakhuja, S.; Britant. Benchmarking quantum image representation algorithms for hybrid-quantum applications. In Proceedings of the 2025 17th International Conference on COMmunication Systems and NETworks (COMSNETS), Bengaluru, India, 6–10 January 2025; IEEE: Piscataway, NJ, USA, 2025; pp. 1108–1113. [Google Scholar] [CrossRef]
- Singh, B.; Indu, S.; Majumdar, S. Development of a classification architecture for images represented using quantum theory using IBM Qiskit libraries. In Proceedings of the 2023 3rd International Conference on Artificial Intelligence and Signal Processing (AISP), Vijayawada, India, 18–20 March 2023; IEEE: Piscataway, NJ, USA, 2023; pp. 1–5. [Google Scholar] [CrossRef]
- Grigoryan, A.M.; Agaian, S.S. Conclusion and opportunities and challenges of quantum image processing. In Quantum Image Processing in Practice: A Mathematical Toolbox; Wiley: Hoboken, NJ, USA, 2025; pp. 285–289. [Google Scholar] [CrossRef]
- Haque, M.E.; Paul, M.; Ulhaq, A.; Debnath, T. A novel state connection strategy for quantum computing to represent and compress digital images. In Proceedings of the ICASSP 2023-2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Rhodes Island, Greece, 4–10 June 2023; IEEE: Piscataway, NJ, USA, 2023; pp. 1–5. [Google Scholar] [CrossRef]
- Xing, Z.; Lam, C.-T.; Yuan, X.; Im, S.-K.; Machado, P. MMQW: Multi-modal quantum watermarking scheme. IEEE Trans. Inf. Forensics Secur. 2024, 19, 5181–5195. [Google Scholar] [CrossRef]
- LaRose, R.; Tikku, A.; O’Neel-Judy, É.; Cincio, L.; Coles, P.J. Variational quantum state diagonalization. npj Quantum Inf. 2019, 5, 57. [Google Scholar] [CrossRef]
- RequieMonk. Sentinel-1 and Sentinel-2 Image Pairs Segregated by Terrain. Kaggle 2022. Available online: https://www.kaggle.com/datasets/requiemonk/sentinel12-image-pairs-segregated-by-terrain (accessed on 13 April 2026).
- Rahman, T. Tuberculosis (TB) Chest X-Ray Dataset. Kaggle 2022. Available online: https://www.kaggle.com/datasets/tawsifurrahman/tuberculosis-tb-chest-xray-dataset (accessed on 13 April 2026).
- Guo, H.; Sun, C.; Zhang, J.; Zhang, W.; Zhang, N. MMYFNet: Multi-modality YOLO fusion network for object detection in remote sensing images. Remote Sens. 2024, 16, 4451. [Google Scholar] [CrossRef]
- Silva, R.; Coelho, E.; Pimenta, N.; Durães, D.; Alves, V.; Bandeira, L.; Machado, J.; Novais, P.; Melo-Pinto, P. Multimodal object detection: An architecture using feature-level fusion and deep learning. Neural Comput. Appl. 2025, 37, 23799–23810. [Google Scholar] [CrossRef]
- Mi, Y.; Chi, M.; Zhang, Q.; Liu, P. Research on multi-scale fusion image enhancement and improved YOLOv5s lightweight detection. Sci. Rep. 2024, 14, 28280. [Google Scholar] [CrossRef]
- Zhao, Z.; Bai, H.; Zhang, J.; Zhang, Y.; Xu, S.; Lin, Z.; Van Gool, L. Correlation-driven dual-branch feature decomposition for multi-modality image fusion. arXiv 2022, arXiv:2211.14461. [Google Scholar] [CrossRef]
- Wang, Y.; Sun, H.; Wang, X.; Zhang, B.; Li, C.; Xin, Y.; Ding, E.; Han, S. MAFormer: A transformer network with multi-scale attention fusion for visual recognition. arXiv 2022, arXiv:2209.01620. [Google Scholar] [CrossRef]
- Dai, Y.; Gieseke, F.; Oehmcke, S.; Wu, Y.; Barnard, K. Attentional feature fusion. arXiv 2020, arXiv:2009.14082. [Google Scholar] [CrossRef]
- He, Y.; Xi, B.; Li, G.; Zheng, T.; Li, Y.; Xue, C.; Chanussot, J. Multilevel attention dynamic-scale network for hyperspectral and LiDAR data fusion classification. IEEE Trans. Geosci. Remote Sens. 2024, 62, 1–16. [Google Scholar] [CrossRef]
- Chen, X.; Liu, Z.-H.; Chen, H.-W.; Xu, C.-Z. QIPC: A Novel Quantum Image Representation Model for Polar Coordinate Images. Quantum Inf. Process. 2021, 21, 174. [Google Scholar] [CrossRef]
- Alsubai, S.; Alqahtani, A.; Binbusayyis, A.; Sha, M.; Gumaei, A.; Wang, S. A quantum computing-based accelerated model for image classification using a parallel pipeline encoded inception module. Mathematics 2023, 11, 2513. [Google Scholar] [CrossRef]
- Amankwah, M.G.; Camps, D.; Van Beeumen, R. Quantum pixel representations for multi-dimensional images. Sci. Rep. 2022, 12, 7712. [Google Scholar] [CrossRef] [PubMed]
- Zhang, J.; Zhang, Y.; Zhou, Y. Quantum-Inspired Spectral-Spatial Pyramid Network for Hyperspectral Image Classification. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Vancouver, BC, Canada, 18–22 June 2023; IEEE: Piscataway, NJ, USA, 2023; pp. 9925–9934. [Google Scholar] [CrossRef]
- Yu, X.; Tian, X. A fault detection algorithm based on immune neural network for pipeline monitoring. Int. J. Press. Vessel. Pip. 2022, 104611. [Google Scholar] [CrossRef]
- Qin, H.; Huang, X.; Wang, X.; Zhou, Z. Identification and classification of oil and gas pipeline intrusion events using CNN. PLoS ONE 2025, 20, e0338205. [Google Scholar] [CrossRef]
- Verma, P.; Gandhi, K.; Cheema, A.M.; Ashfaq, M.; Shah, D.; Ali, S.; Tahir, M. DeepPipeNet: Deep learning-based anomaly detection for pipeline monitoring. Discov. Appl. Sci. 2026, 8, 520. [Google Scholar] [CrossRef]
























| Dataset | Technique | Qubits | Depth | Encoding Time (s) | Fidelity | Information Loss |
|---|---|---|---|---|---|---|
| Synthetic | FRQI [16,17] | 5 | 705 | 0.145 | 0.6896 | 0.3104 |
| Synthetic | NEQR [9,45] | 10 | 25 | 0.153 | 0.6688 | 0.3312 |
| Synthetic | IP-QIR | 5 | 705 | 0.080 | 0.6801 | 0.3199 |
| SAR [74] | FRQI [16,17] | 3 | 4 | 0.00100 | 0.7406 | 0.2594 |
| SAR [74] | NEQR [9,45] | 10 | 4 | 0.00101 | 0.7261 | 0.2739 |
| SAR [74] | IP-QIR | 3 | 4 | 0.00101 | 0.8412 | 0.1588 |
| Medical [75] | FRQI [16,17] | 3 | 4 | 0.00101 | 0.7406 | 0.2594 |
| Medical [75] | NEQR [9,45] | 10 | 4 | 0.00101 | 0.7261 | 0.2739 |
| Medical [75] | IP-QIR | 3 | 4 | 0.00399 | 0.8412 | 0.1588 |
| Technique | Qubits | Circuit Depth | Gate Count | Encoding Time (s) | Simulation Time (s) | Intensity Preservation | MSE | PSNR (dB) | Measurement Entropy | Compression Efficiency |
|---|---|---|---|---|---|---|---|---|---|---|
| FRQI [16,17] | 5 | 705 | 16 | 0.15 | 0.41 | 0.7406 | 0.215 | 6.645 | 0.95 | 25.6 |
| NEQR [9,45] | 12 | 1000 | 138 | 0.28 | 0.49 | 0.7261 | 0.240 | 6.721 | 0.0 | 10.667 |
| MCQI [18] | 7 | 500 | 120 | 0.22 | 0.43 | 0.7152 | 0.256 | 6.532 | 0.45 | 14.2 |
| GQIR [24] | 6 | 600 | 105 | 0.25 | 0.44 | 0.7330 | 0.228 | 6.700 | 0.89 | 20.1 |
| FTQR [19] | 6 | 450 | 92 | 0.18 | 0.40 | 0.7045 | 0.261 | 6.500 | 0.88 | 18.3 |
| QUALPI [21] | 6 | 700 | 110 | 0.23 | 0.42 | 0.7201 | 0.238 | 6.612 | 0.90 | 15.3 |
| QRMW [22] | 7 | 520 | 95 | 0.21 | 0.41 | 0.7120 | 0.253 | 6.540 | 0.80 | 16.0 |
| QRCI [23] | 6 | 480 | 100 | 0.20 | 0.42 | 0.7180 | 0.245 | 6.570 | 0.85 | 17.5 |
| EFRQI [20] | 5 | 730 | 17 | 0.16 | 0.41 | 0.7420 | 0.213 | 6.658 | 0.96 | 25.0 |
| CQIR [25] | 6 | 490 | 102 | 0.22 | 0.43 | 0.7250 | 0.242 | 6.600 | 0.88 | 16.5 |
| IP-QIR | 5 | 300 | 80 | 0.08 | 0.40 | 0.7937 | 0.206 | 6.855 | 0.99 | 25.6 |
| Technique | Qubits | Circuit Depth | Gate Count | Encoding Time (s) | Simulation Time (s) | Intensity Preservation | MSE | PSNR (dB) | Measurement Entropy | Compression Efficiency |
|---|---|---|---|---|---|---|---|---|---|---|
| FRQI [16,17] | 5 | 705 | 16 | 0.15 | 0.41 | 0.7123 | 0.288 | 5.623 | 0.95 | 25.6 |
| NEQR [9,45] | 12 | 1000 | 138 | 0.28 | 0.49 | 0.7261 | 0.264 | 5.383 | 0.0 | 10.667 |
| MCQI [18] | 7 | 500 | 120 | 0.22 | 0.43 | 0.7055 | 0.292 | 5.601 | 0.45 | 14.2 |
| GQIR [24] | 6 | 600 | 105 | 0.25 | 0.44 | 0.7301 | 0.258 | 5.700 | 0.89 | 20.1 |
| FTQR [19] | 6 | 450 | 92 | 0.18 | 0.40 | 0.7030 | 0.295 | 5.550 | 0.88 | 18.3 |
| QUALPI [21] | 6 | 700 | 110 | 0.23 | 0.42 | 0.7100 | 0.283 | 5.500 | 0.90 | 15.3 |
| QRMW [22] | 7 | 520 | 95 | 0.21 | 0.41 | 0.7070 | 0.289 | 5.570 | 0.80 | 16.0 |
| QRCI [23] | 6 | 480 | 100 | 0.20 | 0.42 | 0.7090 | 0.286 | 5.590 | 0.85 | 17.5 |
| EFRQI [20] | 5 | 730 | 17 | 0.16 | 0.41 | 0.7135 | 0.285 | 5.610 | 0.96 | 25.0 |
| CQIR [25] | 6 | 490 | 102 | 0.22 | 0.43 | 0.7110 | 0.287 | 5.580 | 0.88 | 16.5 |
| IP-QIR | 5 | 300 | 80 | 0.08 | 0.40 | 0.7356 | 0.264 | 5.777 | 0.99 | 25.6 |
| Technique | Qubits | Circuit Depth | Gate Count | Encoding Time (s) | Simulation Time (s) | Intensity Preservation | MSE | PSNR (dB) | Measurement Entropy | Compression Efficiency |
|---|---|---|---|---|---|---|---|---|---|---|
| FRQI [16,17] | 5 | 705 | 16 | 0.15 | 0.41 | 0.6520 | 0.345 | 4.821 | 0.95 | 25.6 |
| NEQR [9,45] | 12 | 1000 | 138 | 0.28 | 0.49 | 0.6806 | 0.319 | 4.700 | 0.0 | 10.667 |
| MCQI [18] | 7 | 500 | 120 | 0.22 | 0.43 | 0.6605 | 0.335 | 4.750 | 0.45 | 14.2 |
| GQIR [24] | 6 | 600 | 105 | 0.25 | 0.44 | 0.6751 | 0.328 | 4.810 | 0.89 | 20.1 |
| FTQR [19] | 6 | 450 | 92 | 0.18 | 0.40 | 0.6550 | 0.340 | 4.730 | 0.88 | 18.3 |
| QUALPI [21] | 6 | 700 | 110 | 0.23 | 0.42 | 0.6632 | 0.338 | 4.730 | 0.90 | 15.3 |
| QRMW [22] | 7 | 520 | 95 | 0.21 | 0.41 | 0.6580 | 0.332 | 4.745 | 0.80 | 16.0 |
| QRCI [23] | 6 | 480 | 100 | 0.20 | 0.42 | 0.6610 | 0.330 | 4.755 | 0.85 | 17.5 |
| EFRQI [20] | 5 | 730 | 17 | 0.16 | 0.41 | 0.6535 | 0.342 | 4.770 | 0.96 | 25.0 |
| CQIR [25] | 6 | 490 | 102 | 0.22 | 0.43 | 0.6590 | 0.336 | 4.740 | 0.88 | 16.5 |
| IP-QIR | 5 | 300 | 80 | 0.08 | 0.40 | 0.6806 | 0.319 | 4.957 | 0.99 | 25.6 |
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2026 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license.
Share and Cite
Nikam, V.; Sane, S.; Motghare, M. Quantum Image Representation with Enhanced Intensity Preservation and Fidelity (IP-QIR). Quantum Rep. 2026, 8, 37. https://doi.org/10.3390/quantum8020037
Nikam V, Sane S, Motghare M. Quantum Image Representation with Enhanced Intensity Preservation and Fidelity (IP-QIR). Quantum Reports. 2026; 8(2):37. https://doi.org/10.3390/quantum8020037
Chicago/Turabian StyleNikam, Vrushali, Shirish Sane, and Manish Motghare. 2026. "Quantum Image Representation with Enhanced Intensity Preservation and Fidelity (IP-QIR)" Quantum Reports 8, no. 2: 37. https://doi.org/10.3390/quantum8020037
APA StyleNikam, V., Sane, S., & Motghare, M. (2026). Quantum Image Representation with Enhanced Intensity Preservation and Fidelity (IP-QIR). Quantum Reports, 8(2), 37. https://doi.org/10.3390/quantum8020037

