REVIEW 1 cited by
Generalized quantum circuit differentiation rules
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
Generalized quantum circuit differentiation rules
read the original abstract
Variational quantum algorithms that are used for quantum machine learning rely on the ability to automatically differentiate parametrized quantum circuits with respect to underlying parameters. Here, we propose the rules for differentiating quantum circuits (unitaries) with arbitrary generators. Unlike the standard parameter shift rule valid for unitaries generated by operators with spectra limited to at most two unique eigenvalues (represented by involutory and idempotent operators), our approach also works for generators with a generic non-degenerate spectrum. Based on a spectral decomposition, we derive a simple recipe that allows explicit derivative evaluation. The derivative corresponds to the weighted sum of measured expectations for circuits with shifted parameters. The number of function evaluations is equal to the number of unique positive non-zero spectral gaps (eigenvalue differences) for the generator. We apply the approach to relevant examples of two-qubit gates, among others showing that the fSim gate can be differentiated using four measurements. Additionally, we present generalized differentiation rules for the case of Pauli string generators, based on distinct shifts (here named as the triangulation approach), and analyse the variance for derivative measurements in different scenarios. Our work offers a toolbox for the efficient hardware-oriented differentiation needed for circuit optimization and operator-based derivative representation.
Forward citations
Cited by 1 Pith paper
-
An Operational Framework for Nonclassicality in Quantum Communication Networks
A variational optimization framework computes linear classical bounds on network input/output probabilities whose violation certifies nonclassicality, finding entanglement necessary for nonclassicality in single-sende...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.