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

Discover Applied Sciences

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

Wael Badawy

Published Oct 2, 2026• 0 citations
Publisher

Abstract

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.

DOI
10.1007/s42452-026-09469-1

Related papers

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

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

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 Survey on Quantum Image Representations: Opportunities, Challenges, and Future Directions in Quantum AI and Machine Learning

Vrushali Nikam, Shirish S. Sane

Quantum Image Representation (QIR) has become a key component of Quantum Image Processing (QIP), enabling the encoding and manipulation of visual data within quantum computing environments.Its integration with Quantum Artificial Intelligence (QAI) and Quantum Machine Learning (QML) has attracted significant research interest due to the potential advantages of quantum parallelism and compact data representation.This survey reviews major QIR techniques, analyzes their encoding strategies and computational characteristics, and examines their opportunities, challenges, and future relevance in quantum AI and machine learning applications.A systematic review of 70 peer-reviewed journal and conference publications published between 1992 and 2025 was conducted.The selected studies were evaluated based on encoding mechanisms, qubit requirements, circuit complexity, retrieval capability, scalability, and suitability for quantum image processing and learning tasks.The review covers prominent QIR models, including FRQI, NEQR, MCQI, QPIE, GQIR, QRMW, and tensor-network-based representations.Comparative analysis reveals important trade-offs between qubit efficiency, encoding complexity, retrieval accuracy, and scalability.Amplitude-based approaches provide compact image encoding but suffer from probabilistic retrieval, whereas basis-state representations offer deterministic recovery at the expense of increased circuit complexity.QIR demonstrates significant potential in image classification, feature extraction, image compression, and hybrid quantum-classical learning frameworks.QIR provides a promising foundation for next-generation quantum-enhanced visual intelligence systems.However, practical implementation remains constrained by state preparation overhead, noise, decoherence, limited qubit availability, and the lack of standardized evaluation frameworks.Future research should focus on scalable encoding methods, fault-tolerant quantum architectures, benchmarking standards, and deeper integration with advanced QML models to accelerate the development of practical quantum image analytics.

International Multidisciplinary Knowledge Exchange Journal•Mar 31, 2026•0 citations

Quantum algorithms

Pawan Kumar Verma, Mohit Kumar, Saurabh Singhal +1 more

This chapter highlights quantum algorithms as a gate-based computational framework that exploits superposition, entanglement, and phase-coherent interference to realize demonstrable complexity reductions on selected problems. It begins by formally distinguishing quantum algorithms from classical deterministic and randomized computation through reversible unitary evolution, oracle-based problem access, and the measurement constraint that collapses quantum state information, thereby motivating amplitude-engineering strategies that amplify correct outcomes while suppressing incorrect ones. This chapter then surveys quantum speedup as a nuanced concept, clarifying that advantage is problem-dependent, often derived under idealized fault-tolerant assumptions, and practically bounded in noisy intermediate-scale quantum devices by decoherence, gate infidelity, circuit-depth overhead, and benchmarking/verification limitations. Two canonical algorithmic families are developed in depth: Shor’s algorithm, framed as reduction of integer factorization to order/period finding via coherent modular exponentiation and the quantum Fourier transform with explicit resource and cryptographic implications; and Grover’s algorithm, formulated as optimal unstructured search through oracle phase marking, diffusion (inversion about the mean), and its generalization to amplitude amplification as a reusable primitive. Building on these exemplars, this chapter distills design principles for constructing effective quantum algorithms, including superposition management, oracle synthesis and state manipulation, and systematic minimization of gate count, depth, and expensive non-Clifford resources under hardware constraints. It concludes by mapping these foundations to active research directions—quantum approximation methods such as quantum approximate optimization algorithm, hybrid quantum–classical variational workflows, and quantum machine learning—highlighting how practical progress depends on hardware-aware compilation, resource optimization, and interference-driven algorithm design.

CRC Press eBooks•Nov 6, 2026•0 citations

Integration of Quantum Computing with Artificial Intelligence: A Systematic Review

Ankit Sharma, Zohaib Ali

Objective: To synthesize the state of the art on how quantum computing (QC) and artificial intelligence (AI) intersect, including algorithmic foundations, software/hardware stacks, empirical evidence of advantage, applications, and open challenges. Methods: We executed a structured search (2019 – 20th August 2025) across major journals (Nature portfolio, APS/PR, Elsevier), arXiv, and official framework documentation (Qiskit, Cirq/TFQ, PennyLane; AWS Braket; NVIDIA CUDA-Q). We included peer‑reviewed studies, comprehensive surveys, and official docs; we excluded opinion pieces and non-reproducible claims. Results: The field converges on hybrid quantum‑classical workflows with two dominant AI families: (i) quantum kernel methods and (ii) variational circuits/QNNs. Trainability remains a core challenge (barren plateaus and noise), with mitigation strategies advancing (local costs, layerwise training, engineered dissipation, learned decoders). Frameworks and cloud orchestrators now support end‑to‑end hybrid training. Empirical “utility” demonstrations in physics‑inspired tasks exist, while domain‑level advantage in mainstream ML is unproven and data‑dependent. Conclusions: QC‑AI integration is maturing into reproducible hybrid stacks. Near‑term value lies in quantum kernels with tailored feature maps, physics‑regularized QNNs, simulator‑accelerated pipelines, and AI‑for‑QC (calibration/decoding). Broad ML advantage awaits lower‑noise hardware and quantum‑friendly data embeddings.

Journal of Engineering Research and Reports•Sep 16, 2025•2 citations
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.
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.
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.
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 Image Representation (QIR) has become a key component of Quantum Image Processing (QIP), enabling the encoding and manipulation of visual data within quantum computing environments.Its integration with Quantum Artificial Intelligence (QAI) and Quantum Machine Learning (QML) has attracted significant research interest due to the potential advantages of quantum parallelism and compact data representation.This survey reviews major QIR techniques, analyzes their encoding strategies and computational characteristics, and examines their opportunities, challenges, and future relevance in quantum AI and machine learning applications.A systematic review of 70 peer-reviewed journal and conference publications published between 1992 and 2025 was conducted.The selected studies were evaluated based on encoding mechanisms, qubit requirements, circuit complexity, retrieval capability, scalability, and suitability for quantum image processing and learning tasks.The review covers prominent QIR models, including FRQI, NEQR, MCQI, QPIE, GQIR, QRMW, and tensor-network-based representations.Comparative analysis reveals important trade-offs between qubit efficiency, encoding complexity, retrieval accuracy, and scalability.Amplitude-based approaches provide compact image encoding but suffer from probabilistic retrieval, whereas basis-state representations offer deterministic recovery at the expense of increased circuit complexity.QIR demonstrates significant potential in image classification, feature extraction, image compression, and hybrid quantum-classical learning frameworks.QIR provides a promising foundation for next-generation quantum-enhanced visual intelligence systems.However, practical implementation remains constrained by state preparation overhead, noise, decoherence, limited qubit availability, and the lack of standardized evaluation frameworks.Future research should focus on scalable encoding methods, fault-tolerant quantum architectures, benchmarking standards, and deeper integration with advanced QML models to accelerate the development of practical quantum image analytics.
This chapter highlights quantum algorithms as a gate-based computational framework that exploits superposition, entanglement, and phase-coherent interference to realize demonstrable complexity reductions on selected problems. It begins by formally distinguishing quantum algorithms from classical deterministic and randomized computation through reversible unitary evolution, oracle-based problem access, and the measurement constraint that collapses quantum state information, thereby motivating amplitude-engineering strategies that amplify correct outcomes while suppressing incorrect ones. This chapter then surveys quantum speedup as a nuanced concept, clarifying that advantage is problem-dependent, often derived under idealized fault-tolerant assumptions, and practically bounded in noisy intermediate-scale quantum devices by decoherence, gate infidelity, circuit-depth overhead, and benchmarking/verification limitations. Two canonical algorithmic families are developed in depth: Shor’s algorithm, framed as reduction of integer factorization to order/period finding via coherent modular exponentiation and the quantum Fourier transform with explicit resource and cryptographic implications; and Grover’s algorithm, formulated as optimal unstructured search through oracle phase marking, diffusion (inversion about the mean), and its generalization to amplitude amplification as a reusable primitive. Building on these exemplars, this chapter distills design principles for constructing effective quantum algorithms, including superposition management, oracle synthesis and state manipulation, and systematic minimization of gate count, depth, and expensive non-Clifford resources under hardware constraints. It concludes by mapping these foundations to active research directions—quantum approximation methods such as quantum approximate optimization algorithm, hybrid quantum–classical variational workflows, and quantum machine learning—highlighting how practical progress depends on hardware-aware compilation, resource optimization, and interference-driven algorithm design.
Objective: To synthesize the state of the art on how quantum computing (QC) and artificial intelligence (AI) intersect, including algorithmic foundations, software/hardware stacks, empirical evidence of advantage, applications, and open challenges. Methods: We executed a structured search (2019 – 20th August 2025) across major journals (Nature portfolio, APS/PR, Elsevier), arXiv, and official framework documentation (Qiskit, Cirq/TFQ, PennyLane; AWS Braket; NVIDIA CUDA-Q). We included peer‑reviewed studies, comprehensive surveys, and official docs; we excluded opinion pieces and non-reproducible claims. Results: The field converges on hybrid quantum‑classical workflows with two dominant AI families: (i) quantum kernel methods and (ii) variational circuits/QNNs. Trainability remains a core challenge (barren plateaus and noise), with mitigation strategies advancing (local costs, layerwise training, engineered dissipation, learned decoders). Frameworks and cloud orchestrators now support end‑to‑end hybrid training. Empirical “utility” demonstrations in physics‑inspired tasks exist, while domain‑level advantage in mainstream ML is unproven and data‑dependent. Conclusions: QC‑AI integration is maturing into reproducible hybrid stacks. Near‑term value lies in quantum kernels with tailored feature maps, physics‑regularized QNNs, simulator‑accelerated pipelines, and AI‑for‑QC (calibration/decoding). Broad ML advantage awaits lower‑noise hardware and quantum‑friendly data embeddings.