QCGD converts Riemannian conjugate gradient into a recursive unitary update that beats DB-QITE on energy reduction per step and matched-fidelity circuit cost for tested Heisenberg instances.
Riemannian gradient descent-based quantum algorithms for ground state preparation with guarantees.arXiv preprint arXiv:2512.13401, 2025
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
quant-ph 3years
2026 3representative 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
-
Quantum-compatible Riemannian conjugate gradient for ground-state preparation
QCGD converts Riemannian conjugate gradient into a recursive unitary update that beats DB-QITE on energy reduction per step and matched-fidelity circuit cost for tested Heisenberg instances.
-
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.
- Achieving double-logarithmic precision dependence in optimization-based quantum unstructured search