Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2507.10739 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917247346278400 |
|---|---|
| author | Podzorova, Marianna Liu, Yi-Kai |
| author_facet | Podzorova, Marianna Liu, Yi-Kai |
| contents | This paper constructs the first quantum algorithm for wavelet packet transforms with a "parabolic scaling" tree structure, sometimes called wave atom transforms. Classically, wave atoms are used to construct sparse representations of differential operators, which enable fast numerical algorithms for partial differential equations. Compared to previous work, 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. The result can be used to improve existing quantum algorithms for solving hyperbolic partial differential equations, such as wave equations. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2507_10739 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Quantum Wave Atom Transforms Podzorova, Marianna Liu, Yi-Kai Quantum Physics Numerical Analysis This paper constructs the first quantum algorithm for wavelet packet transforms with a "parabolic scaling" tree structure, sometimes called wave atom transforms. Classically, wave atoms are used to construct sparse representations of differential operators, which enable fast numerical algorithms for partial differential equations. Compared to previous work, 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. The result can be used to improve existing quantum algorithms for solving hyperbolic partial differential equations, such as wave equations. |
| title | Quantum Wave Atom Transforms |
| topic | Quantum Physics Numerical Analysis |
| url | https://arxiv.org/abs/2507.10739 |