Develops Taylor surrogation and Linear Clifford Encoder techniques to explore gradient scalability versus computational complexity in variational quantum algorithms, indicating possible coexistence of non-vanishing gradients and super-polynomial hardness.
This outcome holds with probability one for all observablesH as defined in Eq
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Gradient Scalability and Taylor Surrogation of Quantum Cost Landscapes
Develops Taylor surrogation and Linear Clifford Encoder techniques to explore gradient scalability versus computational complexity in variational quantum algorithms, indicating possible coexistence of non-vanishing gradients and super-polynomial hardness.