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

arXiv:2306.09323 · AVS Quantum Science

Quantum JPEG

Simone Roncallo, Lorenzo Maccone, Chiara Macchiavello

Published Dec 1, 2023• 6 citations
arXivHTMLPDF

Abstract

The joint photographic expert group algorithm compresses a digital image by filtering its high spatial-frequency components. Similarly, we introduce a quantum algorithm that uses the quantum Fourier transform to discard the high spatial-frequency qubits of an image, downsampling it to a lower resolution. This allows one to capture, compress, and send images even with limited quantum resources for storage and communication. We show under which conditions this protocol is advantageous with respect to its classical counterpart.

DOI
10.1116/5.0177905

Related papers

Quantum frequency resampling

Emanuele Tumbiolo, Simone Roncallo, Chiara Macchiavello +1 more

Abstract In signal processing, resampling algorithms can modify the number of resources encoding a collection of data points. Downsampling reduces the cost of storage and communication, while upsampling interpolates new data from limited one, e.g., when resizing a digital image. We present a toolset of quantum algorithms to resample data encoded in the probabilities of a quantum register, using the quantum Fourier transform to adjust the number of high-frequency encoding qubits. We discuss advantage over classical resampling algorithms.

arXiv:2501.16283•npj Quantum Information•Jul 25, 2025•1 citation

An Overview of Quantum Circuit Design Focusing on Compression and Representation

Md Ershadul Haque, Manoranjan Paul, Faranak Tohidi +1 more

Quantum image computing has attracted attention due to its vast storage capacity and faster image data processing, leveraging unique properties such as parallelism, superposition, and entanglement, surpassing classical computers. Although classical computing power has grown substantially over the last decade, its rate of improvement has slowed, struggling to meet the demands of massive datasets. Several approaches have emerged for encoding and compressing classical images on quantum processors. However, a significant limitation is the complexity of preparing the quantum state, which translates pixel coordinates into corresponding quantum circuits. Current approaches for representing large-scale images require higher quantum resources, such as qubits and connection gates, presenting significant hurdles. This article aims to overview the pixel intensity and state preparation circuits requiring fewer quantum resources and explore effective compression techniques for medium and high-resolution images. It also conducts a comprehensive study of quantum image representation and compression techniques, categorizing methods by grayscale and color image types and evaluating their strengths and weaknesses. Moreover, the efficacy of each model’s compression can guide future research toward efficient circuit designs for medium- to high-resolution images. Furthermore, it is a valuable reference for advancing quantum image processing research by providing a systematic framework for evaluating quantum image compression and representation algorithms.

Electronics•Dec 27, 2024•4 citations

A Channel-Adaptive Quantum Transform-Domain Variable-Qubit Encoding for Quantum Image Transmission

Udara Jayasinghe, Thanuj Fernando, Anil Fernando

Reliable image transmission over noisy quantum channels is challenging due to qubit decoherence, channel fluctuations, and resource constraints. Quantum communication in the time domain often fail to maintain high image fidelity under varying channel conditions. To address this, we propose an adaptive quantum image transmission framework using variable-qubit transform-based encoding with the Quantum Fourier Transform (QFT) and perfect channel state information. The system dynamically selects the optimal qubit size based on real-time channel conditions, balancing resource usage and reconstruction quality. Images are source-encoded (JPEG or HEIF), converted to bitstreams, optionally channel-encoded, segmented by qubit size, quantum-encoded into multi-qubit states, and transformed to the frequency domain via QFT for transmission. At the receiver, inverse QFT, measurement, and decoding recover the bitstreams, followed by source decoding to reconstruct the images. Experiments show the adaptive frequency-domain variable-qubit system outperforms fixed-qubit and adaptive time-domain schemes, achieving Peak Signal-to-Noise Ratio (PSNR) up to 58.42 dB, Structural Similarity Index Measure (SSIM) up to 0.9992, and Universal Quality Index (UQI) up to 0.9999 for JPEG, and PSNR up to 70.05 dB, SSIM up to 0.9999, and UQI up to 0.9999 for HEIF. These results demonstrate superior fidelity and noise resilience, highlighting the promise of adaptive frequency-domain quantum encoding for robust image transmission.

International Conference on Communications•May 24, 2026•0 citations

A Robust Multi-Qubit Quantum Communication System for Image Transmission Over Error Prone Channels

Udara Jayasinghe, Namesh Kushantha, Thanuj Fernando +1 more

Multi-qubit encoding is a quantum encoding technique that uses multiple qubits to represent information, enabling higher data throughput. This study explores its application in compressed image transmission, comparing its performance to single-qubit encoding in both uncoded and channel-coded configurations. For image compression, JPEG and HEIF formats are used, with source coding rates adjusted to ensure similar bandwidth utilization. The compressed bitstream is optionally protected by channel coding before undergoing quantum encoding using qubit sizes from 1 to 8 for quantum channel transmission. At the receiver, quantum decoding reconstructs classical bits, followed by optional channel decoding, and finally, source decoding restores the image. Image quality is assessed using peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM) and universal quality index (UQI). Results show that increasing the qubit encoding size improves noise resilience, with eight-qubit encoding achieving a maximum channel SNR gain of 15 dB for JPEG and 17 dB for HEIF under channel coding, demonstrating greater robustness compared to single-qubit encoding but with higher computational complexity. To address this, an adaptive multi-qubit encoding process is proposed, dynamically adjusting qubit usage by utilizing fewer qubits for lower noise levels and higher qubits for higher noise conditions while balancing noise resilience and computational complexity under the assumption of perfect channel estimation.

IEEE Transactions on Consumer Electronics•Jul 31, 2025•25 citations

A Fast Quantum Image Compression Algorithm based on Taylor Expansion

Vu Tuan Hai, Huynh Ho Thi Mong Trinh, Pham Hoai Luan

With the increasing demand for storing images, traditional image compression methods face challenges in balancing the compressed size and image quality. However, the hybrid quantum-classical model can recover this weakness by using the advantage of qubits. In this study, we upgrade a quantum image compression algorithm within parameterized quantum circuits. Our approach encodes image data as unitary operator parameters and applies the quantum compilation algorithm to emulate the encryption process. By utilizing first-order Taylor expansion, we significantly reduce both the computational cost and loss, better than the previous version. Experimental results on benchmark images, including Lenna and Cameraman, show that our method achieves up to 86% reduction in the number of iterations while maintaining a lower compression loss, better for high-resolution images. The results confirm that the proposed algorithm provides an efficient and scalable image compression mechanism, making it a promising candidate for future image processing applications.

arXiv:2502.10684•International Conference on Electrical Engineering/Electronics, Computer, Telecommunications and Information Technology (ECTI-CON)•May 20, 2025•5 citations

Storing, processing, and retrieving an image using quantum mechanics

Salvador Elías Venegas-Andraca, Sougato Bose

We investigate the storage and retrieval of an image in a multi-particle quantum mechanical system. Several models are studied and compared with corresponding classical digital methods. We consider a situation in which qubits replace classical bits in an array of pixels and show several advantages. For example, we consider the situation in which 4 different values are randomly stored in a single qubit and show that quantum mechanical properties allow better reproduction of original stored values compared with classical (even stochastic) methods. The retrieval process is uniquely quantum (involves measurement in more than one bases). The independence and the finiteness of the stored copies of the image play an important role in the quantum protocol being better than the classical one. Other advantages of quantum storage of an image are found in its security.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Aug 5, 2003•413 citations
The joint photographic expert group algorithm compresses a digital image by filtering its high spatial-frequency components. Similarly, we introduce a quantum algorithm that uses the quantum Fourier transform to discard the high spatial-frequency qubits of an image, downsampling it to a lower resolution. This allows one to capture, compress, and send images even with limited quantum resources for storage and communication. We show under which conditions this protocol is advantageous with respect to its classical counterpart.
Abstract In signal processing, resampling algorithms can modify the number of resources encoding a collection of data points. Downsampling reduces the cost of storage and communication, while upsampling interpolates new data from limited one, e.g., when resizing a digital image. We present a toolset of quantum algorithms to resample data encoded in the probabilities of a quantum register, using the quantum Fourier transform to adjust the number of high-frequency encoding qubits. We discuss advantage over classical resampling algorithms.
Quantum image computing has attracted attention due to its vast storage capacity and faster image data processing, leveraging unique properties such as parallelism, superposition, and entanglement, surpassing classical computers. Although classical computing power has grown substantially over the last decade, its rate of improvement has slowed, struggling to meet the demands of massive datasets. Several approaches have emerged for encoding and compressing classical images on quantum processors. However, a significant limitation is the complexity of preparing the quantum state, which translates pixel coordinates into corresponding quantum circuits. Current approaches for representing large-scale images require higher quantum resources, such as qubits and connection gates, presenting significant hurdles. This article aims to overview the pixel intensity and state preparation circuits requiring fewer quantum resources and explore effective compression techniques for medium and high-resolution images. It also conducts a comprehensive study of quantum image representation and compression techniques, categorizing methods by grayscale and color image types and evaluating their strengths and weaknesses. Moreover, the efficacy of each model’s compression can guide future research toward efficient circuit designs for medium- to high-resolution images. Furthermore, it is a valuable reference for advancing quantum image processing research by providing a systematic framework for evaluating quantum image compression and representation algorithms.
Reliable image transmission over noisy quantum channels is challenging due to qubit decoherence, channel fluctuations, and resource constraints. Quantum communication in the time domain often fail to maintain high image fidelity under varying channel conditions. To address this, we propose an adaptive quantum image transmission framework using variable-qubit transform-based encoding with the Quantum Fourier Transform (QFT) and perfect channel state information. The system dynamically selects the optimal qubit size based on real-time channel conditions, balancing resource usage and reconstruction quality. Images are source-encoded (JPEG or HEIF), converted to bitstreams, optionally channel-encoded, segmented by qubit size, quantum-encoded into multi-qubit states, and transformed to the frequency domain via QFT for transmission. At the receiver, inverse QFT, measurement, and decoding recover the bitstreams, followed by source decoding to reconstruct the images. Experiments show the adaptive frequency-domain variable-qubit system outperforms fixed-qubit and adaptive time-domain schemes, achieving Peak Signal-to-Noise Ratio (PSNR) up to 58.42 dB, Structural Similarity Index Measure (SSIM) up to 0.9992, and Universal Quality Index (UQI) up to 0.9999 for JPEG, and PSNR up to 70.05 dB, SSIM up to 0.9999, and UQI up to 0.9999 for HEIF. These results demonstrate superior fidelity and noise resilience, highlighting the promise of adaptive frequency-domain quantum encoding for robust image transmission.
Multi-qubit encoding is a quantum encoding technique that uses multiple qubits to represent information, enabling higher data throughput. This study explores its application in compressed image transmission, comparing its performance to single-qubit encoding in both uncoded and channel-coded configurations. For image compression, JPEG and HEIF formats are used, with source coding rates adjusted to ensure similar bandwidth utilization. The compressed bitstream is optionally protected by channel coding before undergoing quantum encoding using qubit sizes from 1 to 8 for quantum channel transmission. At the receiver, quantum decoding reconstructs classical bits, followed by optional channel decoding, and finally, source decoding restores the image. Image quality is assessed using peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM) and universal quality index (UQI). Results show that increasing the qubit encoding size improves noise resilience, with eight-qubit encoding achieving a maximum channel SNR gain of 15 dB for JPEG and 17 dB for HEIF under channel coding, demonstrating greater robustness compared to single-qubit encoding but with higher computational complexity. To address this, an adaptive multi-qubit encoding process is proposed, dynamically adjusting qubit usage by utilizing fewer qubits for lower noise levels and higher qubits for higher noise conditions while balancing noise resilience and computational complexity under the assumption of perfect channel estimation.
With the increasing demand for storing images, traditional image compression methods face challenges in balancing the compressed size and image quality. However, the hybrid quantum-classical model can recover this weakness by using the advantage of qubits. In this study, we upgrade a quantum image compression algorithm within parameterized quantum circuits. Our approach encodes image data as unitary operator parameters and applies the quantum compilation algorithm to emulate the encryption process. By utilizing first-order Taylor expansion, we significantly reduce both the computational cost and loss, better than the previous version. Experimental results on benchmark images, including Lenna and Cameraman, show that our method achieves up to 86% reduction in the number of iterations while maintaining a lower compression loss, better for high-resolution images. The results confirm that the proposed algorithm provides an efficient and scalable image compression mechanism, making it a promising candidate for future image processing applications.
We investigate the storage and retrieval of an image in a multi-particle quantum mechanical system. Several models are studied and compared with corresponding classical digital methods. We consider a situation in which qubits replace classical bits in an array of pixels and show several advantages. For example, we consider the situation in which 4 different values are randomly stored in a single qubit and show that quantum mechanical properties allow better reproduction of original stored values compared with classical (even stochastic) methods. The retrieval process is uniquely quantum (involves measurement in more than one bases). The independence and the finiteness of the stored copies of the image play an important role in the quantum protocol being better than the classical one. Other advantages of quantum storage of an image are found in its security.