Corpus ID: 236447474

General parameter-shift rules for quantum gradients

@inproceedings{Wierichs2021GeneralPR,
  title={General parameter-shift rules for quantum gradients},
  author={David Alexander Wierichs and Josh A. Izaac and Cody Wang and Cedric Yen-Yu Lin},
  year={2021}
}
Variational quantum algorithms are ubiquitous in applications of noisy intermediatescale quantum computers. Due to the structure of conventional parametrized quantum gates, the evaluated functions typically are finite Fourier series of the input parameters. In this work, we use this fact to derive new, general parameter-shift rules for single-parameter gates, and provide closed-form expressions to apply them. These rules are then extended to multi-parameter quantum gates by combining them with… Expand

Figures and Tables from this paper

Analytical Ground- and Excited-State Gradients for Molecular Electronic Structure Theory from Hybrid Quantum/Classical Methods
We develop analytical gradients of groundand excited-state energies with respect to system parameters including the nuclear coordinates for the hybrid quantum/classical multistate contractedExpand
Analytical nonadiabatic couplings and gradients within the state-averaged orbital-optimized variational quantum eigensolver
Saad Yalouz, 2, ∗ Emiel Koridon, ∗ Bruno Senjean, † Benjamin Lasorne, ‡ Francesco Buda, and Lucas Visscher Theoretical Chemistry, Vrije Universiteit, De Boelelaan 1083, NL-1081 HV, Amsterdam, TheExpand

References

SHOWING 1-10 OF 131 REFERENCES
Single-component gradient rules for variational quantum algorithms
TLDR
This work provides a comprehensive picture of the family of gradient rules that vary parameters of quantum gates individually and proposes a generalized parameter shift rule that expresses all members of the aforementioned family as special cases, and introduces a novel perspective for approaching new gradient rules. Expand
Analytic gradients in variational quantum algorithms: Algebraic extensions of the parameter-shift rule to general unitary transformations
Optimization of unitary transformations in Variational Quantum Algorithms benefits highly from efficient evaluation of cost function gradients with respect to amplitudes of unitary generators. WeExpand
Evaluating analytic gradients on quantum hardware
An important application for near-term quantum computing lies in optimization tasks, with applications ranging from quantum chemistry and drug discovery to machine learning. In many settings --- mostExpand
Variational quantum state diagonalization
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gateExpand
Quantum-assisted quantum compiling
TLDR
This work proposes a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC), and presents both gradient-free and gradient-based approaches to minimizing the cost of this algorithm's cost. Expand
Sequential minimal optimization for quantum-classical hybrid algorithms
TLDR
A sequential minimal optimization method for quantum-classical hybrid algorithms, which converges faster, is robust against statistical error, and is hyperparameter-free, which substantially outperforms the existing optimization algorithms and converges to a solution almost independent of the initial choice of the parameters. Expand
Variational Quantum Algorithms
TLDR
An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed. Expand
Variational Quantum Factoring
TLDR
The proposed variational quantum factoring (VQF) algorithm starts by simplifying equations over Boolean variables in a preprocessing step to reduce the number of qubits needed for the Hamiltonian, and seeks an approximate ground state of the resulting Ising Hamiltonian by training variational circuits using the quantum approximate optimization algorithm (QAOA). Expand
Hybrid Quantum-Classical Approach to Quantum Optimal Control.
TLDR
It is shown that the most computationally demanding part of gradient-based algorithms, namely, computing the fitness function and its gradient for a control input, can be accomplished by the process of evolution and measurement on a quantum simulator. Expand
Fisher Information in Noisy Intermediate-Scale Quantum Applications
The recent advent of noisy intermediatescale quantum devices, especially near-term quantum computers, has sparked extensive research efforts concerned with their possible applications. At theExpand
...
1
2
3
4
5
...