REVIEW 1 cited by
Gradient Estimation with Constant Scaling for Hybrid Quantum Machine Learning
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Gradient Estimation with Constant Scaling for Hybrid Quantum Machine Learning
read the original abstract
We present a novel method for determining gradients of parameterised quantum circuits (PQCs) in hybrid quantum-classical machine learning models by applying the multivariate version of the simultaneous perturbation stochastic approximation (SPSA) algorithm. The gradients of PQC layers can be calculated with an overhead of two evaluations per circuit per forward-pass independent of the number of circuit parameters, compared to the linear scaling of the parameter shift rule. These are then used in the backpropagation algorithm by applying the chain rule. We compare our method to the parameter shift rule for different circuit widths and batch sizes, and for a range of learning rates. We find that, as the number of qubits increases, our method converges significantly faster than the parameter shift rule and to a comparable accuracy, even when considering the optimal learning rate for each method.
Forward citations
Cited by 1 Pith paper
-
When cheap gradients fail: the measurement cost of attacking quantum classifiers
Unbiased gradient extraction for attacking quantum classifiers costs at least Θ(d^{5/2}) shots under norm-concentration scaling, and ~d³ for tested deep circuits, so the attacker's relative cost diverges versus classi...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.