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

arXiv:2405.00929 · Applied and Computational Harmonic Analysis

Quantum wave packet transforms with compact frequency support: Implementations for wavelets and Gabor atoms

Hongkang Ni, Lexing Ying

Published Dec 16, 2025• 2 citations
arXivHTMLPDF
DOI
10.1016/j.acha.2025.101850

Related papers

Wavelet matrix operations and quantum transforms

Zhiguo Zhang, Mark Kon

Applied Mathematics and Computation•May 6, 2022•8 citations

Quantum wave atom transforms

Marianna Podzorova, Yi-Kai Liu

Abstract This paper constructs the first efficient implementation of a quantum wavelet packet transform with a ‘parabolic scaling’ tree structure, sometimes called a quantum wave atom transform. Classically, wave atom transforms are used to construct sparse representations of differential operators, which enable fast classical algorithms for solving wave equations. Compared to previous work on quantum wavelet transforms, our quantum algorithm can implement a larger class of wavelet and wave atom transforms, by using an efficient representation for a larger class of possible tree structures. Our quantum implementation has O ( poly ( n ) ) gate complexity for applying a transform of dimension 2 n , while classical implementations use O ( n 2 n ) floating point operations. This is potentially useful for designing quantum algorithms for solving wave equations that achieve an exponential speedup over classical algorithms.

arXiv:2507.10739•Quantum Science and Technology•Jul 20, 2026•1 citation

Wavelets and wavelet packets on quantum computers

Andreas Klappenecker

We show how periodized wavelet packet transforms and periodized wavelet transforms can be implemented on a quantum computer. Surprisingly, we find that the implementation of wavelet packet transforms is less costly than the implementation of wavelet transforms on a quantum computer.

arXiv:quant-ph/9909014•Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Oct 26, 1999•25 citations

Three-dimensional quantum wavelet transforms

Hai-Sheng Li, Guiqiong Li, Haiying Xia

Frontiers of Computer Science•Dec 31, 2022•17 citations

Quantum Wavelet Transforms: Fast Algorithms and Complete Circuits

Amir Fijany, Colin P. Williams

Lecture notes in computer science•Jan 1, 1999•129 citations

The uncertainty inequality in quantum holography, Bohr’s indeterminacy principle, and synchronized neural networks

Hanlin Chen, Walter Schempp

A rigorous proof of quantum parallelism cannot be based on the Heisenberg inequality because the standard deviation is insensitive to fine structures of the interference pattern generated by a Mach-Zehnder interferometer. Actually Niels Bohr’s indeterminacy principle cannot be based on any of the known uncertainty principles. It is shown how the holographic transform allows to circumvent the difficulties with the standard deviation by using a group theoretical implementation of the canonical commutation relation of quantum electrodynamics. The geometric quantization approach makes the heuristic arguments concerning quantum parallelism rigorous by considering wave packets as symplectic spinors on the hologram plane. It includes the standard uncertainty inequality as a special case. As an application to the area of quantum computers, we study synchronized neural networks and their photonic implementations as suggested by recent experiments in brain research. As another result of the geometric quantization approach to holography, the uncertainty minimizing Gabor wavelets arise which provide useful wavelet expansions for image analysis, segmentation, and compression. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

International series of numerical mathematics•Jan 1, 1992•1 citation
Abstract This paper constructs the first efficient implementation of a quantum wavelet packet transform with a ‘parabolic scaling’ tree structure, sometimes called a quantum wave atom transform. Classically, wave atom transforms are used to construct sparse representations of differential operators, which enable fast classical algorithms for solving wave equations. Compared to previous work on quantum wavelet transforms, our quantum algorithm can implement a larger class of wavelet and wave atom transforms, by using an efficient representation for a larger class of possible tree structures. Our quantum implementation has O ( poly ( n ) ) gate complexity for applying a transform of dimension 2 n , while classical implementations use O ( n 2 n ) floating point operations. This is potentially useful for designing quantum algorithms for solving wave equations that achieve an exponential speedup over classical algorithms.
A rigorous proof of quantum parallelism cannot be based on the Heisenberg inequality because the standard deviation is insensitive to fine structures of the interference pattern generated by a Mach-Zehnder interferometer. Actually Niels Bohr’s indeterminacy principle cannot be based on any of the known uncertainty principles. It is shown how the holographic transform allows to circumvent the difficulties with the standard deviation by using a group theoretical implementation of the canonical commutation relation of quantum electrodynamics. The geometric quantization approach makes the heuristic arguments concerning quantum parallelism rigorous by considering wave packets as symplectic spinors on the hologram plane. It includes the standard uncertainty inequality as a special case. As an application to the area of quantum computers, we study synchronized neural networks and their photonic implementations as suggested by recent experiments in brain research. As another result of the geometric quantization approach to holography, the uncertainty minimizing Gabor wavelets arise which provide useful wavelet expansions for image analysis, segmentation, and compression. These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.