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

Modern Electronics Technique

Image Compression Based on Quantum Haar Wavelet Transform

Song Hong Yan

Published Jan 1, 2011• 0 citations
OpenAlex

Abstract

The Haar wavelet algorithm based on quantum computing and its application for color image compression are discussed.Firstly,classical Haar wavelet operator is decomposed into direct sums,direct products and dot products of unitary matrices,so that shuffle permutation matrices is found.Secondly,based on the generalized Kronecker product,Harr functions are decomposed into a sequence of W-H and shuffle permutation matrices.Thirdly,the efficient,complete,quantum circuits for representative quantum wavelet transform are given.Finally,algorithm for color image compression by quantum Haar wavelet is presented,and experiment results are given.The experiment results show that the quantum Haar wavelet has very good feasibility in image compression.

Related papers

Quantum Harr wavelet transform and its complete circuits

XU Wen-bo

Because of the prominent advantages of quantum computation compared to classic computation,implementation of quantum wavelet transforms has profound significance to its completion and application.After the circuit for perfect shuffle permutation matrices is finished,the unitary matrices for Harr functions are decomposed into a sequence of W-H and perfect shuffle permutation matrices,based on the generalized Kronecker product.Then the quantum circuit for Harr matrices is provided,its realizable complexity and pos-sibility of physical implementation is analyzed.

Jisuanji gongcheng yu sheji•Jan 1, 2007•0 citations

Image compression using quantum wavelet transforms

Sri Harshavardhan Reddy Devarapalli, Harshdeep Jadhav, Jayasri Dontabhaktuni

Quantum computing has emerged as a revolutionary paradigm in numerous fields owing to its basis in quantum mechanical concepts such as quantum entanglement and parallelism. This has potential in various applications including computer vision, particularly, image processing and compression. Applications that depend on largescale image data for storing, processing, and transmission have to rely on compression methods for real-time processing. While the classical methods based on discrete cosine transformations (DCT used in JPEG) and discrete wavelet transformations (DWT) perform image compression efficiently, they suffer from trade-off between loss-less compression and compression ratios. In the current work, we would like to explore the usefulness of implementing quantum wavelet transforms for image compression for better PSNR values and execution times. We compare the application of quantum Haar wavelet transform (QHWT) with different quantum encoding methods such as NASS and FRQI and find that NASS-encoded images on application of QHWT gives better PSNR values and shorter runtime with visibly closer details to the original images, showcasing potential for efficient and faster image compression methods.

Quantum Computing, Communication, and Simulation•Jan 24, 2025•6 citations

Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits

Amir Fijany, Colin P. Williams

The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms, the wavelet transforms, which are every bit as useful as the Fourier transform. Wavelet transforms are used to expose the multi-scale structure of a signal and are likely to be useful for quantum image processing and quantum data compression. In this paper, we derive efficient, complete, quantum circuits for two representative quantum wavelet transforms, the quantum Haar and quantum Daubechies $D^{(4)}$ transforms. Our approach is to factor the operators for these transforms into direct sums, direct products and dot products of unitary matrices. In so doing, we find that permutation matrices, a particular class of unitary matrices, play a pivotal role. Surprisingly, we find that operations that are easy and inexpensive to implement classically are not always easy and inexpensive to implement quantum mechanically, and vice versa. In particular, the computational cost of performing certain permutation matrices is ignored classically because they can be avoided explicitly. However, quantum mechanically, these permutation operations must be performed explicitly and hence their cost enters into the full complexity measure of the quantum transform. We consider the particular set of permutation matrices arising in quantum wavelet transforms and develop efficient quantum circuits that implement them. This allows us to design efficient, complete quantum circuits for the quantum wavelet transform.

arXiv:quant-ph/9809004•Presented at•Sep 2, 1998•31 citations

Haar Wavelets in Quantum Computing

Wael Badawy

The Haar wavelet, introduced in 1910 as the simplest orthogonal wavelet, has re-emerged in the quantum era as a fundamental operator for scalable signal representation, image encoding, and computational efficiency. Its binary orthogonality, reversibility, and local support align naturally with the principles of quantum mechanics, where linear unitary transformations govern computation. This paper presents a comprehensive systematic review of sixty peer-reviewed studies published between 1997 and 2025 in IEEE, Elsevier, Springer, and arXiv sources that collectively define the landscape of Haar wavelet applications in quantum computing. Drawing from both theoretical and experimental literature, we categorize developments across four domains—foundational theory, quantum image representation, hardware realization, and hybrid quantum–classical applications. Findings reveal that Quantum Haar Wavelet Transforms (QHWTs) offer substantial advantages over Quantum Fourier Transforms (QFTs) and higher-order Daubechies wavelets. Their low circuit depth, real-valued coefficients, and logarithmic complexity$\left(O\left(\log ^{2} N\right)\right)$make them highly compatible with contemporary Noisy Intermediate-Scale Quantum (NISQ) devices. Empirical demonstrations across superconducting, photonic, and FPGA-emulated platforms achieve fidelity rates above 97% while reducing gate count by 35% and dynamic power consumption by 40%. Haar-based operations are now central to emerging quantum image frameworks such as the Flexible Representation of Quantum Images (FRQI), Novel Enhanced Quantum Representation (NEQR), and Improved Flexible Representation (IFRQI), which together underpin quantum image compression, edge detection, and encryption.

International Conference on Machine Intelligence and Smart Innovation (ICMISI)•May 9, 2026•0 citations

Quantum image encryption based on phase-shift transform and quantum Haar wavelet packet transform

Hai-Sheng Li, Chunyu Li, Xiao Chen +1 more

An algorithm of quantum image encryption based on a normal arbitrary superposition state (NASS) is proposed by using quantum geometric transform, phase-shift transform, and quantum Haar wavelet packet transform (QHWPT) in this paper. Firstly, to scramble an image, we design an implementation circuit of quantum image pixel exchanges along diagonal lines. Next, [Formula: see text] keys randomly distributed between 0 and [Formula: see text] are encoded in the encryption algorithm by using phase-shift transform. The huge key space makes it difficult to attack encrypted images. Then, we store image information in low frequency using QHWPT to improve encryption effect. After that, the encryption algorithms of gray image and color image are simulated by using MATLAB, respectively. Meanwhile, evaluation indexes such as histogram, complexity and correlation of adjacent pixels are analyzed. Simulation experiments show that the proposed algorithm is valid.

Modern Physics Letters A•Jun 27, 2019•23 citations

Multilevel 2-D Quantum Wavelet Transforms

Hai-Sheng Li, Ping Fan, Huiling Peng +2 more

Wavelet transform is being widely used in classical image processing. One-dimension quantum wavelet transforms (QWTs) have been proposed. Generalizations of the 1-D QWT into multilevel and multidimension have been investigated but restricted to the quantum wavelet packet transform (QWPTs), which is the direct product of 1-D QWPTs, and there is no transform between the packets in different dimensions. A 2-D QWT is vital for image processing. We construct the multilevel 2-D QWT's general theory. Explicitly, we built multilevel 2-D Haar QWT and the multilevel Daubechies D4 QWT, respectively. We have given the complete quantum circuits for these wavelet transforms, using both noniterative and iterative methods. Compared to the 1-D QWT and wavelet packet transform, the multilevel 2-D QWT involves the entanglement between components in different degrees. Complexity analysis reveals that the proposed transforms offer exponential speedup over their classical counterparts. Also, the proposed wavelet transforms are used to realize quantum image compression. Simulation results demonstrate that the proposed wavelet transforms are significant and obtain the same results as their classical counterparts with an exponential speedup.

IEEE Transactions on Cybernetics•Jan 27, 2021•49 citations
The Haar wavelet algorithm based on quantum computing and its application for color image compression are discussed.Firstly,classical Haar wavelet operator is decomposed into direct sums,direct products and dot products of unitary matrices,so that shuffle permutation matrices is found.Secondly,based on the generalized Kronecker product,Harr functions are decomposed into a sequence of W-H and shuffle permutation matrices.Thirdly,the efficient,complete,quantum circuits for representative quantum wavelet transform are given.Finally,algorithm for color image compression by quantum Haar wavelet is presented,and experiment results are given.The experiment results show that the quantum Haar wavelet has very good feasibility in image compression.
Because of the prominent advantages of quantum computation compared to classic computation,implementation of quantum wavelet transforms has profound significance to its completion and application.After the circuit for perfect shuffle permutation matrices is finished,the unitary matrices for Harr functions are decomposed into a sequence of W-H and perfect shuffle permutation matrices,based on the generalized Kronecker product.Then the quantum circuit for Harr matrices is provided,its realizable complexity and pos-sibility of physical implementation is analyzed.
Quantum computing has emerged as a revolutionary paradigm in numerous fields owing to its basis in quantum mechanical concepts such as quantum entanglement and parallelism. This has potential in various applications including computer vision, particularly, image processing and compression. Applications that depend on largescale image data for storing, processing, and transmission have to rely on compression methods for real-time processing. While the classical methods based on discrete cosine transformations (DCT used in JPEG) and discrete wavelet transformations (DWT) perform image compression efficiently, they suffer from trade-off between loss-less compression and compression ratios. In the current work, we would like to explore the usefulness of implementing quantum wavelet transforms for image compression for better PSNR values and execution times. We compare the application of quantum Haar wavelet transform (QHWT) with different quantum encoding methods such as NASS and FRQI and find that NASS-encoded images on application of QHWT gives better PSNR values and shorter runtime with visibly closer details to the original images, showcasing potential for efficient and faster image compression methods.
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms, the wavelet transforms, which are every bit as useful as the Fourier transform. Wavelet transforms are used to expose the multi-scale structure of a signal and are likely to be useful for quantum image processing and quantum data compression. In this paper, we derive efficient, complete, quantum circuits for two representative quantum wavelet transforms, the quantum Haar and quantum Daubechies D(4)D^{(4)}D(4) transforms. Our approach is to factor the operators for these transforms into direct sums, direct products and dot products of unitary matrices. In so doing, we find that permutation matrices, a particular class of unitary matrices, play a pivotal role. Surprisingly, we find that operations that are easy and inexpensive to implement classically are not always easy and inexpensive to implement quantum mechanically, and vice versa. In particular, the computational cost of performing certain permutation matrices is ignored classically because they can be avoided explicitly. However, quantum mechanically, these permutation operations must be performed explicitly and hence their cost enters into the full complexity measure of the quantum transform. We consider the particular set of permutation matrices arising in quantum wavelet transforms and develop efficient quantum circuits that implement them. This allows us to design efficient, complete quantum circuits for the quantum wavelet transform.
The Haar wavelet, introduced in 1910 as the simplest orthogonal wavelet, has re-emerged in the quantum era as a fundamental operator for scalable signal representation, image encoding, and computational efficiency. Its binary orthogonality, reversibility, and local support align naturally with the principles of quantum mechanics, where linear unitary transformations govern computation. This paper presents a comprehensive systematic review of sixty peer-reviewed studies published between 1997 and 2025 in IEEE, Elsevier, Springer, and arXiv sources that collectively define the landscape of Haar wavelet applications in quantum computing. Drawing from both theoretical and experimental literature, we categorize developments across four domains—foundational theory, quantum image representation, hardware realization, and hybrid quantum–classical applications. Findings reveal that Quantum Haar Wavelet Transforms (QHWTs) offer substantial advantages over Quantum Fourier Transforms (QFTs) and higher-order Daubechies wavelets. Their low circuit depth, real-valued coefficients, and logarithmic complexity(O(log⁡2N))\left(O\left(\log ^{2} N\right)\right)(O(log2N))make them highly compatible with contemporary Noisy Intermediate-Scale Quantum (NISQ) devices. Empirical demonstrations across superconducting, photonic, and FPGA-emulated platforms achieve fidelity rates above 97% while reducing gate count by 35% and dynamic power consumption by 40%. Haar-based operations are now central to emerging quantum image frameworks such as the Flexible Representation of Quantum Images (FRQI), Novel Enhanced Quantum Representation (NEQR), and Improved Flexible Representation (IFRQI), which together underpin quantum image compression, edge detection, and encryption.
An algorithm of quantum image encryption based on a normal arbitrary superposition state (NASS) is proposed by using quantum geometric transform, phase-shift transform, and quantum Haar wavelet packet transform (QHWPT) in this paper. Firstly, to scramble an image, we design an implementation circuit of quantum image pixel exchanges along diagonal lines. Next, [Formula: see text] keys randomly distributed between 0 and [Formula: see text] are encoded in the encryption algorithm by using phase-shift transform. The huge key space makes it difficult to attack encrypted images. Then, we store image information in low frequency using QHWPT to improve encryption effect. After that, the encryption algorithms of gray image and color image are simulated by using MATLAB, respectively. Meanwhile, evaluation indexes such as histogram, complexity and correlation of adjacent pixels are analyzed. Simulation experiments show that the proposed algorithm is valid.
Wavelet transform is being widely used in classical image processing. One-dimension quantum wavelet transforms (QWTs) have been proposed. Generalizations of the 1-D QWT into multilevel and multidimension have been investigated but restricted to the quantum wavelet packet transform (QWPTs), which is the direct product of 1-D QWPTs, and there is no transform between the packets in different dimensions. A 2-D QWT is vital for image processing. We construct the multilevel 2-D QWT's general theory. Explicitly, we built multilevel 2-D Haar QWT and the multilevel Daubechies D4 QWT, respectively. We have given the complete quantum circuits for these wavelet transforms, using both noniterative and iterative methods. Compared to the 1-D QWT and wavelet packet transform, the multilevel 2-D QWT involves the entanglement between components in different degrees. Complexity analysis reveals that the proposed transforms offer exponential speedup over their classical counterparts. Also, the proposed wavelet transforms are used to realize quantum image compression. Simulation results demonstrate that the proposed wavelet transforms are significant and obtain the same results as their classical counterparts with an exponential speedup.