Quantum
A Quantum Continuous Wavelet Transform
Publication: quant-ph updates on arXiv.org
Author: Brani Vidakovic
Source published: 20/11/2026, 05:00:00 UTC
Briefing created: 20/11/2026, 06:00:28 UTC
Based on a feed excerpt; full article content has not been acquired. Source evidence retrieved 20/11/2026, 05:13:25 UTC.
Briefings
A new quantum continuous wavelet transform (QCWT) is proposed on a finite scale grid with non-dyadic scales, using a quantum Fourier transform and a single flag qubit for block encoding. The method bounds success probability for heralded circuits and identifies optimal strategies for scale preparation. A Fourier-basis measurement followed by classical randomization reproduces the flag and scale outcomes, suggesting it captures global scale energies. The architecture loses a factor of about the admissibility constant over squared spectral peak times the logarithmic scale range on logarithmic grids compared to the bound.
Key points
- A quantum continuous wavelet transform (QCWT) is constructed on a finite scale grid with non-dyadic scales using a quantum Fourier transform and a single flag qubit for block encoding.
- A Fourier-basis measurement followed by classical randomization reproduces the flag and scale outcomes of every such heralded circuit exactly, suggesting it captures global scale energies.
Context
This research presents a new quantum algorithm for signal analysis on a finite scale grid, addressing limitations of traditional wavelet transforms by allowing non-dyadic scales. The method uses a quantum Fourier transform and a single flag qubit for block encoding, with a fixed-point resource estimate for a reversible Mexican-hat multiplier. The findings offer a fixed-point resource estimate for a reversible Mexican-hat multiplier, the multinomial law of scale--translation measurements, and Hadamard tests for complex coefficients.
Limitations
The evidence is limited to a single preprint (arXiv:2611.25117v1) with no experimental validation or peer-reviewed publication. The success probability bounds are theoretical and depend on specific scale priors and grid types. The exact admissibility constant factor loss on logarithmic grids is an approximation. The claim of exact reproduction of flag and scale outcomes requires verification against the full circuit description.
Generated by Bittrees-hosted qwen35-2b sha256:aaf42c8b7c3c on 20/11/2026, 06:00:28 UTC. Based on publisher-provided feed evidence; may not cover the full original article. Check the source for details.
View archived briefing on IPFS
bafybeihkr5ur23ni3qg2l7etwldlt6v57dsv7euu5yfq3q4knkoe4iv4xu