An efficient quantum Hadamard product algorithm for functions

Abstract:We propose an efficient quantum algorithm for preparing the Hadamard product state of two quantum states whose amplitudes are generated by functions on a uniform grid with grid number $N$. As the Hadamard product operation is non-unitary, the conventional approach generally suffer from a success probability that scales as $O(1/N)$, leading to an $O(\sqrt{N})$ query complexity even with quantum amplitude amplification. Our method exploits the Fourier-space representation of the input functions, where the Hadamard product can be treated through a convolution structure and approximated using localized Fourier coefficients. The resulting quantum circuit has complexity governed by the Fourier regularity of the underlying functions rather than directly by the grid number. In particular, when either of the input functions has finitely many non-zero Fourier coefficients, the algorithm prepares the exact quantum Hadamard product state under $N$-independent query complexity. Moreover, we also propose a novel quantum circuit for the partial inner product as one of its applications.

arXiv:2606.03612 [quant-ph]

(or arXiv:2606.03612v1 [quant-ph] for this version)

https://doi.org/10.48550/arXiv.2606.03612 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.