The classical wavelet transform has been widely applied in the information processing field. It implies that quantum wavelet transform (QWT) may play an important role in quantum information processing. This chapter firstly describes the iteration equations of the general QWT using generalized tensor product. Then, Haar QWT (HQWT), Daubechies D4 QWT (DQWT), and their inverse transforms are proposed respectively. Meanwhile, the circuits of the two kinds of multi-level HQWT are designed. What's more, the multi-level DQWT based on the periodization extension is implemented. The complexity analysis shows that the proposed multi-level QWTs on 2n elements can be implemented by O(n3) basic operations. Simulation experiments demonstrate that the proposed QWTs are correct and effective.
The classical wavelet transform has been widely applied in the information processing field. It implies that quantum wavelet transform (QWT) may play an important role in quantum information processing. This chapter firstly describes the iteration equations of the general QWT using generalized tensor product. Then, Haar QWT (HQWT), Daubechies D4 QWT (DQWT), and their inverse transforms are proposed respectively. Meanwhile, the circuits of the two kinds of multi-level HQWT are designed. What's more, the multi-level DQWT based on the periodization extension is implemented. The complexity analysis shows that the proposed multi-level QWTs on 2n elements can be implemented by O(n3) basic operations. Simulation experiments demonstrate that the proposed QWTs are correct and effective.
Abstract The classical wavelet packet transform has been widely applied in the information processing field. It implies that the quantum wavelet packet transform (QWPT) can play an important role in quantum information processing. In this paper, we design quantum circuits of a generalized tensor product (GTP) and a perfect shuffle permutation (PSP). Next, we propose multi-level and multi-dimensional (1D, 2D and 3D) QWPTs, including a Haar QWPT (HQWPT), a D4 QWPT (DQWPT) based on the periodization extension and their inverse transforms for the first time, and prove the correctness based on the GTP and PSP. Furthermore, we analyze the quantum costs and the time complexities of our proposed QWPTs and obtain precise results. The time complexities of HQWPTs is at most 6 on 2n elements, which illustrates high-efficiency of the proposed QWPTs. Simulation experiments demonstrate that the proposed QWPTs are correct and effective.
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.
Quantum wavelet packet transform (QWPT) may play an important role in quantum information processing. In this chapter, the authors design quantum circuits of a generalized tensor product (GTP) and a perfect shuffle permutation (PSP). Next, they propose multi-level and multi-dimensional (1D, 2D and 3D) QWPTs, including Haar QWPT (HQWPT), D4 QWPT (DQWPT) based on the periodization extension and their inverse transforms for the first time, and prove the correctness based on the GTP and PSP. Furthermore, they analyze the quantum costs and the time complexities of the proposed QWPTs and obtain precise results. The time complexities of HQWPTs is at most six basic operations on 2n elements, which illustrates high efficiency of the proposed QWPTs.
Abstract Wavelet transforms are widely used in various fields of science and engineering as a mathematical tool with features that reveal information ignored by the Fourier transform. Unlike the Fourier transform, which is unique, a wavelet transform is specified by a sequence of numbers associated with the type of wavelet used and an order parameter specifying the length of the sequence. While the quantum Fourier transform, a quantum analog of the classical Fourier transform, has been pivotal in quantum computing, prior works on quantum wavelet transforms (QWTs) were limited to the second and fourth order of a particular wavelet, the Daubechies wavelet. Here we develop a simple yet efficient quantum algorithm for executing any wavelet transform on a quantum computer. Our approach is to decompose the kernel matrix of a wavelet transform as a linear combination of unitaries (LCU) that are compilable by easy-to-implement modular quantum arithmetic operations and use the LCU technique to construct a probabilistic procedure to implement a QWT with a known success probability. We then use properties of wavelets to make this approach deterministic by a few executions of the amplitude amplification strategy. We extend our approach to a multilevel wavelet transform and a generalized version, the packet wavelet transform, establishing computational complexities in terms of three parameters: the wavelet order M , the dimension N of the transformation matrix, and the transformation level d . We show the cost is logarithmic in N , linear in d and superlinear in M . Moreover, we show the cost is independent of M for practical applications. Our proposed QWTs could be used in quantum computing algorithms in a similar manner to their well-established counterpart, the quantum Fourier transform.
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,which based on the circuits of those transforms.In this paper,the circuits of 3-qubit Haar and D(4) wavelet transforms are designed by way of multiple-quantum operator algebra theory.Furthermore,the circuits are evolved into pulse sequences,which can be implemented in a real NMR system.Finally,based on the simulation on a Quantum Computer Emulator,the circuits are verified to be reasonable.
Many classical algorithms are known to efficiently compute the wavelet transforms. However, those classical algorithms cannot be directly translated to quantum algorithms. Recently, efficient and complete quantum algorithms for two representative wavelet transforms (quantum Haar and quantum Daubechies of fourth order) have been proposed. In this paper, we generalize these algorithms in order to they can be applied to Daubechies wavelet kernels of any order. Specifically, we develop a method that efficiently factorize those kernels. The factorization is compatible with the existing pyramidal and packet quantum wavelet algorithms. All steps of the algorithm are unitary and easily implementable on a quantum computer.