Preparing a generic classical data vector as a quantum state provably costs Θ(N) gates, so algorithms that claim O(polylog N) total time on classical data are dominated by their own input stage.
The input problem is permanent
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2026 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
The Input Problem: A Permanent Bottleneck for Quantum Machine Learning
Preparing a generic classical data vector as a quantum state provably costs Θ(N) gates, so algorithms that claim O(polylog N) total time on classical data are dominated by their own input stage.