Hamiltonian-reconstruction distance as a success metric for the Variational Quantum Eigensolver

Abstract

The Variational Quantum Eigensolver (VQE) is a hybrid quantum-classical algorithm for quantum simulation that can be run on near-term quantum hardware. A challenge in VQE -- as well as any other heuristic algorithm for finding ground states of Hamiltonians -- is to know how close the algorithm's output solution is to the true ground state, when the true ground state and ground-state energy are unknown. This is especially important in iterative algorithms, such as VQE, where one wants to avoid erroneous early termination. Recent developments in Hamiltonian reconstruction -- the inference of a Hamiltonian given an eigenstate -- give a metric can be used to assess the quality of a variational solution to a Hamiltonian-eigensolving problem. This metric can assess the proximity of the variational solution to the ground state without any knowledge of the true ground state or ground-state energy. In numerical simulations and in demonstrations on a cloud-based trapped-ion quantum computer, we show that for examples of both one-dimensional transverse-field-Ising (11 qubits) and two-dimensional J1-J2 transverse-field-Ising (6 qubits) spin problems, the Hamiltonian-reconstruction distance gives a helpful indication of whether VQE has yet found the ground state or not. Our experiments included cases where the energy plateaus as a function of the VQE iteration, which could have resulted in erroneous early stopping of the VQE algorithm, but where the Hamiltonian-reconstruction distance correctly suggests to continue iterating. We find that the Hamiltonian-reconstruction distance has a useful correlation with the fidelity between the VQE solution and the true ground state. Our work suggests that the Hamiltonian-reconstruction distance may be a useful tool for assessing success in VQE, including on noisy quantum processors in practice.

arXiv comment18 pages, 15 figures

References in corpus (44)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Elementary gates for quantum computation
• Variational Quantum Algorithms
• Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
• Barren plateaus in quantum neural network training landscapes
• The theory of variational hybrid quantum-classical algorithms
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms
• Scalable Quantum Simulation of Molecular Energies
• Towards Practical Quantum Variational Algorithms
• Exact and Approximate Unitary 2-Designs: Constructions and Applications
• High-fidelity parallel entangling gates on a neutral atom quantum computer
• Benchmarking an 11-qubit quantum computer
• Direct Fidelity Estimation from Few Pauli Measurements
• Generalized Unitary Coupled Cluster Wavefunctions for Quantum Computation
• Local random quantum circuits are approximate polynomial-designs
• Study of the Two-Dimensional Frustrated J1-J2 Model with Neural Network Quantum States
• Efficient Symmetry-Preserving State Preparation Circuits for the Variational Quantum Eigensolver Algorithm
• Random Quantum Circuits and Pseudo-Random Operators: Theory and Applications
• Witnessing eigenstates for quantum simulation of Hamiltonian spectra
• High-fidelity, high-scalability two-qubit gate scheme for superconducting qubits
• Challenges and Opportunities in Quantum Optimization
• Learning a local Hamiltonian from local measurements
• Multi-Objective Loss Balancing for Physics-Informed Deep Learning
• Entanglement Devised Barren Plateau Mitigation
• Determining a local Hamiltonian from a single eigenstate
• Expressibility of the alternating layered ansatz for quantum computation
• Computational inverse method for constructing spaces of quantum models from wave functions
• Random quantum circuits are approximate unitary $t$-designs in depth $O\left(n{t}^{5+o(1)}\right)$
• Variational Quantum Eigensolver for Frustrated Quantum Systems
• Scaling of variational quantum circuit depth for condensed matter systems
• Efficient unitary designs with a system-size independent number of non-Clifford gates
• Method to identify parent Hamiltonians for trial states
• Scalable reconstruction of unitary processes and Hamiltonians
• Symmetry enhanced variational quantum spin eigensolver
• Avoiding symmetry roadblocks and minimizing the measurement overhead of adaptive variational quantum eigensolvers
• Training variational quantum circuits with CoVaR: covariance root finding with classical shadows
• Supervised learning in Hamiltonian reconstruction from local measurements on eigenstates
• Parent Hamiltonian Reconstruction of Jastrow-Gutzwiller Wavefunctions
• Quantum computational study of chloride ion attack on chloromethane for chemical accuracy and quantum noise effects with UCCSD and k-UpCCGSD ansatzes
• An Efficient Gradient Sensitive Alternate Framework for VQE with Variable Ansatz