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

International Conference on Machine Intelligence and Smart Innovation (ICMISI)

Haar Wavelets in Quantum Computing

Wael Badawy

Published May 9, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1109/icmisi69868.2026.11584171

Related papers

Quantum Haar Wavelet Transform methods applications and hardware realizations in quantum computing

Wael Badawy

Abstract Quantum Haar Wavelet Transform (QHWT) methods connect multiresolution analysis with quantum information processing through reversible averaging and differencing operations that can be implemented with comparatively compact circuits. Their localized basis functions, real-valued binary structure, and compatibility with hierarchical state representations make them attractive for resource-constrained quantum processing. Nevertheless, claims of practical superiority are difficult to generalize because published studies use heterogeneous encodings, simulators, hardware platforms, noise models, and evaluation metrics. This systematic review examines scholarly work on Haar-based quantum methods published between 1997 and March 2025. A PRISMA-oriented protocol was used to search major engineering and computing databases, remove duplicates, screen records, assess eligibility, and construct a qualitative evidence corpus. The review includes peer-reviewed journal and conference studies together with a limited number of historically influential technical reports and preprints; therefore, the corpus is described as scholarly literature rather than as a uniformly peer-reviewed dataset. Because the reported experiments are not sufficiently homogeneous for statistical pooling, numerical results are treated as study-specific evidence rather than global averages. The review makes three analytical contributions. First, it introduces a unified conceptual framework that links mathematical foundations, circuit realization, application design, hardware evaluation, and research translation. Second, it develops a taxonomy spanning transform theory, quantum image and signal processing, hardware implementation, and emerging quantum artificial intelligence and security applications. Third, it critically compares QHWT with Quantum Fourier Transform and higher-order wavelet approaches by distinguishing circuit depth, gate complexity, approximation behavior, hardware assumptions, and empirical validation. The synthesis indicates that QHWT is most compelling when localization, reversible multiresolution processing, and shallow circuit structure are more important than smooth-basis approximation. Individual studies report promising compression, feature-extraction, and hardware-efficiency results, but these findings remain conditional on encoding choices and platform constraints. Important limitations include sparse cross-platform benchmarking, limited fault-tolerant analysis, noise sensitivity, uncertain scaling, and optimization difficulties in variational quantum learning, including barren plateaus. The resulting roadmap prioritizes reproducible benchmarks, hardware-aware circuit design, explicit complexity reporting, error-mitigation studies, and validation on larger quantum systems.

Discover Applied Sciences•Oct 2, 2026•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

A Comparative Study of Quantum Haar Wavelet and Quantum Fourier Transforms for Quantum Image Transmission

Udara Jayasinghe, Thanuj Fernando, Anil Fernando

Quantum communication has achieved significant performance gains compared to classical systems but remains sensitive to channel noise and decoherence. These limitations become especially critical in quantum image transmission, where high-dimensional visual data must be preserved with both structural fidelity and robustness. In this context, transform-based quantum encoding methods have emerged as promising approaches, yet their relative performance under noisy conditions has not been fully explored. This paper presents a comparative study of two such methods, the quantum Fourier transform (QFT) and the quantum Haar wavelet transform (QHWT), within an image transmission framework. The process begins with source coding (JPEG/HEIF), followed by channel coding to enhance error resilience. The bitstreams are then mapped into quantum states using variable qubit encoding and transformed using either QFT or QHWT prior to transmission over noisy quantum channels. At the receiver, the corresponding decoding operations are applied to reconstruct the images. Simulation results demonstrate that the QFT achieves superior performance under noisy conditions, consistently delivering higher Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), and Universal Quality Index (UQI) values across different qubit sizes and image formats compared to the QHWT. This advantage arises because QFT uniformly spreads information across all basis states, making it more resilient to noise. By contrast, QHWT generates localized coefficients that capture structural details effectively but become highly vulnerable when dominant coefficients are corrupted. Consequently, while QHWT emphasizes structural fidelity, QFT provides superior robustness, underscoring a fundamental trade-off in quantum image communication.

Information•Nov 6, 2025•0 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

Quantum computing in image processing: A review of applications, models, and prospects

Keerti Kulkarni, Priyadarshini K Desai

Quantum computing is increasingly being viewed as a promising direction for the future of image processing. Conventional approaches to image classification, enhancement, compression, and restoration, although highly developed, often struggle with scalability, computational complexity, and data security—especially when processing high-dimensional or sensitive visual information. This survey explores how quantum computing can help address these limitations through quantum image representation models such as FRQI and NEQR, variational quantum circuits, and hybrid quantum–classical architectures. The primary objective of this review is to present a clear and structured overview of the current state of quantum image processing (QIP). It discusses foundational representation models, emerging hybrid learning techniques, available software frameworks and simulators, benchmarking practices, and practical applications in areas such as medical imaging, remote sensing, and biometric security. Particular attention is given to solutions that are feasible on today’s NISQ-era hardware, including hybrid architectures and quantum-secured image processing schemes. The survey concludes by identifying existing challenges and outlining realistic future research directions. Overall, it emphasizes the practical importance of hybrid models, the need for standardized quantum-oriented benchmarks, and the growing potential of quantum-based security mechanisms for safeguarding visual data.

Franklin Open•May 14, 2026•3 citations

A Comprehensive Review of Quantum Computing: Theoretical Foundations, Hardware Architectures, and Present-Era Challenges

Priyanka M C S

Quantum computing represents a foundational paradigm shift from traditional classical computational models, leveraging the intrinsic mechanics of quantum physics—specifically superposition, entanglement, and unitary interference—to execute parallel processing frameworks at an exponential operational scale. This state-of-the-art review systematically deconstructs the mathematical framework of quantum bit (qubit) state vectors within complex Hilbert spaces and details pioneering algorithms like Shor's and Grover's operations. Furthermore, we evaluate dominant contemporary hardware frameworks, specifically contrasting superconducting circuits against trapped-ion architectures across critical indices of coherence metrics, operational speeds, and thermal constraints. Finally, this review highlights systemic algorithmic barriers including phase-flip/bit-flip noise profiles, decoherence phenomena, and real-world deployment challenges across cryptographic infrastructure and biochemical modeling matrices, charting the roadmap from Noisy Intermediate-Scale Quantum (NISQ) systems toward scalable, fault-tolerant ecosystems.

International Journal of Science and Technology (IJST)•Oct 1, 2026•0 citations
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.
Abstract Quantum Haar Wavelet Transform (QHWT) methods connect multiresolution analysis with quantum information processing through reversible averaging and differencing operations that can be implemented with comparatively compact circuits. Their localized basis functions, real-valued binary structure, and compatibility with hierarchical state representations make them attractive for resource-constrained quantum processing. Nevertheless, claims of practical superiority are difficult to generalize because published studies use heterogeneous encodings, simulators, hardware platforms, noise models, and evaluation metrics. This systematic review examines scholarly work on Haar-based quantum methods published between 1997 and March 2025. A PRISMA-oriented protocol was used to search major engineering and computing databases, remove duplicates, screen records, assess eligibility, and construct a qualitative evidence corpus. The review includes peer-reviewed journal and conference studies together with a limited number of historically influential technical reports and preprints; therefore, the corpus is described as scholarly literature rather than as a uniformly peer-reviewed dataset. Because the reported experiments are not sufficiently homogeneous for statistical pooling, numerical results are treated as study-specific evidence rather than global averages. The review makes three analytical contributions. First, it introduces a unified conceptual framework that links mathematical foundations, circuit realization, application design, hardware evaluation, and research translation. Second, it develops a taxonomy spanning transform theory, quantum image and signal processing, hardware implementation, and emerging quantum artificial intelligence and security applications. Third, it critically compares QHWT with Quantum Fourier Transform and higher-order wavelet approaches by distinguishing circuit depth, gate complexity, approximation behavior, hardware assumptions, and empirical validation. The synthesis indicates that QHWT is most compelling when localization, reversible multiresolution processing, and shallow circuit structure are more important than smooth-basis approximation. Individual studies report promising compression, feature-extraction, and hardware-efficiency results, but these findings remain conditional on encoding choices and platform constraints. Important limitations include sparse cross-platform benchmarking, limited fault-tolerant analysis, noise sensitivity, uncertain scaling, and optimization difficulties in variational quantum learning, including barren plateaus. The resulting roadmap prioritizes reproducible benchmarks, hardware-aware circuit design, explicit complexity reporting, error-mitigation studies, and validation on larger quantum systems.
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 communication has achieved significant performance gains compared to classical systems but remains sensitive to channel noise and decoherence. These limitations become especially critical in quantum image transmission, where high-dimensional visual data must be preserved with both structural fidelity and robustness. In this context, transform-based quantum encoding methods have emerged as promising approaches, yet their relative performance under noisy conditions has not been fully explored. This paper presents a comparative study of two such methods, the quantum Fourier transform (QFT) and the quantum Haar wavelet transform (QHWT), within an image transmission framework. The process begins with source coding (JPEG/HEIF), followed by channel coding to enhance error resilience. The bitstreams are then mapped into quantum states using variable qubit encoding and transformed using either QFT or QHWT prior to transmission over noisy quantum channels. At the receiver, the corresponding decoding operations are applied to reconstruct the images. Simulation results demonstrate that the QFT achieves superior performance under noisy conditions, consistently delivering higher Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), and Universal Quality Index (UQI) values across different qubit sizes and image formats compared to the QHWT. This advantage arises because QFT uniformly spreads information across all basis states, making it more resilient to noise. By contrast, QHWT generates localized coefficients that capture structural details effectively but become highly vulnerable when dominant coefficients are corrupted. Consequently, while QHWT emphasizes structural fidelity, QFT provides superior robustness, underscoring a fundamental trade-off in quantum image communication.
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.
Quantum computing is increasingly being viewed as a promising direction for the future of image processing. Conventional approaches to image classification, enhancement, compression, and restoration, although highly developed, often struggle with scalability, computational complexity, and data security—especially when processing high-dimensional or sensitive visual information. This survey explores how quantum computing can help address these limitations through quantum image representation models such as FRQI and NEQR, variational quantum circuits, and hybrid quantum–classical architectures. The primary objective of this review is to present a clear and structured overview of the current state of quantum image processing (QIP). It discusses foundational representation models, emerging hybrid learning techniques, available software frameworks and simulators, benchmarking practices, and practical applications in areas such as medical imaging, remote sensing, and biometric security. Particular attention is given to solutions that are feasible on today’s NISQ-era hardware, including hybrid architectures and quantum-secured image processing schemes. The survey concludes by identifying existing challenges and outlining realistic future research directions. Overall, it emphasizes the practical importance of hybrid models, the need for standardized quantum-oriented benchmarks, and the growing potential of quantum-based security mechanisms for safeguarding visual data.
Quantum computing represents a foundational paradigm shift from traditional classical computational models, leveraging the intrinsic mechanics of quantum physics—specifically superposition, entanglement, and unitary interference—to execute parallel processing frameworks at an exponential operational scale. This state-of-the-art review systematically deconstructs the mathematical framework of quantum bit (qubit) state vectors within complex Hilbert spaces and details pioneering algorithms like Shor's and Grover's operations. Furthermore, we evaluate dominant contemporary hardware frameworks, specifically contrasting superconducting circuits against trapped-ion architectures across critical indices of coherence metrics, operational speeds, and thermal constraints. Finally, this review highlights systemic algorithmic barriers including phase-flip/bit-flip noise profiles, decoherence phenomena, and real-world deployment challenges across cryptographic infrastructure and biochemical modeling matrices, charting the roadmap from Noisy Intermediate-Scale Quantum (NISQ) systems toward scalable, fault-tolerant ecosystems.