Using gradient-based algorithms to determine ground state energies on a quantum computer
arXiv:2109.08420 · doi:10.1103/PhysRevA.105.062415
Abstract
Variational algorithms are promising candidates to be implemented on near-term quantum computers. The variational quantum eigensolver (VQE) is a prominent example, where a parametrized trial state of the quantum mechanical wave function is optimized to obtain the ground state energy. In our work, we investigate the variational Hamiltonian Ansatz (VHA), where the trial state is given by a non-interacting reference state modified by unitary rotations using generators that are part of the Hamiltonian describing the system. The lowest energy is obtained by optimizing the angles of those unitary rotations. A standard procedure to optimize the variational parameters is to use gradient-based algorithms. However, shot noise and the intrinsic noise of the quantum device affect the evaluation of the required gradients. We studied how different methods for obtaining the gradient, specifically the finite-difference and the parameter-shift rule, are affected by shot noise and noise of the quantum computer. To this end, we simulated a simple quantum circuit, as well as the 2-site and 6-site Hubbard model.
References in corpus (7)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum computational advantage using photons
- Superconducting qubit in waveguide cavity with coherence time approaching 0.1ms
- Experimental Comparison of Two Quantum Computing Architectures
- Absence of Barren Plateaus in Quantum Convolutional Neural Networks
- Estimating the gradient and higher-order derivatives on quantum hardware
- Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition