Accelerating Quantum Eigensolver Algorithms With Machine Learning

Abstract

In this paper, we explore accelerating Hamiltonian ground state energy calculation on NISQ devices. We suggest using search-based methods together with machine learning to accelerate quantum algorithms, exemplified in the Quantum Eigensolver use case. We trained two small models on classically mined data from systems with up to 16 qubits, using XGBoost's Python regressor. We evaluated our preliminary approach on 20-, 24- and 28-qubit systems by optimising the Eigensolver's hyperparameters. These models predict hyperparameter values, leading to a 0.12% reduction in error when tested on 28-qubit systems. However, due to inconclusive results with 20- and 24-qubit systems, we suggest further examination of the training data based on Hamiltonian characteristics. In future work, we plan to train machine learning models to optimise other aspects or subroutines of quantum algorithm execution beyond its hyperparameters.

References in corpus (22)

• Quantum Computing in the NISQ era and beyond
• A variational eigenvalue solver on a quantum processor
• Barren plateaus in quantum neural network training landscapes
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum computational chemistry
• The Variational Quantum Eigensolver: a review of methods and best practices
• An adaptive variational algorithm for exact molecular simulations on a quantum computer
• Towards Quantum Chemistry on a Quantum Computer
• Self-testing of quantum systems: a review
• Quantum computing for finance
• What limits the simulation of quantum computers?
• Efficient classical simulation of noisy random quantum circuits in one dimension
• A comprehensive review of Quantum Machine Learning: from NISQ to Fault Tolerance
• Even shorter quantum circuit for phase estimation on early fault-tolerant quantum computers with applications to ground-state energy estimation
• Does provable absence of barren plateaus imply classical simulability?
• Bugs in Quantum Computing Platforms: An Empirical Study
• A density-matrix renormalization group algorithm for simulating quantum circuits with a finite fidelity
• Enhancing Genetic Improvement Mutations Using Large Language Models
• A Tool For Debugging Quantum Circuits
• Machine learning on quantum experimental data toward solving quantum many-body problems
• Entanglement entropy scaling of noisy random quantum circuits in two dimensions