Calculus on parameterized quantum circuits
read the original abstract
Mitarai, Negoro, Kitagawa, and Fujii proposed a type of parameterized quantum circuits, for which they gave a way to estimate derivatives wrt the parameters using only changes in the values of the parameters, not in the circuit itself, i.e., no ancillas or controlled operations. Recently, Schuld et al. have extended the results, but they need to revert to ancillas and controlled operations for some cases. In this note, we extend the types of MiNKiF circuits for which derivatives can be computed without ancillas or controlled operations --- at the cost of a larger number of evaluation points. We also propose a "training" (i.e., optimizing the parameters) which takes advantage of our approach.
This paper has not been read by Pith yet.
Forward citations
Cited by 3 Pith papers
-
One Coordinate at a Time: Convergence Guarantees for Rotosolve in Variational Quantum Algorithms
Rotosolve converges to ε-stationary points for smooth non-convex objectives and ε-suboptimal points under PL, with explicit worst-case rates in the finite-shot regime, outperforming or matching RCD in nuanced ways.
-
Quantum computation at the edge of chaos
Topological entanglement entropy regularizes variational quantum algorithms to enforce quantum sparsity and operate at the edge of chaos for better trainability.
-
Mitigating the barren plateau problem in linear optics
A dual-valued phase shifter in linear optics creates variational cost landscapes with fewer local minima and outperforms prior linear-optical variational algorithms by mitigating barren plateaus.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.