A matrix-free, cached Hessian framework enables memory-efficient Riemannian trust-region optimization of quantum circuit gates, with near-linear parallel speedup up to 112 threads.
100 random quantum gate initializations are generated for each data point, and the median evaluation time is presented
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
High-Performance Contraction of Quantum Circuits for Riemannian Optimization
A matrix-free, cached Hessian framework enables memory-efficient Riemannian trust-region optimization of quantum circuit gates, with near-linear parallel speedup up to 112 threads.