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
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
quant-ph 3years
2026 3verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Monotonic concave amplification functions of the form N minus the product of exponentials yield decay rates for the optimal value of multiplayer games under parallel repetition.
Quantum algorithms for element-wise polynomial matrix transforms achieve exponential space reduction in polynomial degree with corrections to prior constructions.
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.
-
Multiplayer parallel repetition without dependency-breaking and anchoring variables: monotonic, concave amplification
Monotonic concave amplification functions of the form N minus the product of exponentials yield decay rates for the optimal value of multiplayer games under parallel repetition.
-
Quantum element-wise transforms
Quantum algorithms for element-wise polynomial matrix transforms achieve exponential space reduction in polynomial degree with corrections to prior constructions.