Quantum algorithm prepares exact Hadamard product state of two function states with N-independent query complexity when either function has finitely many non-zero Fourier coefficients.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
An efficient quantum Hadamard product algorithm for functions
Quantum algorithm prepares exact Hadamard product state of two function states with N-independent query complexity when either function has finitely many non-zero Fourier coefficients.