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 (28)
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Supervised learning with quantum enhanced feature spaces
- Quantum computational advantage using photons
- Barren plateaus in quantum neural network training landscapes
- Quantum computational chemistry
- Trapped-Ion Quantum Computing: Progress and Challenges
- Evaluating analytic gradients on quantum hardware
- Towards Practical Quantum Variational Algorithms
- Superconducting qubit in waveguide cavity with coherence time approaching 0.1ms
- Demonstration of the trapped-ion quantum-CCD computer architecture
- Experimental Comparison of Two Quantum Computing Architectures
- Quantum autoencoders for efficient compression of quantum data
- Optimal Quantum Circuits for General Two-Qubit Gates
- An initialization strategy for addressing barren plateaus in parametrized quantum circuits
- Absence of Barren Plateaus in Quantum Convolutional Neural Networks
- The high-coherence fluxonium qubit
- Hybrid quantum-classical approach to correlated materials
- Structure optimization for parameterized quantum circuits
- Estimating the gradient and higher-order derivatives on quantum hardware
- A variational toolbox for quantum multi-parameter estimation
- Measuring Analytic Gradients of General Quantum Evolution with the Stochastic Parameter Shift Rule
- Gradients of parameterized quantum gates using the parameter-shift rule and gate decomposition
- Single qubit gates in frequency-crowded transmon systems
- Autler-Townes splitting in a three-dimensional transmon superconducting qubit
- Finding the ground state of the Hubbard model by variational methods on a quantum computer with gate errors
- Hubbard Hamiltonian in the dimer representation. Large U limit