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

Bulletin of the American Physical Society

Generalized Cat States via Daubechies Wavelet Transform

Namrata Shukla, Barry C. Sanders

Published Mar 6, 2018• 0 citations
OpenAlex

Related papers

Wavelet Transform of Even- and Odd-Coherent States

Jun Song, Hong-Yi Fan

International Journal of Theoretical Physics•Aug 19, 2010•4 citations

Complex Wavelet Transform of the Bell States

Jun Song, Hong-Yi Fan, Ye‐Jun Xu +1 more

International Journal of Theoretical Physics•Feb 11, 2011•2 citations

Complex Wavelet Transform of the Two-mode Quantum States

Jun Song, Jun Zhou, Hao Yuan +2 more

International Journal of Theoretical Physics•Mar 23, 2016•1 citation

Coherent States, Wavelets, and Their Generalizations

S. Twareque Ali, Jean-Pierre Antoine, Jean‐Pierre Gazeau

Theoretical and mathematical physics•Oct 29, 2013•182 citations

Quantum wavelet transforms of any order

Francisco Argüello

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.

Quantum Information and Computation•May 1, 2009•3 citations

Coherent States, Wavelets and Their Generalizations

S. Twareque Ali, Jean-Pierre Antoine, Jean‐Pierre Gazeau

Graduate texts in contemporary physics•Jan 1, 2000•710 citations
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.