The nondecimated or translation-invariant wavelet transform (NDWT) is a central tool in classical multiscale signal analysis, valued for its stability, redundancy, and shift invariance. This paper develops two complementary quantum formulations of the NDWT that embed these classical properties coherently into quantum computation. The first formulation is based on the epsilon-decimated interpretation of the NDWT and realizes all circularly shifted wavelet transforms simultaneously by promoting the shift index to a quantum register and applying controlled circular shifts followed by a wavelet analysis unitary. The resulting construction yields an explicit, fully unitary quantum representation of redundant wavelet coefficients and supports coherent postprocessing, including quantum shrinkage via ancilla-driven completely positive trace preserving maps. The second formulation is based on the Hadamard test and uses diagonal phase operators to probe scale-shift wavelet structure through interference, providing direct access to shift-invariant energy scalograms and multiscale spectra without explicit coefficient reconstruction. Together, these two approaches demonstrate that redundancy and translation invariance can be exploited rather than avoided in the quantum setting. Applications to denoising, feature extraction, and spectral scaling illustrate how quantum NDWTs provide a flexible and physically meaningful foundation for multiscale quantum signal processing.
The nondecimated or translation-invariant wavelet transform (NDWT) is a central tool in classical multiscale signal analysis, valued for its stability, redundancy, and shift invariance. This paper develops two complementary quantum formulations of the NDWT that embed these classical properties coherently into quantum computation. The first formulation is based on the epsilon-decimated interpretation of the NDWT and realizes all circularly shifted wavelet transforms simultaneously by promoting the shift index to a quantum register and applying controlled circular shifts followed by a wavelet analysis unitary. The resulting construction yields an explicit, fully unitary quantum representation of redundant wavelet coefficients and supports coherent postprocessing, including quantum shrinkage via ancilla-driven completely positive trace preserving maps. The second formulation is based on the Hadamard test and uses diagonal phase operators to probe scale-shift wavelet structure through interference, providing direct access to shift-invariant energy scalograms and multiscale spectra without explicit coefficient reconstruction. Together, these two approaches demonstrate that redundancy and translation invariance can be exploited rather than avoided in the quantum setting. Applications to denoising, feature extraction, and spectral scaling illustrate how quantum NDWTs provide a flexible and physically meaningful foundation for multiscale quantum signal processing.
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.
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.
This paper develops a unified framework for quantum wavelet shrinkage, extending classical denoising ideas into the quantum domain. Shrinkage is interpreted as a completely positive trace-preserving process, so attenuation of coefficients is carried out through controlled decoherence rather than nonlinear thresholding. Phase damping and ancilla-driven constructions realize this behavior coherently and show that statistical adaptivity and quantum unitarity can be combined within a single circuit model. The same physical mechanisms that reduce quantum coherence, such as dephasing and amplitude damping, are repurposed as programmable resources for noise suppression. Practical demonstrations implemented with Qiskit illustrate how circuits and channels emulate coefficientwise attenuation, and all examples are provided as Jupyter notebooks in the companion GitHub repository. Encoding schemes for amplitude, phase, and hybrid representations are examined in relation to transform coherence and measurement feasibility, and realizations suited to current noisy intermediate-scale quantum devices are discussed. The work provides a conceptual and experimental link between wavelet-based statistical inference and quantum information processing, and shows how engineered decoherence can act as an operational surrogate for classical shrinkage.
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(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.
The representation of discrete, compact wavelet transformations (WTs) as circuits of local unitary gates is discussed. We employ a similar formalism as used in the multiscale representation of quantum many-body wave functions using unitary circuits, further cementing the relation established in the literature between classical and quantum multiscale methods. An algorithm for constructing the circuit representation of known orthogonal, dyadic, discrete WTs is presented, and the explicit representation for Daubechies wavelets, coiflets, and symlets is provided. Furthermore, we demonstrate the usefulness of the circuit formalism in designing WTs, including various classes of symmetric wavelets and multiwavelets, boundary wavelets, and biorthogonal wavelets.
In this work we reconstruct Quantum Mechanical wave functions for some confining potentials, using the moment-wavelet method of Handy and Murenzi. This method consists in transforming the Schrodinger equation into an equivalent continuous wavelet transform (CWT) representation involving scaled and translated moments, µ1/ α,b (p)=∫χpe-Q\\( Ψ(x +b), where ϐ -Q becomes the mother wavelet. The discrete bound states are determined through a multiscale process involving the integration of a finite number of coupled linear first order differential equation in the moments µ1/ α,b (p). The underlying initial value problem depends on moment quantization methods to determine the infinite scale (a = ∞) moments and energy. Using this method we calculate the energies and wavefunctions for the first two quantum states of quartic and dectic anharmonic oscillator potentials, V(x) = mχ2 + gχ4, V(χ) = χ 2+χ10 respectively.