Adaptive Random Quantum Eigensolver

Abstract

We propose an adaptive random quantum algorithm to obtain an optimized eigensolver. Specifically, we introduce a general method to parametrize and optimize the probability density function of a random number generator, which is the core of stochastic algorithms. We follow a bioinspired evolutionary mutation method to introduce changes in the involved matrices. Our optimization is based on two figures of merit: learning speed and learning accuracy. This method provides high fidelities for the searched eigenvectors and faster convergence on the way to quantum advantage with current noisy intermediate-scaled quantum computers.

7+5 pages, 9 figures, 2 tables

References in corpus (17)

• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Quantum algorithm for solving linear systems of equations
• Quantum computational advantage using photons
• An introduction to quantum machine learning
• Quantum computing with trapped ions
• Strong quantum computational advantage using a superconducting quantum processor
• Towards fault-tolerant quantum computing with trapped ions
• Quantum reinforcement learning
• Superconducting Quantum Computing: A Review
• Deep Reinforcement Learning for Quantum Gate Control
• Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
• Topological Quantum Compiling with Reinforcement Learning
• A measurement-based variational quantum eigensolver
• Deep Reinforcement Learning Control of Quantum Cartpoles
• A Reinforcement Learning approach for Quantum State Engineering
• Quantum machine learning and quantum biomimetics: A perspective
• Experimental semi-autonomous eigensolver using reinforcement learning