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
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
PODR precomputes a proper orthogonal decomposition basis from classical solutions to project quantum states onto a minimal set of coefficients for reconstruction, reducing measurements in online quantum simulations.
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.
-
Problem-Specific Basis Quantum State Readout via Proper Orthogonal Decomposition
PODR precomputes a proper orthogonal decomposition basis from classical solutions to project quantum states onto a minimal set of coefficients for reconstruction, reducing measurements in online quantum simulations.