Riemannian modified Newton optimization on quantum search achieves quadratic convergence and O(√(N/M) log log(1/ε)) complexity when M/N is known.
Quantum circuit design from a retraction-based riemannian optimization framework.arXiv preprint arXiv:2602.20605, 2026
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
Unifies fixed-ansatz and adaptive VQE via ansatz-free product-unitary formulation on the unitary group and derives convergence rates, initialization guarantees, and noise-robust measurement strategies for Riemannian gradient descent.
citing papers explorer
-
Achieving double-logarithmic precision dependence in optimization-based quantum unstructured search
Riemannian modified Newton optimization on quantum search achieves quadratic convergence and O(√(N/M) log log(1/ε)) complexity when M/N is known.
-
Geometric Analysis of Variational Quantum Eigensolver
Unifies fixed-ansatz and adaptive VQE via ansatz-free product-unitary formulation on the unitary group and derives convergence rates, initialization guarantees, and noise-robust measurement strategies for Riemannian gradient descent.