A QSVT-based quantum gradient descent algorithm is proposed that avoids coherent oracle access, but key construction steps and complexity claims are not adequately supported.
0 0 0 · · ·xn,0 The time complexity, or quantum circuit depth of this step is O(log(n)) and spatial complexity is O(log(n))
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Simple Quantum Gradient Descent Without Coherent Oracle Access
A QSVT-based quantum gradient descent algorithm is proposed that avoids coherent oracle access, but key construction steps and complexity claims are not adequately supported.